java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_true-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:07:16,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:07:16,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:07:16,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:07:16,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:07:16,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:07:16,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:07:16,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:07:16,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:07:16,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:07:16,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:07:16,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:07:16,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:07:16,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:07:16,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:07:16,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:07:16,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:07:16,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:07:16,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:07:16,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:07:16,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:07:16,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:07:16,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:07:16,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:07:16,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:07:16,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:07:16,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:07:16,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:07:16,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:07:16,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:07:16,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:07:16,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:07:16,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:07:16,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:07:16,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:07:16,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:07:16,497 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:07:16,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:07:16,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:07:16,518 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:07:16,518 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:07:16,519 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:07:16,519 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:07:16,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:07:16,520 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:07:16,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:07:16,521 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:07:16,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:07:16,521 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:07:16,521 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:07:16,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:07:16,522 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:07:16,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:07:16,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:07:16,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:07:16,606 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:07:16,606 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:07:16,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_true-unreach-call1.i_3.bpl [2018-10-15 13:07:16,608 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_true-unreach-call1.i_3.bpl' [2018-10-15 13:07:16,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:07:16,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:07:16,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:07:16,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:07:16,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:07:16,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:07:16,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:07:16,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:07:16,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:07:16,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:07:16,768 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:07:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:07:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:07:16,987 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:07:16,987 INFO L202 PluginConnector]: Adding new model phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:16 BoogieIcfgContainer [2018-10-15 13:07:16,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:07:16,988 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:07:16,988 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:07:16,989 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:07:16,993 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:16" (1/1) ... [2018-10-15 13:07:16,998 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:07:17,015 INFO L202 PluginConnector]: Adding new model phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:07:17 BasicIcfg [2018-10-15 13:07:17,015 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:07:17,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:07:17,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:07:17,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:07:17,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:07:16" (1/3) ... [2018-10-15 13:07:17,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a76283 and model type phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:07:17, skipping insertion in model container [2018-10-15 13:07:17,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:16" (2/3) ... [2018-10-15 13:07:17,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a76283 and model type phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:07:17, skipping insertion in model container [2018-10-15 13:07:17,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_true-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:07:17" (3/3) ... [2018-10-15 13:07:17,024 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:07:17,034 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:07:17,043 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:07:17,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:07:17,091 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:07:17,092 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:07:17,092 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:07:17,092 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:07:17,093 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:07:17,093 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:07:17,093 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:07:17,093 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:07:17,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:07:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 13:07:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:07:17,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:17,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:17,124 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:17,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash 600124808, now seen corresponding path program 1 times [2018-10-15 13:07:17,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:17,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:07:17,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:07:17,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:07:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:07:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:07:17,450 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 13:07:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:17,545 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 13:07:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:07:17,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:07:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:17,560 INFO L225 Difference]: With dead ends: 19 [2018-10-15 13:07:17,560 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 13:07:17,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:07:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 13:07:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-15 13:07:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 13:07:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 13:07:17,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-15 13:07:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:17,594 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 13:07:17,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:07:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 13:07:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 13:07:17,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:17,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:17,595 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:17,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1880928361, now seen corresponding path program 1 times [2018-10-15 13:07:17,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:17,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:17,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:07:17,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:07:17,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:07:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:07:17,941 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-15 13:07:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:18,194 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:07:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:07:18,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-15 13:07:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:18,196 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:07:18,196 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:07:18,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:07:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:07:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-15 13:07:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:07:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 13:07:18,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-15 13:07:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:18,202 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 13:07:18,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:07:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 13:07:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:07:18,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:18,205 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:18,205 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:18,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:18,206 INFO L82 PathProgramCache]: Analyzing trace with hash 618864360, now seen corresponding path program 2 times [2018-10-15 13:07:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:18,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:18,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:07:18,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:07:18,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:07:18,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:07:18,558 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-10-15 13:07:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:18,896 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 13:07:18,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:07:18,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-15 13:07:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:18,900 INFO L225 Difference]: With dead ends: 29 [2018-10-15 13:07:18,900 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 13:07:18,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:07:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 13:07:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 13:07:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 13:07:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 13:07:18,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-15 13:07:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:18,907 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 13:07:18,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:07:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 13:07:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 13:07:18,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:18,911 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:18,911 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:18,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1666893257, now seen corresponding path program 3 times [2018-10-15 13:07:18,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:19,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:19,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:07:19,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:07:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:07:19,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:07:19,205 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-15 13:07:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:19,858 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 13:07:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:07:19,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-15 13:07:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:19,861 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:07:19,861 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 13:07:19,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:07:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 13:07:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-15 13:07:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:07:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:07:19,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-15 13:07:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:19,868 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:07:19,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:07:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:07:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:07:19,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:19,869 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:19,869 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:19,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:19,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1204475976, now seen corresponding path program 4 times [2018-10-15 13:07:19,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:20,161 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-15 13:07:20,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:20,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:07:20,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:07:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:07:20,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:07:20,163 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-10-15 13:07:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:20,603 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 13:07:20,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:07:20,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-15 13:07:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:20,611 INFO L225 Difference]: With dead ends: 39 [2018-10-15 13:07:20,612 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 13:07:20,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:07:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 13:07:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-15 13:07:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 13:07:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 13:07:20,617 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-15 13:07:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:20,618 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 13:07:20,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:07:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 13:07:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 13:07:20,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:20,619 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:20,620 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:20,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2038801193, now seen corresponding path program 5 times [2018-10-15 13:07:20,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:20,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:20,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:07:20,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:07:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:07:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:07:20,996 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-10-15 13:07:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:21,895 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 13:07:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:07:21,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-15 13:07:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:21,898 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:07:21,898 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:07:21,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:07:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:07:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 13:07:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:07:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 13:07:21,904 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-15 13:07:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:21,905 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 13:07:21,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:07:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 13:07:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:07:21,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:21,907 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:21,907 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:21,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1357011368, now seen corresponding path program 6 times [2018-10-15 13:07:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:22,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:22,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:07:22,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:07:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:07:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:07:22,178 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-10-15 13:07:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:22,762 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 13:07:22,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:07:22,764 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-15 13:07:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:22,766 INFO L225 Difference]: With dead ends: 49 [2018-10-15 13:07:22,766 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:07:22,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:07:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:07:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-15 13:07:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 13:07:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 13:07:22,771 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-10-15 13:07:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:22,772 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 13:07:22,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:07:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 13:07:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 13:07:22,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:22,774 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:22,774 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:22,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1488762743, now seen corresponding path program 7 times [2018-10-15 13:07:22,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:23,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:23,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:07:23,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:07:23,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:07:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:07:23,623 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2018-10-15 13:07:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:24,464 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:07:24,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:07:24,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-10-15 13:07:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:24,466 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:07:24,466 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:07:24,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:07:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:07:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-15 13:07:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:07:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 13:07:24,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-10-15 13:07:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:24,473 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 13:07:24,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:07:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 13:07:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:07:24,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:24,475 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:24,475 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:24,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:24,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1024434952, now seen corresponding path program 8 times [2018-10-15 13:07:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:24,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:24,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:07:24,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:07:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:07:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:07:24,917 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 19 states. [2018-10-15 13:07:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:25,741 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 13:07:25,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:07:25,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-10-15 13:07:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:25,744 INFO L225 Difference]: With dead ends: 59 [2018-10-15 13:07:25,744 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 13:07:25,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:07:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 13:07:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 13:07:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 13:07:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 13:07:25,750 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-10-15 13:07:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:25,751 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 13:07:25,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:07:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 13:07:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:07:25,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:25,752 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:25,752 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:25,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash 910576151, now seen corresponding path program 9 times [2018-10-15 13:07:25,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:26,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:26,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:07:26,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:07:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:07:26,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:07:26,164 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 21 states. [2018-10-15 13:07:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:27,269 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:07:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:07:27,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-15 13:07:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:27,271 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:07:27,272 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 13:07:27,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:07:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 13:07:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-15 13:07:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:07:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 13:07:27,277 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-10-15 13:07:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:27,278 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 13:07:27,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:07:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 13:07:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:07:27,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:27,279 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:27,279 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:27,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1581730712, now seen corresponding path program 10 times [2018-10-15 13:07:27,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:27,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:07:27,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:07:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:07:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:07:27,616 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 23 states. [2018-10-15 13:07:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:29,467 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 13:07:29,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:07:29,474 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-10-15 13:07:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:29,475 INFO L225 Difference]: With dead ends: 69 [2018-10-15 13:07:29,475 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 13:07:29,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:07:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 13:07:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-10-15 13:07:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 13:07:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 13:07:29,481 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-10-15 13:07:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:29,482 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 13:07:29,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:07:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 13:07:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 13:07:29,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:29,484 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:29,484 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:29,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -110029641, now seen corresponding path program 11 times [2018-10-15 13:07:29,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:30,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:07:30,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:07:30,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:07:30,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:07:30,228 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 25 states. [2018-10-15 13:07:30,969 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:07:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:32,172 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 13:07:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:07:32,173 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-10-15 13:07:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:32,174 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:07:32,174 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:07:32,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:07:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:07:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-15 13:07:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:07:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 13:07:32,182 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-10-15 13:07:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:32,182 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 13:07:32,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:07:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 13:07:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:07:32,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:32,184 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:32,184 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:32,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash 214142408, now seen corresponding path program 12 times [2018-10-15 13:07:32,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:32,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:07:32,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:07:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:07:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:07:32,779 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 27 states. [2018-10-15 13:07:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:34,500 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 13:07:34,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:07:34,506 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-10-15 13:07:34,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:34,507 INFO L225 Difference]: With dead ends: 79 [2018-10-15 13:07:34,507 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 13:07:34,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:07:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 13:07:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-15 13:07:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 13:07:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 13:07:34,513 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-10-15 13:07:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:34,513 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 13:07:34,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:07:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 13:07:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 13:07:34,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:34,515 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:34,515 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:34,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash -736684201, now seen corresponding path program 13 times [2018-10-15 13:07:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:07:35,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:07:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:07:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:07:35,541 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 29 states. [2018-10-15 13:07:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:37,298 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 13:07:37,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:07:37,299 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-10-15 13:07:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:37,300 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:07:37,300 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:07:37,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:07:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:07:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-15 13:07:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 13:07:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 13:07:37,307 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-10-15 13:07:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:37,307 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 13:07:37,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:07:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 13:07:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 13:07:37,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:37,309 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:37,309 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:37,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1687564072, now seen corresponding path program 14 times [2018-10-15 13:07:37,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:38,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:38,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:07:38,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:07:38,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:07:38,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:07:38,191 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 31 states. [2018-10-15 13:07:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:40,341 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 13:07:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:07:40,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2018-10-15 13:07:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:40,343 INFO L225 Difference]: With dead ends: 89 [2018-10-15 13:07:40,343 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 13:07:40,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:07:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 13:07:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-15 13:07:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 13:07:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 13:07:40,349 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-10-15 13:07:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:40,350 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 13:07:40,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:07:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 13:07:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:07:40,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:40,351 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:40,351 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:40,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:40,352 INFO L82 PathProgramCache]: Analyzing trace with hash -275623433, now seen corresponding path program 15 times [2018-10-15 13:07:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:41,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:41,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:07:41,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:07:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:07:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:07:41,295 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 33 states. [2018-10-15 13:07:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:43,713 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 13:07:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:07:43,720 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2018-10-15 13:07:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:43,721 INFO L225 Difference]: With dead ends: 94 [2018-10-15 13:07:43,721 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 13:07:43,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:07:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 13:07:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 13:07:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:07:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 13:07:43,731 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-10-15 13:07:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:43,732 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 13:07:43,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:07:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 13:07:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:07:43,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:43,733 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:43,733 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:43,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1209440392, now seen corresponding path program 16 times [2018-10-15 13:07:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:44,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:44,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:07:44,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:07:44,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:07:44,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:07:44,912 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 35 states. [2018-10-15 13:07:47,034 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:07:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:47,997 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 13:07:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:07:47,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-10-15 13:07:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:48,000 INFO L225 Difference]: With dead ends: 99 [2018-10-15 13:07:48,000 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 13:07:48,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:07:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 13:07:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-15 13:07:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 13:07:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-15 13:07:48,005 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-10-15 13:07:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:48,006 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-15 13:07:48,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:07:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-15 13:07:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 13:07:48,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:48,007 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:48,007 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:48,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash 213697687, now seen corresponding path program 17 times [2018-10-15 13:07:48,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:48,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:48,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:07:48,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:07:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:07:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:07:48,849 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 37 states. [2018-10-15 13:07:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:51,757 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 13:07:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:07:51,758 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 95 [2018-10-15 13:07:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:51,759 INFO L225 Difference]: With dead ends: 104 [2018-10-15 13:07:51,759 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:07:51,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:07:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:07:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-15 13:07:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:07:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:07:51,764 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-10-15 13:07:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:51,765 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:07:51,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:07:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:07:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:07:51,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:51,766 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:51,766 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:51,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1856686568, now seen corresponding path program 18 times [2018-10-15 13:07:51,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:52,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:52,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:07:52,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:07:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:07:52,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:07:52,644 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 39 states. [2018-10-15 13:07:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:56,210 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 13:07:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:07:56,210 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-10-15 13:07:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:56,212 INFO L225 Difference]: With dead ends: 109 [2018-10-15 13:07:56,212 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 13:07:56,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:07:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 13:07:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-15 13:07:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 13:07:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 13:07:56,218 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-10-15 13:07:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:56,219 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 13:07:56,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:07:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 13:07:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 13:07:56,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:56,220 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:56,220 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:56,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash 602959671, now seen corresponding path program 19 times [2018-10-15 13:07:56,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:57,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:07:57,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:07:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:07:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:07:57,931 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 41 states. [2018-10-15 13:08:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:01,452 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 13:08:01,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:08:01,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 105 [2018-10-15 13:08:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:01,454 INFO L225 Difference]: With dead ends: 114 [2018-10-15 13:08:01,454 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 13:08:01,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:08:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 13:08:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-15 13:08:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 13:08:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 13:08:01,460 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-10-15 13:08:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:01,460 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 13:08:01,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:08:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 13:08:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 13:08:01,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:01,461 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:01,461 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:01,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 137937736, now seen corresponding path program 20 times [2018-10-15 13:08:01,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:02,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:02,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:08:02,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:08:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:08:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:08:02,562 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 43 states. [2018-10-15 13:08:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:06,617 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 13:08:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:08:06,618 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 110 [2018-10-15 13:08:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:06,619 INFO L225 Difference]: With dead ends: 119 [2018-10-15 13:08:06,620 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 13:08:06,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:08:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 13:08:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-15 13:08:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 13:08:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-15 13:08:06,626 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-10-15 13:08:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:06,626 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-15 13:08:06,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:08:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-15 13:08:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:08:06,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:06,627 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:06,627 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:06,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash 84365783, now seen corresponding path program 21 times [2018-10-15 13:08:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:08,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:08:08,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:08:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:08:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:08:08,045 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 45 states. [2018-10-15 13:08:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:12,473 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 13:08:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:08:12,476 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2018-10-15 13:08:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:12,477 INFO L225 Difference]: With dead ends: 124 [2018-10-15 13:08:12,478 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:08:12,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:08:12,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:08:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-15 13:08:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 13:08:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 13:08:12,481 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-10-15 13:08:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:12,482 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 13:08:12,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:08:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 13:08:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 13:08:12,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:12,483 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:12,483 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:12,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:12,483 INFO L82 PathProgramCache]: Analyzing trace with hash 489063592, now seen corresponding path program 22 times [2018-10-15 13:08:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:13,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:13,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:08:13,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:08:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:08:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:08:13,636 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 47 states. [2018-10-15 13:08:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:18,150 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 13:08:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:08:18,151 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 120 [2018-10-15 13:08:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:18,152 INFO L225 Difference]: With dead ends: 129 [2018-10-15 13:08:18,152 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 13:08:18,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:08:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 13:08:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-10-15 13:08:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 13:08:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-15 13:08:18,157 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-10-15 13:08:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:18,157 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-15 13:08:18,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:08:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-15 13:08:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 13:08:18,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:18,159 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:18,159 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:18,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -145003401, now seen corresponding path program 23 times [2018-10-15 13:08:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:20,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:08:20,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:08:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:08:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:08:20,014 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 49 states. [2018-10-15 13:08:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:24,917 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 13:08:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:08:24,917 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 125 [2018-10-15 13:08:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:24,918 INFO L225 Difference]: With dead ends: 134 [2018-10-15 13:08:24,919 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:08:24,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:08:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:08:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-15 13:08:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 13:08:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 13:08:24,923 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-10-15 13:08:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:24,924 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 13:08:24,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:08:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 13:08:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:08:24,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:24,925 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:24,925 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:24,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash -296088056, now seen corresponding path program 24 times [2018-10-15 13:08:24,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:26,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:26,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:08:26,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:08:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:08:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:08:26,357 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 51 states. [2018-10-15 13:08:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:31,721 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 13:08:31,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:08:31,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 130 [2018-10-15 13:08:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:31,724 INFO L225 Difference]: With dead ends: 139 [2018-10-15 13:08:31,725 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 13:08:31,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:08:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 13:08:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-15 13:08:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 13:08:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 13:08:31,729 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-10-15 13:08:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:31,729 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 13:08:31,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:08:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 13:08:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 13:08:31,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:31,730 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:31,731 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:31,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1506197271, now seen corresponding path program 25 times [2018-10-15 13:08:31,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:33,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:33,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:08:33,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:08:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:08:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:08:33,499 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 53 states. [2018-10-15 13:08:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:39,159 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:08:39,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:08:39,160 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 135 [2018-10-15 13:08:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:39,161 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:08:39,161 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:08:39,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:08:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:08:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-10-15 13:08:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 13:08:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 13:08:39,165 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-10-15 13:08:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:39,166 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 13:08:39,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:08:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 13:08:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 13:08:39,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:39,167 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:39,167 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:39,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1429823336, now seen corresponding path program 26 times [2018-10-15 13:08:39,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:41,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:41,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:08:41,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:08:41,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:08:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:08:41,031 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 55 states. [2018-10-15 13:08:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:47,217 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 13:08:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:08:47,218 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 140 [2018-10-15 13:08:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:47,219 INFO L225 Difference]: With dead ends: 149 [2018-10-15 13:08:47,220 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 13:08:47,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:08:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 13:08:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 13:08:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 13:08:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 13:08:47,224 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-10-15 13:08:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:47,225 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 13:08:47,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:08:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 13:08:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:08:47,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:47,226 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:47,226 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:47,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1117997495, now seen corresponding path program 27 times [2018-10-15 13:08:47,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:48,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:08:48,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:08:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:08:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:08:48,886 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 57 states. [2018-10-15 13:08:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:55,579 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 13:08:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:08:55,579 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 145 [2018-10-15 13:08:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:55,581 INFO L225 Difference]: With dead ends: 154 [2018-10-15 13:08:55,581 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 13:08:55,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:08:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 13:08:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-15 13:08:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:08:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 13:08:55,585 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-10-15 13:08:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:55,585 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 13:08:55,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:08:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 13:08:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:08:55,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:55,586 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:55,586 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:55,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 598374600, now seen corresponding path program 28 times [2018-10-15 13:08:55,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:57,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:57,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:08:57,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:08:57,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:08:57,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:08:57,470 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 59 states. [2018-10-15 13:09:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:04,606 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 13:09:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:09:04,607 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 150 [2018-10-15 13:09:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:04,608 INFO L225 Difference]: With dead ends: 159 [2018-10-15 13:09:04,608 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 13:09:04,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:09:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 13:09:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-15 13:09:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 13:09:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 13:09:04,613 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-10-15 13:09:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:04,613 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 13:09:04,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:09:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 13:09:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 13:09:04,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:04,614 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:04,614 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:04,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash 533400663, now seen corresponding path program 29 times [2018-10-15 13:09:04,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:06,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:06,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:09:06,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:09:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:09:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:09:06,934 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 61 states. [2018-10-15 13:09:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:14,411 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 13:09:14,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:09:14,412 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 155 [2018-10-15 13:09:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:14,413 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:09:14,413 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:09:14,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:09:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:09:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-10-15 13:09:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:09:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 13:09:14,418 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-10-15 13:09:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:14,418 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 13:09:14,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:09:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 13:09:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:09:14,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:14,419 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:14,420 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:14,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2079106520, now seen corresponding path program 30 times [2018-10-15 13:09:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:17,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:09:17,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:09:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:09:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:09:17,139 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 63 states. [2018-10-15 13:09:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:25,236 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 13:09:25,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 13:09:25,242 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 160 [2018-10-15 13:09:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:25,243 INFO L225 Difference]: With dead ends: 169 [2018-10-15 13:09:25,243 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 13:09:25,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:09:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 13:09:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-10-15 13:09:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-15 13:09:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-15 13:09:25,247 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-10-15 13:09:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:25,248 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-15 13:09:25,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:09:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-15 13:09:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-15 13:09:25,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:25,249 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:25,249 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:25,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1452803831, now seen corresponding path program 31 times [2018-10-15 13:09:25,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:28,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:28,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:09:28,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:09:28,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:09:28,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:09:28,838 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 65 states. [2018-10-15 13:09:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:37,543 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 13:09:37,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 13:09:37,544 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 165 [2018-10-15 13:09:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:37,545 INFO L225 Difference]: With dead ends: 174 [2018-10-15 13:09:37,545 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 13:09:37,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:09:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 13:09:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-10-15 13:09:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 13:09:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 13:09:37,551 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-10-15 13:09:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:37,551 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 13:09:37,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:09:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 13:09:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 13:09:37,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:37,553 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:37,553 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:37,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1499071368, now seen corresponding path program 32 times [2018-10-15 13:09:37,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:39,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:39,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:09:39,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:09:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:09:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:09:39,906 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 67 states. [2018-10-15 13:09:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:49,266 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 13:09:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 13:09:49,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 170 [2018-10-15 13:09:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:49,268 INFO L225 Difference]: With dead ends: 179 [2018-10-15 13:09:49,268 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 13:09:49,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:09:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 13:09:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-15 13:09:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:09:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-15 13:09:49,273 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-10-15 13:09:49,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:49,273 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-15 13:09:49,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:09:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-15 13:09:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:09:49,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:49,275 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:49,275 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:49,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:49,275 INFO L82 PathProgramCache]: Analyzing trace with hash -471582313, now seen corresponding path program 33 times [2018-10-15 13:09:49,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:53,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:53,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:09:53,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:09:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:09:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:09:53,272 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 69 states. [2018-10-15 13:10:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:02,970 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 13:10:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 13:10:02,970 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2018-10-15 13:10:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:02,972 INFO L225 Difference]: With dead ends: 184 [2018-10-15 13:10:02,972 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:10:02,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:10:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:10:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-15 13:10:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 13:10:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 13:10:02,977 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-10-15 13:10:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:02,978 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 13:10:02,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:10:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 13:10:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 13:10:02,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:02,979 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:02,979 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:02,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1629195032, now seen corresponding path program 34 times [2018-10-15 13:10:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:05,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:05,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:10:05,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:10:05,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:10:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:10:05,825 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 71 states. [2018-10-15 13:10:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:17,406 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 13:10:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 13:10:17,406 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 180 [2018-10-15 13:10:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:17,408 INFO L225 Difference]: With dead ends: 189 [2018-10-15 13:10:17,408 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 13:10:17,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:10:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 13:10:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-15 13:10:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 13:10:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-15 13:10:17,413 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-10-15 13:10:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:17,413 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-15 13:10:17,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:10:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-15 13:10:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 13:10:17,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:17,415 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:17,415 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:17,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash -66477001, now seen corresponding path program 35 times [2018-10-15 13:10:17,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:20,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:20,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:10:20,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:10:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:10:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:10:20,393 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 73 states. [2018-10-15 13:10:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:31,315 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 13:10:31,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:10:31,315 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 185 [2018-10-15 13:10:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:31,316 INFO L225 Difference]: With dead ends: 194 [2018-10-15 13:10:31,317 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 13:10:31,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:10:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 13:10:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-15 13:10:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 13:10:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 13:10:31,321 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-10-15 13:10:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:31,321 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 13:10:31,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:10:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 13:10:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:10:31,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:31,322 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:31,323 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:31,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash -929518008, now seen corresponding path program 36 times [2018-10-15 13:10:31,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:10:34,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:10:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:10:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:10:34,442 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 75 states. [2018-10-15 13:10:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:46,057 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-15 13:10:46,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 13:10:46,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 190 [2018-10-15 13:10:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:46,059 INFO L225 Difference]: With dead ends: 199 [2018-10-15 13:10:46,059 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 13:10:46,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:10:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 13:10:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-10-15 13:10:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 13:10:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-15 13:10:46,064 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-10-15 13:10:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:46,064 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-15 13:10:46,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:10:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-15 13:10:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 13:10:46,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:46,066 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:46,066 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:46,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1428011305, now seen corresponding path program 37 times [2018-10-15 13:10:46,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:49,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:49,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:10:49,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:10:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:10:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:10:49,298 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 77 states. [2018-10-15 13:11:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:01,429 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 13:11:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 13:11:01,429 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 195 [2018-10-15 13:11:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:01,430 INFO L225 Difference]: With dead ends: 204 [2018-10-15 13:11:01,431 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 13:11:01,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:11:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 13:11:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-10-15 13:11:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 13:11:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 13:11:01,435 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-10-15 13:11:01,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:01,435 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 13:11:01,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:11:01,435 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 13:11:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 13:11:01,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:01,436 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:01,436 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:01,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 584888232, now seen corresponding path program 38 times [2018-10-15 13:11:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:04,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:04,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:11:04,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:11:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:11:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:11:04,968 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 79 states. [2018-10-15 13:11:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:17,645 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 13:11:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 13:11:17,645 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 200 [2018-10-15 13:11:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:17,647 INFO L225 Difference]: With dead ends: 209 [2018-10-15 13:11:17,647 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 13:11:17,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:11:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 13:11:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-15 13:11:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:11:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 13:11:17,652 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-10-15 13:11:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:17,652 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 13:11:17,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:11:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 13:11:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 13:11:17,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:17,653 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:17,653 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:17,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:17,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1942495607, now seen corresponding path program 39 times [2018-10-15 13:11:17,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:20,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:20,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:11:20,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:11:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:11:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:11:20,996 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 81 states. [2018-10-15 13:11:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:34,166 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 13:11:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 13:11:34,166 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 205 [2018-10-15 13:11:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:34,167 INFO L225 Difference]: With dead ends: 214 [2018-10-15 13:11:34,167 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 13:11:34,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 13:11:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 13:11:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-15 13:11:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 13:11:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 13:11:34,171 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-10-15 13:11:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:34,171 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 13:11:34,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:11:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 13:11:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 13:11:34,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:34,172 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:34,173 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:34,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash 848722184, now seen corresponding path program 40 times [2018-10-15 13:11:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:38,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:38,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:11:38,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:11:38,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:11:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:11:38,174 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 83 states. [2018-10-15 13:11:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:52,399 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-15 13:11:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 13:11:52,400 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 210 [2018-10-15 13:11:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:52,401 INFO L225 Difference]: With dead ends: 219 [2018-10-15 13:11:52,401 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 13:11:52,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 13:11:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 13:11:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-10-15 13:11:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 13:11:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 13:11:52,406 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-10-15 13:11:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:52,406 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 13:11:52,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:11:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 13:11:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 13:11:52,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:52,407 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:52,407 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:52,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash -241880041, now seen corresponding path program 41 times [2018-10-15 13:11:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:56,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:56,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:11:56,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:11:56,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:11:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:11:56,174 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 85 states. [2018-10-15 13:12:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:11,166 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 13:12:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 13:12:11,167 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 215 [2018-10-15 13:12:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:11,168 INFO L225 Difference]: With dead ends: 224 [2018-10-15 13:12:11,168 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 13:12:11,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:12:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 13:12:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-10-15 13:12:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-15 13:12:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-15 13:12:11,171 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-10-15 13:12:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:11,172 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-15 13:12:11,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:12:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-15 13:12:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-15 13:12:11,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:11,173 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:11,173 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:11,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash 355207784, now seen corresponding path program 42 times [2018-10-15 13:12:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:15,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:15,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:12:15,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:12:15,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:12:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:12:15,381 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 87 states. [2018-10-15 13:12:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:31,687 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 13:12:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:12:31,688 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 220 [2018-10-15 13:12:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:31,690 INFO L225 Difference]: With dead ends: 229 [2018-10-15 13:12:31,690 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 13:12:31,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:12:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 13:12:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-10-15 13:12:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-15 13:12:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-15 13:12:31,694 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-10-15 13:12:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:31,694 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-15 13:12:31,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:12:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-15 13:12:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-15 13:12:31,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:31,695 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:31,696 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:31,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1990426295, now seen corresponding path program 43 times [2018-10-15 13:12:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:35,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:35,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:12:35,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:12:35,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:12:35,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:12:35,568 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 89 states. [2018-10-15 13:12:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:52,119 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 13:12:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:12:52,119 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 225 [2018-10-15 13:12:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:52,121 INFO L225 Difference]: With dead ends: 234 [2018-10-15 13:12:52,121 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 13:12:52,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 13:12:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 13:12:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-10-15 13:12:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 13:12:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 13:12:52,126 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-10-15 13:12:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:52,126 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 13:12:52,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:12:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 13:12:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 13:12:52,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:52,128 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:52,128 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:52,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash -528260152, now seen corresponding path program 44 times [2018-10-15 13:12:52,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:56,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:12:56,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:12:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:12:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:12:56,050 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 91 states. [2018-10-15 13:13:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:14,906 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 13:13:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 13:13:14,906 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 230 [2018-10-15 13:13:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:14,908 INFO L225 Difference]: With dead ends: 239 [2018-10-15 13:13:14,908 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 13:13:14,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 13:13:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 13:13:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 13:13:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 13:13:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 13:13:14,913 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-10-15 13:13:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:14,913 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 13:13:14,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:13:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 13:13:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 13:13:14,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:14,915 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:14,915 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:14,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1395850921, now seen corresponding path program 45 times [2018-10-15 13:13:14,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:19,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:19,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:13:19,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:13:19,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:13:19,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:13:19,347 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 93 states. [2018-10-15 13:13:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:36,951 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 13:13:36,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 13:13:36,952 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 235 [2018-10-15 13:13:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:36,953 INFO L225 Difference]: With dead ends: 244 [2018-10-15 13:13:36,953 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 13:13:36,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 13:13:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 13:13:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-15 13:13:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 13:13:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 13:13:36,957 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-10-15 13:13:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:36,958 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 13:13:36,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:13:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 13:13:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 13:13:36,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:36,959 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:36,960 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:36,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 50496808, now seen corresponding path program 46 times [2018-10-15 13:13:36,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:41,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:13:41,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:13:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:13:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:13:41,500 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 95 states. [2018-10-15 13:13:55,765 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:14:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:00,476 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 13:14:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 13:14:00,477 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 240 [2018-10-15 13:14:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:00,478 INFO L225 Difference]: With dead ends: 249 [2018-10-15 13:14:00,478 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 13:14:00,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:14:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 13:14:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-10-15 13:14:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-15 13:14:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-15 13:14:00,483 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-10-15 13:14:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:00,483 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-15 13:14:00,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:14:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-15 13:14:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-15 13:14:00,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:00,485 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:00,485 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:00,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 896252919, now seen corresponding path program 47 times [2018-10-15 13:14:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:05,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:05,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:14:05,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:14:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:14:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:14:05,314 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 97 states. [2018-10-15 13:14:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:24,571 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 13:14:24,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 13:14:24,572 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 245 [2018-10-15 13:14:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:24,573 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:14:24,573 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 13:14:24,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:14:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 13:14:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-15 13:14:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 13:14:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 13:14:24,578 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-10-15 13:14:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:24,578 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 13:14:24,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 13:14:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 13:14:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 13:14:24,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:24,580 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:24,580 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:24,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1550881144, now seen corresponding path program 48 times [2018-10-15 13:14:24,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:29,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:29,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:14:29,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:14:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:14:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:14:29,394 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 99 states. [2018-10-15 13:14:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,302 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-15 13:14:49,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 13:14:49,302 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 250 [2018-10-15 13:14:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,303 INFO L225 Difference]: With dead ends: 259 [2018-10-15 13:14:49,304 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 13:14:49,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 13:14:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 13:14:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-10-15 13:14:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-15 13:14:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-15 13:14:49,310 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-10-15 13:14:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,310 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-15 13:14:49,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:14:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-15 13:14:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 13:14:49,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,312 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,312 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1230614167, now seen corresponding path program 49 times [2018-10-15 13:14:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:54,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:54,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 13:14:54,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 13:14:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 13:14:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:14:54,180 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 101 states. [2018-10-15 13:15:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:15,235 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 13:15:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 13:15:15,235 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 255 [2018-10-15 13:15:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:15,237 INFO L225 Difference]: With dead ends: 264 [2018-10-15 13:15:15,237 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 13:15:15,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 13:15:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 13:15:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-15 13:15:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 13:15:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 13:15:15,243 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-10-15 13:15:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:15,243 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 13:15:15,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 13:15:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 13:15:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 13:15:15,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:15,245 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:15,245 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:15,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash 26222568, now seen corresponding path program 50 times [2018-10-15 13:15:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:20,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:20,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:15:20,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:15:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:15:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:15:20,436 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 103 states. [2018-10-15 13:15:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:42,190 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 13:15:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 13:15:42,190 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 260 [2018-10-15 13:15:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:42,192 INFO L225 Difference]: With dead ends: 269 [2018-10-15 13:15:42,193 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 13:15:42,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 13:15:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 13:15:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-15 13:15:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-15 13:15:42,197 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-10-15 13:15:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:42,197 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-15 13:15:42,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:15:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-15 13:15:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 13:15:42,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:42,199 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:42,199 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:42,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1492179255, now seen corresponding path program 51 times [2018-10-15 13:15:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:47,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:47,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:15:47,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:15:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:15:47,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:15:47,570 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 105 states.