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/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:31:55,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:31:55,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:31:55,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:31:55,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:31:55,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:31:55,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:31:55,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:31:55,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:31:55,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:31:55,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:31:55,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:31:55,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:31:55,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:31:55,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:31:55,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:31:55,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:31:55,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:31:55,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:31:55,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:31:55,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:31:55,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:31:55,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:31:55,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:31:55,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:31:55,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:31:55,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:31:55,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:31:55,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:31:55,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:31:55,668 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:31:55,669 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:31:55,669 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:31:55,669 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:31:55,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:31:55,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:31:55,674 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 15:31:55,691 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:31:55,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:31:55,692 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:31:55,693 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:31:55,694 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:31:55,694 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:31:55,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:31:55,695 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:31:55,695 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:31:55,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:31:55,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:31:55,696 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:31:55,696 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:31:55,698 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:31:55,698 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:31:55,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:31:55,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:31:55,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:31:55,789 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:31:55,790 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:31:55,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl [2018-10-15 15:31:55,791 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl' [2018-10-15 15:31:55,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:31:55,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:31:55,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:31:55,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:31:55,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:31:55,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/1) ... [2018-10-15 15:31:55,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:31:55,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:31:55,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:31:55,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:31:55,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (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 15:31:55,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:31:55,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:31:56,532 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:31:56,533 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:56 BoogieIcfgContainer [2018-10-15 15:31:56,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:31:56,534 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:31:56,534 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:31:56,535 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:31:56,539 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:56" (1/1) ... [2018-10-15 15:31:56,546 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:31:56,561 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:31:56 BasicIcfg [2018-10-15 15:31:56,561 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:31:56,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:31:56,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:31:56,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:31:56,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:31:55" (1/3) ... [2018-10-15 15:31:56,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56666488 and model type fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:56, skipping insertion in model container [2018-10-15 15:31:56,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:56" (2/3) ... [2018-10-15 15:31:56,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56666488 and model type fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:31:56, skipping insertion in model container [2018-10-15 15:31:56,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:31:56" (3/3) ... [2018-10-15 15:31:56,570 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 15:31:56,580 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:31:56,589 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:31:56,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:31:56,633 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:31:56,633 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:31:56,634 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:31:56,634 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:31:56,634 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:31:56,634 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:31:56,634 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:31:56,635 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:31:56,635 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:31:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-10-15 15:31:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 15:31:56,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:56,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:56,661 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:56,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1686042356, now seen corresponding path program 1 times [2018-10-15 15:31:56,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:56,887 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 15:31:56,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:31:56,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 15:31:56,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:31:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:31:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:31:56,914 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-10-15 15:31:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:57,129 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-15 15:31:57,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 15:31:57,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-15 15:31:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:57,143 INFO L225 Difference]: With dead ends: 55 [2018-10-15 15:31:57,144 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 15:31:57,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:31:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 15:31:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-10-15 15:31:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 15:31:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-10-15 15:31:57,200 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 32 [2018-10-15 15:31:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:57,201 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-10-15 15:31:57,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:31:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-10-15 15:31:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 15:31:57,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:57,205 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:57,206 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1127562084, now seen corresponding path program 1 times [2018-10-15 15:31:57,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:31:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-15 15:31:57,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 15:31:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 15:31:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 15:31:57,390 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 6 states. [2018-10-15 15:31:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:57,834 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-10-15 15:31:57,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:31:57,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-10-15 15:31:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:57,837 INFO L225 Difference]: With dead ends: 66 [2018-10-15 15:31:57,837 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 15:31:57,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 15:31:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-10-15 15:31:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 15:31:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-10-15 15:31:57,845 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 42 [2018-10-15 15:31:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:57,846 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-10-15 15:31:57,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 15:31:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-10-15 15:31:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 15:31:57,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:57,848 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:57,849 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:57,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1798888854, now seen corresponding path program 1 times [2018-10-15 15:31:57,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:58,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:58,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:31:58,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:31:58,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:31:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:31:58,143 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 8 states. [2018-10-15 15:31:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:58,610 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-10-15 15:31:58,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 15:31:58,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-15 15:31:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:58,612 INFO L225 Difference]: With dead ends: 71 [2018-10-15 15:31:58,613 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 15:31:58,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:31:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 15:31:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2018-10-15 15:31:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 15:31:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 15:31:58,621 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 49 [2018-10-15 15:31:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:58,622 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 15:31:58,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:31:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 15:31:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 15:31:58,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:58,625 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:58,625 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:58,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 563497150, now seen corresponding path program 2 times [2018-10-15 15:31:58,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:58,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:58,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 15:31:58,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:31:58,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:31:58,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:31:58,970 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 8 states. [2018-10-15 15:31:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:59,250 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-10-15 15:31:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 15:31:59,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-10-15 15:31:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:59,254 INFO L225 Difference]: With dead ends: 83 [2018-10-15 15:31:59,254 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 15:31:59,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-15 15:31:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 15:31:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-15 15:31:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 15:31:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-15 15:31:59,261 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 59 [2018-10-15 15:31:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:59,262 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-15 15:31:59,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:31:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-15 15:31:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 15:31:59,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:59,265 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:59,265 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:59,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 9569028, now seen corresponding path program 3 times [2018-10-15 15:31:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:59,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:59,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:31:59,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:31:59,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:31:59,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:31:59,450 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 9 states. [2018-10-15 15:31:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:59,756 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-10-15 15:31:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 15:31:59,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-10-15 15:31:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:59,760 INFO L225 Difference]: With dead ends: 88 [2018-10-15 15:31:59,760 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 15:31:59,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:31:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 15:31:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2018-10-15 15:31:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 15:31:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-10-15 15:31:59,769 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2018-10-15 15:31:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:59,770 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-10-15 15:31:59,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:31:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-10-15 15:31:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 15:31:59,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:59,773 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:59,773 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:59,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1547043668, now seen corresponding path program 4 times [2018-10-15 15:31:59,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:59,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:59,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:31:59,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:31:59,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:31:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:31:59,999 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 10 states. [2018-10-15 15:32:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:00,758 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2018-10-15 15:32:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 15:32:00,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-10-15 15:32:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:00,764 INFO L225 Difference]: With dead ends: 110 [2018-10-15 15:32:00,764 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 15:32:00,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-15 15:32:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 15:32:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-10-15 15:32:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 15:32:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-15 15:32:00,772 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 76 [2018-10-15 15:32:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:00,773 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-15 15:32:00,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:32:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-15 15:32:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-15 15:32:00,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:00,779 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:00,780 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:00,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash -128100570, now seen corresponding path program 5 times [2018-10-15 15:32:00,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:01,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:01,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:01,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:01,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:01,088 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 11 states. [2018-10-15 15:32:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:01,374 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-10-15 15:32:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:32:01,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-10-15 15:32:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:01,376 INFO L225 Difference]: With dead ends: 127 [2018-10-15 15:32:01,377 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 15:32:01,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 15:32:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 15:32:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 15:32:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-15 15:32:01,384 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 83 [2018-10-15 15:32:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:01,385 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-15 15:32:01,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-15 15:32:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 15:32:01,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:01,387 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:01,388 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:01,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:01,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1820319892, now seen corresponding path program 6 times [2018-10-15 15:32:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 54 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:32:01,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:32:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:32:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:32:01,615 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 11 states. [2018-10-15 15:32:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:01,869 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-10-15 15:32:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 15:32:01,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2018-10-15 15:32:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:01,871 INFO L225 Difference]: With dead ends: 122 [2018-10-15 15:32:01,871 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 15:32:01,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:32:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 15:32:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2018-10-15 15:32:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 15:32:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-10-15 15:32:01,880 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 90 [2018-10-15 15:32:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:01,881 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-10-15 15:32:01,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:32:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-10-15 15:32:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 15:32:01,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:01,883 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:01,883 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:01,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1088430916, now seen corresponding path program 7 times [2018-10-15 15:32:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 130 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 15:32:02,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 15:32:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 15:32:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 15:32:02,084 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 14 states. [2018-10-15 15:32:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:02,586 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2018-10-15 15:32:02,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 15:32:02,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2018-10-15 15:32:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:02,589 INFO L225 Difference]: With dead ends: 164 [2018-10-15 15:32:02,589 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 15:32:02,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-10-15 15:32:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 15:32:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-10-15 15:32:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-15 15:32:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-10-15 15:32:02,596 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 110 [2018-10-15 15:32:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:02,597 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-10-15 15:32:02,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 15:32:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-10-15 15:32:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-15 15:32:02,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:02,599 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:02,600 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:02,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1705515190, now seen corresponding path program 8 times [2018-10-15 15:32:02,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 130 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:02,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:32:02,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:32:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:32:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:02,852 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 15 states. [2018-10-15 15:32:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:03,422 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-10-15 15:32:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 15:32:03,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-10-15 15:32:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:03,423 INFO L225 Difference]: With dead ends: 181 [2018-10-15 15:32:03,423 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 15:32:03,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:32:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 15:32:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-10-15 15:32:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 15:32:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-10-15 15:32:03,429 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 117 [2018-10-15 15:32:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:03,429 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-10-15 15:32:03,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:32:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-10-15 15:32:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 15:32:03,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:03,431 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:03,432 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:03,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:03,432 INFO L82 PathProgramCache]: Analyzing trace with hash 761089916, now seen corresponding path program 9 times [2018-10-15 15:32:03,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 123 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:03,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:03,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:32:03,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:32:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:32:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:32:03,687 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 13 states. [2018-10-15 15:32:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:04,116 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-15 15:32:04,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 15:32:04,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2018-10-15 15:32:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:04,119 INFO L225 Difference]: With dead ends: 156 [2018-10-15 15:32:04,119 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 15:32:04,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2018-10-15 15:32:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 15:32:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 145. [2018-10-15 15:32:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 15:32:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-15 15:32:04,125 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 124 [2018-10-15 15:32:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:04,125 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-15 15:32:04,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:32:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-15 15:32:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 15:32:04,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:04,128 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:04,128 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:04,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1075078348, now seen corresponding path program 10 times [2018-10-15 15:32:04,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 252 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:04,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:04,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 15:32:04,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 15:32:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 15:32:04,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:32:04,551 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 18 states. [2018-10-15 15:32:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:05,030 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2018-10-15 15:32:05,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 15:32:05,031 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 144 [2018-10-15 15:32:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:05,033 INFO L225 Difference]: With dead ends: 218 [2018-10-15 15:32:05,033 INFO L226 Difference]: Without dead ends: 155 [2018-10-15 15:32:05,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2018-10-15 15:32:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-15 15:32:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-15 15:32:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-15 15:32:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-10-15 15:32:05,038 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 144 [2018-10-15 15:32:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:05,039 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-10-15 15:32:05,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 15:32:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-10-15 15:32:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 15:32:05,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:05,041 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:05,041 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:05,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1468456378, now seen corresponding path program 11 times [2018-10-15 15:32:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 252 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:05,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:05,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:32:05,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:32:05,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:32:05,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:05,349 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 19 states. [2018-10-15 15:32:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:06,046 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-10-15 15:32:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 15:32:06,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 151 [2018-10-15 15:32:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:06,048 INFO L225 Difference]: With dead ends: 235 [2018-10-15 15:32:06,048 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 15:32:06,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:32:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 15:32:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-10-15 15:32:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 15:32:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-15 15:32:06,053 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 151 [2018-10-15 15:32:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:06,053 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-15 15:32:06,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:32:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-15 15:32:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 15:32:06,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:06,056 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:06,056 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:06,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2029705332, now seen corresponding path program 12 times [2018-10-15 15:32:06,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 220 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:07,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:32:07,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:32:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:32:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:32:07,112 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 15 states. [2018-10-15 15:32:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:07,651 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2018-10-15 15:32:07,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 15:32:07,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 158 [2018-10-15 15:32:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:07,653 INFO L225 Difference]: With dead ends: 190 [2018-10-15 15:32:07,654 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:32:07,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=755, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:32:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:32:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2018-10-15 15:32:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 15:32:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-15 15:32:07,659 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 158 [2018-10-15 15:32:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:07,660 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-15 15:32:07,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:32:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-15 15:32:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 15:32:07,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:07,662 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:07,662 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:07,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash 418354396, now seen corresponding path program 13 times [2018-10-15 15:32:07,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 414 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:07,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:07,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 15:32:07,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 15:32:07,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 15:32:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 15:32:07,985 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 22 states. [2018-10-15 15:32:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:08,522 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-15 15:32:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 15:32:08,530 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2018-10-15 15:32:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:08,531 INFO L225 Difference]: With dead ends: 272 [2018-10-15 15:32:08,531 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 15:32:08,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:32:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 15:32:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-15 15:32:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 15:32:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-10-15 15:32:08,536 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 178 [2018-10-15 15:32:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:08,537 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-10-15 15:32:08,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 15:32:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-10-15 15:32:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 15:32:08,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:08,538 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:08,539 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:08,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1899000790, now seen corresponding path program 14 times [2018-10-15 15:32:08,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 414 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:08,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:32:08,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:32:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:32:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:32:08,869 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 23 states. [2018-10-15 15:32:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:09,459 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-10-15 15:32:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 15:32:09,459 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 185 [2018-10-15 15:32:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:09,461 INFO L225 Difference]: With dead ends: 289 [2018-10-15 15:32:09,461 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 15:32:09,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:32:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 15:32:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-10-15 15:32:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 15:32:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-10-15 15:32:09,466 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 185 [2018-10-15 15:32:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:09,467 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-10-15 15:32:09,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:32:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-10-15 15:32:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 15:32:09,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:09,468 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:09,468 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:09,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:09,469 INFO L82 PathProgramCache]: Analyzing trace with hash 130000796, now seen corresponding path program 15 times [2018-10-15 15:32:09,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 345 proven. 414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:09,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:32:09,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:32:09,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:32:09,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:32:09,848 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 17 states. [2018-10-15 15:32:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:10,277 INFO L93 Difference]: Finished difference Result 224 states and 225 transitions. [2018-10-15 15:32:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 15:32:10,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 192 [2018-10-15 15:32:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:10,280 INFO L225 Difference]: With dead ends: 224 [2018-10-15 15:32:10,280 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 15:32:10,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=511, Invalid=1049, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 15:32:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 15:32:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 213. [2018-10-15 15:32:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 15:32:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-10-15 15:32:10,284 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 192 [2018-10-15 15:32:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:10,285 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-10-15 15:32:10,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:32:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-10-15 15:32:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 15:32:10,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:10,287 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:10,287 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:10,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1022979308, now seen corresponding path program 16 times [2018-10-15 15:32:10,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 616 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:10,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:10,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 15:32:10,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 15:32:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 15:32:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-10-15 15:32:10,938 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 26 states. [2018-10-15 15:32:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:11,653 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 15:32:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 15:32:11,654 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2018-10-15 15:32:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:11,656 INFO L225 Difference]: With dead ends: 326 [2018-10-15 15:32:11,656 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 15:32:11,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 15:32:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 15:32:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2018-10-15 15:32:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 15:32:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-10-15 15:32:11,661 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 212 [2018-10-15 15:32:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:11,662 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-10-15 15:32:11,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 15:32:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-10-15 15:32:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:32:11,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:11,663 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:11,663 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:11,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:11,663 INFO L82 PathProgramCache]: Analyzing trace with hash -349303450, now seen corresponding path program 17 times [2018-10-15 15:32:11,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 616 proven. 418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:32:12,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:32:12,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:32:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:32:12,556 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 27 states. [2018-10-15 15:32:13,681 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-15 15:32:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:14,975 INFO L93 Difference]: Finished difference Result 343 states and 344 transitions. [2018-10-15 15:32:14,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 15:32:14,975 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 219 [2018-10-15 15:32:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:14,978 INFO L225 Difference]: With dead ends: 343 [2018-10-15 15:32:14,978 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 15:32:14,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:32:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 15:32:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-15 15:32:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 15:32:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-10-15 15:32:14,983 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 219 [2018-10-15 15:32:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:14,984 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-10-15 15:32:14,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:32:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-10-15 15:32:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 15:32:14,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:14,985 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:14,986 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:14,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash -673919060, now seen corresponding path program 18 times [2018-10-15 15:32:14,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 498 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:15,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:32:15,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:32:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:32:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=203, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:32:15,390 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 19 states. [2018-10-15 15:32:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:15,932 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2018-10-15 15:32:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 15:32:15,933 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2018-10-15 15:32:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:15,936 INFO L225 Difference]: With dead ends: 258 [2018-10-15 15:32:15,936 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 15:32:15,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=679, Invalid=1391, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:32:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 15:32:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 247. [2018-10-15 15:32:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 15:32:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-10-15 15:32:15,942 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 226 [2018-10-15 15:32:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:15,942 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-10-15 15:32:15,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:32:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-10-15 15:32:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 15:32:15,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:15,944 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:15,944 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:15,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash -528880388, now seen corresponding path program 19 times [2018-10-15 15:32:15,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 858 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 15:32:17,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 15:32:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 15:32:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-10-15 15:32:17,552 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 30 states. [2018-10-15 15:32:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:18,535 INFO L93 Difference]: Finished difference Result 380 states and 381 transitions. [2018-10-15 15:32:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 15:32:18,535 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 246 [2018-10-15 15:32:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:18,538 INFO L225 Difference]: With dead ends: 380 [2018-10-15 15:32:18,538 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 15:32:18,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 15:32:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 15:32:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-10-15 15:32:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 15:32:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-10-15 15:32:18,544 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 246 [2018-10-15 15:32:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:18,544 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-10-15 15:32:18,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 15:32:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-10-15 15:32:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 15:32:18,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:18,546 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:18,547 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:18,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2094132982, now seen corresponding path program 20 times [2018-10-15 15:32:18,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 858 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:19,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:19,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:32:19,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:32:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:32:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:32:19,668 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 31 states. [2018-10-15 15:32:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:20,703 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-10-15 15:32:20,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 15:32:20,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 253 [2018-10-15 15:32:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:20,706 INFO L225 Difference]: With dead ends: 397 [2018-10-15 15:32:20,706 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 15:32:20,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:32:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 15:32:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-15 15:32:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 15:32:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-10-15 15:32:20,712 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 253 [2018-10-15 15:32:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:20,712 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-10-15 15:32:20,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:32:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-10-15 15:32:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 15:32:20,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:20,714 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:20,714 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:20,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 546086844, now seen corresponding path program 21 times [2018-10-15 15:32:20,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1537 backedges. 679 proven. 858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:21,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:21,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:32:21,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:32:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:32:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:32:21,134 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 21 states. [2018-10-15 15:32:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:21,862 INFO L93 Difference]: Finished difference Result 292 states and 293 transitions. [2018-10-15 15:32:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 15:32:21,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 260 [2018-10-15 15:32:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:21,864 INFO L225 Difference]: With dead ends: 292 [2018-10-15 15:32:21,864 INFO L226 Difference]: Without dead ends: 292 [2018-10-15 15:32:21,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=871, Invalid=1781, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 15:32:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-15 15:32:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 281. [2018-10-15 15:32:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-15 15:32:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-10-15 15:32:21,869 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 260 [2018-10-15 15:32:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:21,869 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-10-15 15:32:21,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:32:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-10-15 15:32:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-15 15:32:21,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:21,870 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:21,871 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:21,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1195830004, now seen corresponding path program 22 times [2018-10-15 15:32:21,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 1140 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:22,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:22,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 15:32:22,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 15:32:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 15:32:22,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 15:32:22,876 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 34 states. [2018-10-15 15:32:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:23,984 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 15:32:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 15:32:23,985 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 280 [2018-10-15 15:32:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:23,988 INFO L225 Difference]: With dead ends: 434 [2018-10-15 15:32:23,988 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 15:32:23,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:32:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 15:32:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2018-10-15 15:32:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-15 15:32:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2018-10-15 15:32:23,995 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 280 [2018-10-15 15:32:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:23,996 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2018-10-15 15:32:23,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 15:32:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2018-10-15 15:32:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-15 15:32:23,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:23,998 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:23,999 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:23,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2021910394, now seen corresponding path program 23 times [2018-10-15 15:32:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 1140 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:24,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:24,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:32:24,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:32:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:32:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:32:24,823 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 35 states. [2018-10-15 15:32:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:26,045 INFO L93 Difference]: Finished difference Result 451 states and 452 transitions. [2018-10-15 15:32:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 15:32:26,046 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 287 [2018-10-15 15:32:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:26,048 INFO L225 Difference]: With dead ends: 451 [2018-10-15 15:32:26,048 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 15:32:26,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1427, Invalid=2995, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:32:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 15:32:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2018-10-15 15:32:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 15:32:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-15 15:32:26,054 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 287 [2018-10-15 15:32:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:26,055 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-15 15:32:26,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:32:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-15 15:32:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 15:32:26,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:26,056 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:26,057 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:26,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1278154700, now seen corresponding path program 24 times [2018-10-15 15:32:26,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 888 proven. 1140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:32:26,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:32:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:32:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=293, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:32:26,996 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 23 states. [2018-10-15 15:32:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:29,323 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 15:32:29,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 15:32:29,324 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 294 [2018-10-15 15:32:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:29,326 INFO L225 Difference]: With dead ends: 326 [2018-10-15 15:32:29,326 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 15:32:29,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1087, Invalid=2219, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:32:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 15:32:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 315. [2018-10-15 15:32:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 15:32:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-15 15:32:29,333 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 294 [2018-10-15 15:32:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:29,333 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-15 15:32:29,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:32:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-15 15:32:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 15:32:29,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:29,335 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:29,336 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:29,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1006560540, now seen corresponding path program 25 times [2018-10-15 15:32:29,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1462 proven. 888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:30,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:30,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 15:32:30,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 15:32:30,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 15:32:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 15:32:30,675 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 38 states. [2018-10-15 15:32:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:31,881 INFO L93 Difference]: Finished difference Result 488 states and 489 transitions. [2018-10-15 15:32:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 15:32:31,881 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 314 [2018-10-15 15:32:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:31,883 INFO L225 Difference]: With dead ends: 488 [2018-10-15 15:32:31,883 INFO L226 Difference]: Without dead ends: 325 [2018-10-15 15:32:31,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1620, Invalid=3492, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 15:32:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-15 15:32:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2018-10-15 15:32:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-15 15:32:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2018-10-15 15:32:31,889 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 314 [2018-10-15 15:32:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:31,889 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2018-10-15 15:32:31,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 15:32:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2018-10-15 15:32:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-15 15:32:31,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:31,891 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:31,891 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:31,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 663521814, now seen corresponding path program 26 times [2018-10-15 15:32:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2465 backedges. 1462 proven. 1003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:32,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:32,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:32:32,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:32:32,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:32:32,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:32:32,682 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 39 states. [2018-10-15 15:32:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:34,009 INFO L93 Difference]: Finished difference Result 505 states and 506 transitions. [2018-10-15 15:32:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 15:32:34,009 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 321 [2018-10-15 15:32:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:34,012 INFO L225 Difference]: With dead ends: 505 [2018-10-15 15:32:34,012 INFO L226 Difference]: Without dead ends: 332 [2018-10-15 15:32:34,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1785, Invalid=3765, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:32:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-15 15:32:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2018-10-15 15:32:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-15 15:32:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-10-15 15:32:34,018 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 321 [2018-10-15 15:32:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:34,019 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-10-15 15:32:34,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:32:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-10-15 15:32:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-15 15:32:34,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:34,021 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:34,021 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:34,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1174681564, now seen corresponding path program 27 times [2018-10-15 15:32:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 1125 proven. 1462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:34,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:34,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:32:34,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:32:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:32:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=344, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:32:34,563 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 25 states. [2018-10-15 15:32:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:35,629 INFO L93 Difference]: Finished difference Result 360 states and 361 transitions. [2018-10-15 15:32:35,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 15:32:35,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 328 [2018-10-15 15:32:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:35,632 INFO L225 Difference]: With dead ends: 360 [2018-10-15 15:32:35,632 INFO L226 Difference]: Without dead ends: 360 [2018-10-15 15:32:35,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 15:32:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-15 15:32:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 349. [2018-10-15 15:32:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 15:32:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-10-15 15:32:35,638 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 328 [2018-10-15 15:32:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:35,638 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-10-15 15:32:35,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:32:35,638 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-10-15 15:32:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 15:32:35,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:35,640 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:35,640 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:35,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash -510436052, now seen corresponding path program 28 times [2018-10-15 15:32:35,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2949 backedges. 1824 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:36,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:36,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 15:32:36,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 15:32:36,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 15:32:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 15:32:36,523 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 42 states. [2018-10-15 15:32:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:38,082 INFO L93 Difference]: Finished difference Result 542 states and 543 transitions. [2018-10-15 15:32:38,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 15:32:38,082 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 348 [2018-10-15 15:32:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:38,085 INFO L225 Difference]: With dead ends: 542 [2018-10-15 15:32:38,085 INFO L226 Difference]: Without dead ends: 359 [2018-10-15 15:32:38,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2000, Invalid=4320, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 15:32:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-15 15:32:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2018-10-15 15:32:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 15:32:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-10-15 15:32:38,091 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 348 [2018-10-15 15:32:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:38,091 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-10-15 15:32:38,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 15:32:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-10-15 15:32:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-15 15:32:38,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:38,094 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:38,094 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:38,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash -194821210, now seen corresponding path program 29 times [2018-10-15 15:32:38,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 1824 proven. 1254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:39,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:39,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:32:39,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:32:39,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:32:39,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:32:39,024 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 43 states. [2018-10-15 15:32:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:40,963 INFO L93 Difference]: Finished difference Result 559 states and 560 transitions. [2018-10-15 15:32:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 15:32:40,963 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 355 [2018-10-15 15:32:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:40,966 INFO L225 Difference]: With dead ends: 559 [2018-10-15 15:32:40,966 INFO L226 Difference]: Without dead ends: 366 [2018-10-15 15:32:40,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2183, Invalid=4623, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:32:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-10-15 15:32:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2018-10-15 15:32:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-15 15:32:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-10-15 15:32:40,971 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 355 [2018-10-15 15:32:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:40,971 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-10-15 15:32:40,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:32:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-10-15 15:32:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-15 15:32:40,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:40,974 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:40,974 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:40,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1168900116, now seen corresponding path program 30 times [2018-10-15 15:32:40,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3214 backedges. 1390 proven. 1824 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:41,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:41,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:32:41,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:32:41,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:32:41,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=399, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:32:41,509 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 27 states. [2018-10-15 15:32:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:42,781 INFO L93 Difference]: Finished difference Result 394 states and 395 transitions. [2018-10-15 15:32:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 15:32:42,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 362 [2018-10-15 15:32:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:42,783 INFO L225 Difference]: With dead ends: 394 [2018-10-15 15:32:42,783 INFO L226 Difference]: Without dead ends: 394 [2018-10-15 15:32:42,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1591, Invalid=3239, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:32:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-15 15:32:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 383. [2018-10-15 15:32:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-15 15:32:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-10-15 15:32:42,789 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 362 [2018-10-15 15:32:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:42,790 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-10-15 15:32:42,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:32:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-10-15 15:32:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-15 15:32:42,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:42,792 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:42,792 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:42,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1639873852, now seen corresponding path program 31 times [2018-10-15 15:32:42,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3616 backedges. 2226 proven. 1390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 15:32:43,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 15:32:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 15:32:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1540, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 15:32:43,690 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 46 states. [2018-10-15 15:32:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:45,606 INFO L93 Difference]: Finished difference Result 596 states and 597 transitions. [2018-10-15 15:32:45,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 15:32:45,607 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 382 [2018-10-15 15:32:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:45,609 INFO L225 Difference]: With dead ends: 596 [2018-10-15 15:32:45,609 INFO L226 Difference]: Without dead ends: 393 [2018-10-15 15:32:45,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2420, Invalid=5236, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:32:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-15 15:32:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2018-10-15 15:32:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-15 15:32:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2018-10-15 15:32:45,615 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 382 [2018-10-15 15:32:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:45,616 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 391 transitions. [2018-10-15 15:32:45,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 15:32:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 391 transitions. [2018-10-15 15:32:45,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 15:32:45,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:45,618 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:45,618 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:45,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1067432650, now seen corresponding path program 32 times [2018-10-15 15:32:45,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2226 proven. 1533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:46,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:32:46,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:32:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:32:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:32:46,540 INFO L87 Difference]: Start difference. First operand 390 states and 391 transitions. Second operand 47 states. [2018-10-15 15:32:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:48,369 INFO L93 Difference]: Finished difference Result 613 states and 614 transitions. [2018-10-15 15:32:48,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 15:32:48,369 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 389 [2018-10-15 15:32:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:48,371 INFO L225 Difference]: With dead ends: 613 [2018-10-15 15:32:48,371 INFO L226 Difference]: Without dead ends: 400 [2018-10-15 15:32:48,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2621, Invalid=5569, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:32:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-15 15:32:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2018-10-15 15:32:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-15 15:32:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-10-15 15:32:48,380 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 389 [2018-10-15 15:32:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:48,380 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-10-15 15:32:48,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:32:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-10-15 15:32:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-15 15:32:48,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:48,382 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:48,383 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:48,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1449553916, now seen corresponding path program 33 times [2018-10-15 15:32:48,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3909 backedges. 1683 proven. 2226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:49,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:49,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:32:49,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:32:49,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:32:49,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=458, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:32:49,031 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 29 states. [2018-10-15 15:32:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:50,065 INFO L93 Difference]: Finished difference Result 428 states and 429 transitions. [2018-10-15 15:32:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 15:32:50,066 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 396 [2018-10-15 15:32:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:50,068 INFO L225 Difference]: With dead ends: 428 [2018-10-15 15:32:50,068 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 15:32:50,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1879, Invalid=3821, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 15:32:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 15:32:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 417. [2018-10-15 15:32:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-15 15:32:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-10-15 15:32:50,075 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 396 [2018-10-15 15:32:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:50,075 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-10-15 15:32:50,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:32:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-10-15 15:32:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-15 15:32:50,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:50,078 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:50,078 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:50,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash -171424436, now seen corresponding path program 34 times [2018-10-15 15:32:50,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4351 backedges. 2668 proven. 1683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:51,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:51,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 15:32:51,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 15:32:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 15:32:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1824, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 15:32:51,560 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 50 states. [2018-10-15 15:32:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:53,684 INFO L93 Difference]: Finished difference Result 650 states and 651 transitions. [2018-10-15 15:32:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 15:32:53,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 416 [2018-10-15 15:32:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:53,687 INFO L225 Difference]: With dead ends: 650 [2018-10-15 15:32:53,687 INFO L226 Difference]: Without dead ends: 427 [2018-10-15 15:32:53,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2880, Invalid=6240, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 15:32:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-15 15:32:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 424. [2018-10-15 15:32:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-15 15:32:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2018-10-15 15:32:53,693 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 416 [2018-10-15 15:32:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:53,693 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2018-10-15 15:32:53,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 15:32:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2018-10-15 15:32:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-15 15:32:53,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:53,696 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:53,697 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:53,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1491308230, now seen corresponding path program 35 times [2018-10-15 15:32:53,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4508 backedges. 2668 proven. 1840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:54,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:54,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:32:54,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:32:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:32:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:32:54,870 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 51 states. [2018-10-15 15:32:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:57,244 INFO L93 Difference]: Finished difference Result 667 states and 668 transitions. [2018-10-15 15:32:57,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 15:32:57,244 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 423 [2018-10-15 15:32:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:57,246 INFO L225 Difference]: With dead ends: 667 [2018-10-15 15:32:57,246 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 15:32:57,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3099, Invalid=6603, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:32:57,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 15:32:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2018-10-15 15:32:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-15 15:32:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-10-15 15:32:57,253 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 423 [2018-10-15 15:32:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:57,253 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-10-15 15:32:57,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:32:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-10-15 15:32:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-15 15:32:57,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:57,256 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:57,256 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:57,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash 142837772, now seen corresponding path program 36 times [2018-10-15 15:32:57,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:32:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4672 backedges. 2004 proven. 2668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:32:58,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:32:58,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:32:58,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:32:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:32:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=521, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:32:58,159 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 31 states. [2018-10-15 15:32:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:32:59,351 INFO L93 Difference]: Finished difference Result 462 states and 463 transitions. [2018-10-15 15:32:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 15:32:59,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 430 [2018-10-15 15:32:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:32:59,354 INFO L225 Difference]: With dead ends: 462 [2018-10-15 15:32:59,354 INFO L226 Difference]: Without dead ends: 462 [2018-10-15 15:32:59,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2191, Invalid=4451, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:32:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-15 15:32:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 451. [2018-10-15 15:32:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-15 15:32:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 452 transitions. [2018-10-15 15:32:59,360 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 452 transitions. Word has length 430 [2018-10-15 15:32:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:32:59,360 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 452 transitions. [2018-10-15 15:32:59,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:32:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 452 transitions. [2018-10-15 15:32:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-15 15:32:59,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:32:59,363 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:32:59,363 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:32:59,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:32:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1745308324, now seen corresponding path program 37 times [2018-10-15 15:32:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:32:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5154 backedges. 3150 proven. 2004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:00,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 15:33:00,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 15:33:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 15:33:00,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=2132, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 15:33:00,585 INFO L87 Difference]: Start difference. First operand 451 states and 452 transitions. Second operand 54 states. [2018-10-15 15:33:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:03,197 INFO L93 Difference]: Finished difference Result 704 states and 705 transitions. [2018-10-15 15:33:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 15:33:03,197 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 450 [2018-10-15 15:33:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:03,200 INFO L225 Difference]: With dead ends: 704 [2018-10-15 15:33:03,200 INFO L226 Difference]: Without dead ends: 461 [2018-10-15 15:33:03,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3380, Invalid=7332, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 15:33:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-15 15:33:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 458. [2018-10-15 15:33:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-15 15:33:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 459 transitions. [2018-10-15 15:33:03,206 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 459 transitions. Word has length 450 [2018-10-15 15:33:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:03,206 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 459 transitions. [2018-10-15 15:33:03,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 15:33:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 459 transitions. [2018-10-15 15:33:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 15:33:03,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:03,209 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:03,210 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:03,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1179459670, now seen corresponding path program 38 times [2018-10-15 15:33:03,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5325 backedges. 3150 proven. 2175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:04,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:04,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:33:04,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:33:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:33:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:33:04,499 INFO L87 Difference]: Start difference. First operand 458 states and 459 transitions. Second operand 55 states. [2018-10-15 15:33:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:07,181 INFO L93 Difference]: Finished difference Result 721 states and 722 transitions. [2018-10-15 15:33:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 15:33:07,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 457 [2018-10-15 15:33:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:07,184 INFO L225 Difference]: With dead ends: 721 [2018-10-15 15:33:07,184 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 15:33:07,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3617, Invalid=7725, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:33:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 15:33:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 465. [2018-10-15 15:33:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-10-15 15:33:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-10-15 15:33:07,190 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 457 [2018-10-15 15:33:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:07,191 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-10-15 15:33:07,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:33:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-10-15 15:33:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-15 15:33:07,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:07,194 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:07,194 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:07,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1072908316, now seen corresponding path program 39 times [2018-10-15 15:33:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5503 backedges. 2353 proven. 3150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:07,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:07,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:33:07,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:33:07,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:33:07,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=588, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:33:07,979 INFO L87 Difference]: Start difference. First operand 465 states and 466 transitions. Second operand 33 states. [2018-10-15 15:33:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:09,320 INFO L93 Difference]: Finished difference Result 496 states and 497 transitions. [2018-10-15 15:33:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 15:33:09,321 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 464 [2018-10-15 15:33:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:09,324 INFO L225 Difference]: With dead ends: 496 [2018-10-15 15:33:09,324 INFO L226 Difference]: Without dead ends: 496 [2018-10-15 15:33:09,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2527, Invalid=5129, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 15:33:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-15 15:33:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 485. [2018-10-15 15:33:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-15 15:33:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-10-15 15:33:09,329 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 464 [2018-10-15 15:33:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:09,329 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-10-15 15:33:09,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:33:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-10-15 15:33:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-15 15:33:09,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:09,332 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:09,332 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:09,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1134021996, now seen corresponding path program 40 times [2018-10-15 15:33:09,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6025 backedges. 3672 proven. 2353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:10,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:10,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 15:33:10,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 15:33:10,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 15:33:10,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 15:33:10,675 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 58 states. [2018-10-15 15:33:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:13,503 INFO L93 Difference]: Finished difference Result 758 states and 759 transitions. [2018-10-15 15:33:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 15:33:13,504 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 484 [2018-10-15 15:33:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:13,507 INFO L225 Difference]: With dead ends: 758 [2018-10-15 15:33:13,507 INFO L226 Difference]: Without dead ends: 495 [2018-10-15 15:33:13,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3920, Invalid=8512, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 15:33:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-15 15:33:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2018-10-15 15:33:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-15 15:33:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 493 transitions. [2018-10-15 15:33:13,512 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 493 transitions. Word has length 484 [2018-10-15 15:33:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:13,512 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 493 transitions. [2018-10-15 15:33:13,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 15:33:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 493 transitions. [2018-10-15 15:33:13,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-15 15:33:13,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:13,516 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:13,516 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:13,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1946355226, now seen corresponding path program 41 times [2018-10-15 15:33:13,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6210 backedges. 3672 proven. 2538 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:15,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:33:15,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:33:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:33:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:33:15,236 INFO L87 Difference]: Start difference. First operand 492 states and 493 transitions. Second operand 59 states. [2018-10-15 15:33:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:18,379 INFO L93 Difference]: Finished difference Result 775 states and 776 transitions. [2018-10-15 15:33:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 15:33:18,379 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 491 [2018-10-15 15:33:18,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:18,381 INFO L225 Difference]: With dead ends: 775 [2018-10-15 15:33:18,382 INFO L226 Difference]: Without dead ends: 502 [2018-10-15 15:33:18,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4175, Invalid=8935, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:33:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-10-15 15:33:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2018-10-15 15:33:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-15 15:33:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 500 transitions. [2018-10-15 15:33:18,387 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 500 transitions. Word has length 491 [2018-10-15 15:33:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:18,387 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 500 transitions. [2018-10-15 15:33:18,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:33:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 500 transitions. [2018-10-15 15:33:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-10-15 15:33:18,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:18,390 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:18,390 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:18,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash 754823212, now seen corresponding path program 42 times [2018-10-15 15:33:18,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6402 backedges. 2730 proven. 3672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:19,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:19,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:33:19,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:33:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:33:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=659, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:33:19,251 INFO L87 Difference]: Start difference. First operand 499 states and 500 transitions. Second operand 35 states. [2018-10-15 15:33:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:20,831 INFO L93 Difference]: Finished difference Result 530 states and 531 transitions. [2018-10-15 15:33:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 15:33:20,831 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 498 [2018-10-15 15:33:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:20,834 INFO L225 Difference]: With dead ends: 530 [2018-10-15 15:33:20,834 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 15:33:20,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2887, Invalid=5855, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 15:33:20,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 15:33:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 519. [2018-10-15 15:33:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-15 15:33:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 520 transitions. [2018-10-15 15:33:20,839 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 520 transitions. Word has length 498 [2018-10-15 15:33:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:20,840 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 520 transitions. [2018-10-15 15:33:20,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:33:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 520 transitions. [2018-10-15 15:33:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-15 15:33:20,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:20,844 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:20,844 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:20,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash 887983484, now seen corresponding path program 43 times [2018-10-15 15:33:20,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6964 backedges. 4234 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:22,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:22,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 15:33:22,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 15:33:22,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 15:33:22,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=962, Invalid=2820, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 15:33:22,675 INFO L87 Difference]: Start difference. First operand 519 states and 520 transitions. Second operand 62 states. [2018-10-15 15:33:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:25,820 INFO L93 Difference]: Finished difference Result 812 states and 813 transitions. [2018-10-15 15:33:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 15:33:25,820 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 518 [2018-10-15 15:33:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:25,823 INFO L225 Difference]: With dead ends: 812 [2018-10-15 15:33:25,823 INFO L226 Difference]: Without dead ends: 529 [2018-10-15 15:33:25,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4500, Invalid=9780, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 15:33:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-10-15 15:33:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 526. [2018-10-15 15:33:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-10-15 15:33:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 527 transitions. [2018-10-15 15:33:25,829 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 527 transitions. Word has length 518 [2018-10-15 15:33:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:25,829 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 527 transitions. [2018-10-15 15:33:25,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 15:33:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 527 transitions. [2018-10-15 15:33:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-10-15 15:33:25,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:25,832 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:25,832 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:25,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1750276982, now seen corresponding path program 44 times [2018-10-15 15:33:25,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7163 backedges. 4234 proven. 2929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:27,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:27,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:33:27,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:33:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:33:27,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:33:27,725 INFO L87 Difference]: Start difference. First operand 526 states and 527 transitions. Second operand 63 states. [2018-10-15 15:33:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:30,953 INFO L93 Difference]: Finished difference Result 829 states and 830 transitions. [2018-10-15 15:33:30,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 15:33:30,954 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 525 [2018-10-15 15:33:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:30,956 INFO L225 Difference]: With dead ends: 829 [2018-10-15 15:33:30,956 INFO L226 Difference]: Without dead ends: 536 [2018-10-15 15:33:30,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4773, Invalid=10233, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:33:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-15 15:33:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2018-10-15 15:33:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-15 15:33:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 534 transitions. [2018-10-15 15:33:30,962 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 534 transitions. Word has length 525 [2018-10-15 15:33:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:30,962 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 534 transitions. [2018-10-15 15:33:30,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:33:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 534 transitions. [2018-10-15 15:33:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-10-15 15:33:30,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:30,966 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:30,966 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:30,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash 15384636, now seen corresponding path program 45 times [2018-10-15 15:33:30,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7369 backedges. 3135 proven. 4234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:32,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:32,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:33:32,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:33:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:33:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=734, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:33:32,167 INFO L87 Difference]: Start difference. First operand 533 states and 534 transitions. Second operand 37 states. [2018-10-15 15:33:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:33,790 INFO L93 Difference]: Finished difference Result 564 states and 565 transitions. [2018-10-15 15:33:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 15:33:33,791 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 532 [2018-10-15 15:33:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:33,794 INFO L225 Difference]: With dead ends: 564 [2018-10-15 15:33:33,794 INFO L226 Difference]: Without dead ends: 564 [2018-10-15 15:33:33,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3271, Invalid=6629, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 15:33:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-10-15 15:33:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 553. [2018-10-15 15:33:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-10-15 15:33:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 554 transitions. [2018-10-15 15:33:33,800 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 554 transitions. Word has length 532 [2018-10-15 15:33:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:33,800 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 554 transitions. [2018-10-15 15:33:33,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:33:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 554 transitions. [2018-10-15 15:33:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-10-15 15:33:33,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:33,803 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:33,803 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:33,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:33,804 INFO L82 PathProgramCache]: Analyzing trace with hash 692188556, now seen corresponding path program 46 times [2018-10-15 15:33:33,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7971 backedges. 4836 proven. 3135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:35,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:35,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 15:33:35,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 15:33:35,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 15:33:35,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3200, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 15:33:35,530 INFO L87 Difference]: Start difference. First operand 553 states and 554 transitions. Second operand 66 states. [2018-10-15 15:33:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:39,169 INFO L93 Difference]: Finished difference Result 866 states and 867 transitions. [2018-10-15 15:33:39,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 15:33:39,169 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 552 [2018-10-15 15:33:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:39,173 INFO L225 Difference]: With dead ends: 866 [2018-10-15 15:33:39,173 INFO L226 Difference]: Without dead ends: 563 [2018-10-15 15:33:39,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5120, Invalid=11136, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 15:33:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-10-15 15:33:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 560. [2018-10-15 15:33:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 15:33:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2018-10-15 15:33:39,179 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 552 [2018-10-15 15:33:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:39,179 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2018-10-15 15:33:39,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 15:33:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2018-10-15 15:33:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 15:33:39,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:39,183 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:39,183 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:39,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash 347047174, now seen corresponding path program 47 times [2018-10-15 15:33:39,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8184 backedges. 4836 proven. 3348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:40,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:40,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:33:40,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:33:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:33:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:33:40,931 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 67 states. [2018-10-15 15:33:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:44,510 INFO L93 Difference]: Finished difference Result 883 states and 884 transitions. [2018-10-15 15:33:44,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 15:33:44,510 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 559 [2018-10-15 15:33:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:44,513 INFO L225 Difference]: With dead ends: 883 [2018-10-15 15:33:44,513 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 15:33:44,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5411, Invalid=11619, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:33:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 15:33:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 567. [2018-10-15 15:33:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-10-15 15:33:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-10-15 15:33:44,520 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 559 [2018-10-15 15:33:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:44,520 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-10-15 15:33:44,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:33:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-10-15 15:33:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-10-15 15:33:44,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:44,523 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:44,524 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:44,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash 771913804, now seen corresponding path program 48 times [2018-10-15 15:33:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8404 backedges. 3568 proven. 4836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:45,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:45,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:33:45,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:33:45,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:33:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=813, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:33:45,459 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 39 states. [2018-10-15 15:33:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:47,479 INFO L93 Difference]: Finished difference Result 598 states and 599 transitions. [2018-10-15 15:33:47,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 15:33:47,480 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 566 [2018-10-15 15:33:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:47,483 INFO L225 Difference]: With dead ends: 598 [2018-10-15 15:33:47,483 INFO L226 Difference]: Without dead ends: 598 [2018-10-15 15:33:47,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3464 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3679, Invalid=7451, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 15:33:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-10-15 15:33:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 587. [2018-10-15 15:33:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-15 15:33:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 588 transitions. [2018-10-15 15:33:47,491 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 588 transitions. Word has length 566 [2018-10-15 15:33:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:47,491 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 588 transitions. [2018-10-15 15:33:47,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:33:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 588 transitions. [2018-10-15 15:33:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-10-15 15:33:47,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:47,495 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:47,495 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:47,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1629682276, now seen corresponding path program 49 times [2018-10-15 15:33:47,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9046 backedges. 5478 proven. 3568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:49,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:49,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 15:33:49,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 15:33:49,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 15:33:49,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=3604, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 15:33:49,485 INFO L87 Difference]: Start difference. First operand 587 states and 588 transitions. Second operand 70 states. [2018-10-15 15:33:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:53,517 INFO L93 Difference]: Finished difference Result 920 states and 921 transitions. [2018-10-15 15:33:53,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 15:33:53,521 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 586 [2018-10-15 15:33:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:53,524 INFO L225 Difference]: With dead ends: 920 [2018-10-15 15:33:53,524 INFO L226 Difference]: Without dead ends: 597 [2018-10-15 15:33:53,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5780, Invalid=12580, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 15:33:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-15 15:33:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 594. [2018-10-15 15:33:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-15 15:33:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 595 transitions. [2018-10-15 15:33:53,530 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 595 transitions. Word has length 586 [2018-10-15 15:33:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:53,530 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 595 transitions. [2018-10-15 15:33:53,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 15:33:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 595 transitions. [2018-10-15 15:33:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-10-15 15:33:53,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:53,535 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:53,535 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:53,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:53,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2056112490, now seen corresponding path program 50 times [2018-10-15 15:33:53,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:33:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 5478 proven. 3795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:33:55,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:33:55,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:33:55,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:33:55,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:33:55,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:33:55,563 INFO L87 Difference]: Start difference. First operand 594 states and 595 transitions. Second operand 71 states. [2018-10-15 15:33:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:33:59,276 INFO L93 Difference]: Finished difference Result 937 states and 938 transitions. [2018-10-15 15:33:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 15:33:59,276 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 593 [2018-10-15 15:33:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:33:59,278 INFO L225 Difference]: With dead ends: 937 [2018-10-15 15:33:59,279 INFO L226 Difference]: Without dead ends: 604 [2018-10-15 15:33:59,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6089, Invalid=13093, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:33:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-15 15:33:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 601. [2018-10-15 15:33:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-15 15:33:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-10-15 15:33:59,285 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 593 [2018-10-15 15:33:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:33:59,285 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-10-15 15:33:59,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:33:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-10-15 15:33:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-10-15 15:33:59,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:33:59,298 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:33:59,298 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:33:59,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:33:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1483941796, now seen corresponding path program 51 times [2018-10-15 15:33:59,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:33:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 4029 proven. 5478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:00,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:00,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:34:00,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:34:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:34:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=896, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:34:00,237 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 41 states. [2018-10-15 15:34:00,844 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 15:34:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:02,906 INFO L93 Difference]: Finished difference Result 632 states and 633 transitions. [2018-10-15 15:34:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 15:34:02,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 600 [2018-10-15 15:34:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:02,909 INFO L225 Difference]: With dead ends: 632 [2018-10-15 15:34:02,910 INFO L226 Difference]: Without dead ends: 632 [2018-10-15 15:34:02,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4111, Invalid=8321, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 15:34:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-15 15:34:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 621. [2018-10-15 15:34:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-10-15 15:34:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 622 transitions. [2018-10-15 15:34:02,916 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 622 transitions. Word has length 600 [2018-10-15 15:34:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:02,917 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 622 transitions. [2018-10-15 15:34:02,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:34:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 622 transitions. [2018-10-15 15:34:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-10-15 15:34:02,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:02,920 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:02,920 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:02,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash 352763308, now seen corresponding path program 52 times [2018-10-15 15:34:02,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10189 backedges. 6160 proven. 4029 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:05,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:05,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 15:34:05,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 15:34:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 15:34:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=4032, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 15:34:05,160 INFO L87 Difference]: Start difference. First operand 621 states and 622 transitions. Second operand 74 states. [2018-10-15 15:34:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:09,596 INFO L93 Difference]: Finished difference Result 974 states and 975 transitions. [2018-10-15 15:34:09,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 15:34:09,596 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 620 [2018-10-15 15:34:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:09,599 INFO L225 Difference]: With dead ends: 974 [2018-10-15 15:34:09,599 INFO L226 Difference]: Without dead ends: 631 [2018-10-15 15:34:09,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6480, Invalid=14112, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 15:34:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-10-15 15:34:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 628. [2018-10-15 15:34:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-15 15:34:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 629 transitions. [2018-10-15 15:34:09,605 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 629 transitions. Word has length 620 [2018-10-15 15:34:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:09,605 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 629 transitions. [2018-10-15 15:34:09,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 15:34:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 629 transitions. [2018-10-15 15:34:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-15 15:34:09,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:09,608 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:09,609 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:09,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash 704327718, now seen corresponding path program 53 times [2018-10-15 15:34:09,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10430 backedges. 6160 proven. 4270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:11,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:11,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:34:11,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:34:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:34:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:34:11,728 INFO L87 Difference]: Start difference. First operand 628 states and 629 transitions. Second operand 75 states. [2018-10-15 15:34:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:15,841 INFO L93 Difference]: Finished difference Result 991 states and 992 transitions. [2018-10-15 15:34:15,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 15:34:15,842 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 627 [2018-10-15 15:34:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:15,844 INFO L225 Difference]: With dead ends: 991 [2018-10-15 15:34:15,844 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 15:34:15,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6807, Invalid=14655, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:34:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 15:34:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2018-10-15 15:34:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-15 15:34:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 636 transitions. [2018-10-15 15:34:15,850 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 636 transitions. Word has length 627 [2018-10-15 15:34:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:15,850 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 636 transitions. [2018-10-15 15:34:15,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:34:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 636 transitions. [2018-10-15 15:34:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-10-15 15:34:15,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:15,853 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:15,854 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:15,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash 567402604, now seen corresponding path program 54 times [2018-10-15 15:34:15,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10678 backedges. 4518 proven. 6160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:16,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:16,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:34:16,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:34:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:34:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=983, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:34:16,932 INFO L87 Difference]: Start difference. First operand 635 states and 636 transitions. Second operand 43 states. [2018-10-15 15:34:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:19,363 INFO L93 Difference]: Finished difference Result 666 states and 667 transitions. [2018-10-15 15:34:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 15:34:19,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 634 [2018-10-15 15:34:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:19,366 INFO L225 Difference]: With dead ends: 666 [2018-10-15 15:34:19,367 INFO L226 Difference]: Without dead ends: 666 [2018-10-15 15:34:19,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4328 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4567, Invalid=9239, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:34:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-15 15:34:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 655. [2018-10-15 15:34:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-10-15 15:34:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2018-10-15 15:34:19,373 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 634 [2018-10-15 15:34:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:19,373 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2018-10-15 15:34:19,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:34:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2018-10-15 15:34:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-10-15 15:34:19,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:19,377 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:19,377 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:19,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1275534780, now seen corresponding path program 55 times [2018-10-15 15:34:19,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6882 proven. 4518 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:21,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:21,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 15:34:21,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 15:34:21,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 15:34:21,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1522, Invalid=4484, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 15:34:21,644 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 78 states. [2018-10-15 15:34:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:26,720 INFO L93 Difference]: Finished difference Result 1028 states and 1029 transitions. [2018-10-15 15:34:26,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 15:34:26,721 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 654 [2018-10-15 15:34:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:26,724 INFO L225 Difference]: With dead ends: 1028 [2018-10-15 15:34:26,725 INFO L226 Difference]: Without dead ends: 665 [2018-10-15 15:34:26,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7220, Invalid=15732, Unknown=0, NotChecked=0, Total=22952 [2018-10-15 15:34:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-10-15 15:34:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2018-10-15 15:34:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-10-15 15:34:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 663 transitions. [2018-10-15 15:34:26,732 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 663 transitions. Word has length 654 [2018-10-15 15:34:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:26,732 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 663 transitions. [2018-10-15 15:34:26,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 15:34:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 663 transitions. [2018-10-15 15:34:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2018-10-15 15:34:26,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:26,735 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:26,736 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:26,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1398115914, now seen corresponding path program 56 times [2018-10-15 15:34:26,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11655 backedges. 6882 proven. 4773 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:29,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:29,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:34:29,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:34:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:34:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:34:29,342 INFO L87 Difference]: Start difference. First operand 662 states and 663 transitions. Second operand 79 states. [2018-10-15 15:34:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:34,702 INFO L93 Difference]: Finished difference Result 1045 states and 1046 transitions. [2018-10-15 15:34:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 15:34:34,702 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 661 [2018-10-15 15:34:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:34,706 INFO L225 Difference]: With dead ends: 1045 [2018-10-15 15:34:34,706 INFO L226 Difference]: Without dead ends: 672 [2018-10-15 15:34:34,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7565, Invalid=16305, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:34:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-10-15 15:34:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 669. [2018-10-15 15:34:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-10-15 15:34:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 670 transitions. [2018-10-15 15:34:34,713 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 670 transitions. Word has length 661 [2018-10-15 15:34:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:34,713 INFO L481 AbstractCegarLoop]: Abstraction has 669 states and 670 transitions. [2018-10-15 15:34:34,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:34:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 670 transitions. [2018-10-15 15:34:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2018-10-15 15:34:34,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:34,717 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:34,718 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:34,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1377407100, now seen corresponding path program 57 times [2018-10-15 15:34:34,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11917 backedges. 5035 proven. 6882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:35,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:35,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:34:35,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:34:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:34:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=1074, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:34:35,989 INFO L87 Difference]: Start difference. First operand 669 states and 670 transitions. Second operand 45 states. [2018-10-15 15:34:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:38,514 INFO L93 Difference]: Finished difference Result 700 states and 701 transitions. [2018-10-15 15:34:38,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 15:34:38,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 668 [2018-10-15 15:34:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:38,518 INFO L225 Difference]: With dead ends: 700 [2018-10-15 15:34:38,519 INFO L226 Difference]: Without dead ends: 700 [2018-10-15 15:34:38,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4796 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5047, Invalid=10205, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 15:34:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-10-15 15:34:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 689. [2018-10-15 15:34:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-10-15 15:34:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 690 transitions. [2018-10-15 15:34:38,525 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 690 transitions. Word has length 668 [2018-10-15 15:34:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:38,526 INFO L481 AbstractCegarLoop]: Abstraction has 689 states and 690 transitions. [2018-10-15 15:34:38,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:34:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 690 transitions. [2018-10-15 15:34:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-10-15 15:34:38,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:38,529 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:38,530 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:38,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2061097524, now seen corresponding path program 58 times [2018-10-15 15:34:38,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12679 backedges. 7644 proven. 5035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:41,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:41,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 15:34:41,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 15:34:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 15:34:41,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=4960, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 15:34:41,149 INFO L87 Difference]: Start difference. First operand 689 states and 690 transitions. Second operand 82 states. [2018-10-15 15:34:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:46,396 INFO L93 Difference]: Finished difference Result 1082 states and 1083 transitions. [2018-10-15 15:34:46,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 15:34:46,397 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 688 [2018-10-15 15:34:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:46,400 INFO L225 Difference]: With dead ends: 1082 [2018-10-15 15:34:46,400 INFO L226 Difference]: Without dead ends: 699 [2018-10-15 15:34:46,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8000, Invalid=17440, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 15:34:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-15 15:34:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 696. [2018-10-15 15:34:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-10-15 15:34:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 697 transitions. [2018-10-15 15:34:46,406 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 697 transitions. Word has length 688 [2018-10-15 15:34:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:46,407 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 697 transitions. [2018-10-15 15:34:46,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 15:34:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 697 transitions. [2018-10-15 15:34:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2018-10-15 15:34:46,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:46,410 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:46,411 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:46,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1293943994, now seen corresponding path program 59 times [2018-10-15 15:34:46,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12948 backedges. 7644 proven. 5304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:49,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:49,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:34:49,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:34:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:34:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:34:49,208 INFO L87 Difference]: Start difference. First operand 696 states and 697 transitions. Second operand 83 states. [2018-10-15 15:34:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:55,045 INFO L93 Difference]: Finished difference Result 1099 states and 1100 transitions. [2018-10-15 15:34:55,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 15:34:55,045 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 695 [2018-10-15 15:34:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:55,048 INFO L225 Difference]: With dead ends: 1099 [2018-10-15 15:34:55,048 INFO L226 Difference]: Without dead ends: 706 [2018-10-15 15:34:55,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8363, Invalid=18043, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:34:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-10-15 15:34:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 703. [2018-10-15 15:34:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-15 15:34:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 704 transitions. [2018-10-15 15:34:55,054 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 704 transitions. Word has length 695 [2018-10-15 15:34:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:55,054 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 704 transitions. [2018-10-15 15:34:55,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:34:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 704 transitions. [2018-10-15 15:34:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-15 15:34:55,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:55,058 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:55,058 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:55,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash 783018124, now seen corresponding path program 60 times [2018-10-15 15:34:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13224 backedges. 5580 proven. 7644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:56,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:56,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:34:56,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:34:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:34:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1169, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:34:56,268 INFO L87 Difference]: Start difference. First operand 703 states and 704 transitions. Second operand 47 states. [2018-10-15 15:34:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:59,040 INFO L93 Difference]: Finished difference Result 734 states and 735 transitions. [2018-10-15 15:34:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 15:34:59,040 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 702 [2018-10-15 15:34:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:59,044 INFO L225 Difference]: With dead ends: 734 [2018-10-15 15:34:59,044 INFO L226 Difference]: Without dead ends: 734 [2018-10-15 15:34:59,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5288 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5551, Invalid=11219, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 15:34:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-10-15 15:34:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 723. [2018-10-15 15:34:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-10-15 15:34:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 724 transitions. [2018-10-15 15:34:59,051 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 724 transitions. Word has length 702 [2018-10-15 15:34:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:59,051 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 724 transitions. [2018-10-15 15:34:59,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:34:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 724 transitions. [2018-10-15 15:34:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-10-15 15:34:59,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:59,055 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:59,055 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:59,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:59,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1028925988, now seen corresponding path program 61 times [2018-10-15 15:34:59,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14026 backedges. 8446 proven. 5580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:01,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:01,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 15:35:01,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 15:35:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 15:35:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1850, Invalid=5460, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 15:35:01,836 INFO L87 Difference]: Start difference. First operand 723 states and 724 transitions. Second operand 86 states. [2018-10-15 15:35:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:07,727 INFO L93 Difference]: Finished difference Result 1136 states and 1137 transitions. [2018-10-15 15:35:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 15:35:07,728 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 722 [2018-10-15 15:35:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:07,730 INFO L225 Difference]: With dead ends: 1136 [2018-10-15 15:35:07,730 INFO L226 Difference]: Without dead ends: 733 [2018-10-15 15:35:07,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8820, Invalid=19236, Unknown=0, NotChecked=0, Total=28056 [2018-10-15 15:35:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-15 15:35:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2018-10-15 15:35:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-10-15 15:35:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 731 transitions. [2018-10-15 15:35:07,737 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 731 transitions. Word has length 722 [2018-10-15 15:35:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:07,737 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 731 transitions. [2018-10-15 15:35:07,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 15:35:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 731 transitions. [2018-10-15 15:35:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 15:35:07,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:07,741 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:07,741 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:07,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1661219626, now seen corresponding path program 62 times [2018-10-15 15:35:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14309 backedges. 8446 proven. 5863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:10,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:10,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:35:10,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:35:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:35:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:35:10,753 INFO L87 Difference]: Start difference. First operand 730 states and 731 transitions. Second operand 87 states. [2018-10-15 15:35:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:16,782 INFO L93 Difference]: Finished difference Result 1153 states and 1154 transitions. [2018-10-15 15:35:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 15:35:16,783 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 729 [2018-10-15 15:35:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:16,787 INFO L225 Difference]: With dead ends: 1153 [2018-10-15 15:35:16,787 INFO L226 Difference]: Without dead ends: 740 [2018-10-15 15:35:16,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9201, Invalid=19869, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:35:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-10-15 15:35:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 737. [2018-10-15 15:35:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-10-15 15:35:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 738 transitions. [2018-10-15 15:35:16,794 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 738 transitions. Word has length 729 [2018-10-15 15:35:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:16,795 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 738 transitions. [2018-10-15 15:35:16,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:35:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 738 transitions. [2018-10-15 15:35:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2018-10-15 15:35:16,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:16,799 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:16,799 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:16,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash 785442972, now seen corresponding path program 63 times [2018-10-15 15:35:16,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14599 backedges. 6153 proven. 8446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:18,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:35:18,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:35:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:35:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1268, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:35:18,160 INFO L87 Difference]: Start difference. First operand 737 states and 738 transitions. Second operand 49 states. [2018-10-15 15:35:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:21,070 INFO L93 Difference]: Finished difference Result 768 states and 769 transitions. [2018-10-15 15:35:21,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 15:35:21,070 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 736 [2018-10-15 15:35:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:21,073 INFO L225 Difference]: With dead ends: 768 [2018-10-15 15:35:21,073 INFO L226 Difference]: Without dead ends: 768 [2018-10-15 15:35:21,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5804 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6079, Invalid=12281, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 15:35:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-15 15:35:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 757. [2018-10-15 15:35:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-10-15 15:35:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 758 transitions. [2018-10-15 15:35:21,079 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 758 transitions. Word has length 736 [2018-10-15 15:35:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:21,080 INFO L481 AbstractCegarLoop]: Abstraction has 757 states and 758 transitions. [2018-10-15 15:35:21,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:35:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 758 transitions. [2018-10-15 15:35:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2018-10-15 15:35:21,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:21,084 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:21,084 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash 132132332, now seen corresponding path program 64 times [2018-10-15 15:35:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15441 backedges. 9288 proven. 6153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:24,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 15:35:24,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 15:35:24,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 15:35:24,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=5984, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 15:35:24,067 INFO L87 Difference]: Start difference. First operand 757 states and 758 transitions. Second operand 90 states. [2018-10-15 15:35:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:29,730 INFO L93 Difference]: Finished difference Result 1190 states and 1191 transitions. [2018-10-15 15:35:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 15:35:29,730 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 756 [2018-10-15 15:35:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:29,734 INFO L225 Difference]: With dead ends: 1190 [2018-10-15 15:35:29,734 INFO L226 Difference]: Without dead ends: 767 [2018-10-15 15:35:29,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9680, Invalid=21120, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 15:35:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-10-15 15:35:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2018-10-15 15:35:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-10-15 15:35:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 765 transitions. [2018-10-15 15:35:29,741 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 765 transitions. Word has length 756 [2018-10-15 15:35:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:29,741 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 765 transitions. [2018-10-15 15:35:29,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 15:35:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 765 transitions. [2018-10-15 15:35:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2018-10-15 15:35:29,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:29,745 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:29,745 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1180558950, now seen corresponding path program 65 times [2018-10-15 15:35:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15738 backedges. 9288 proven. 6450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:32,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:32,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:35:32,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:35:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:35:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:35:32,791 INFO L87 Difference]: Start difference. First operand 764 states and 765 transitions. Second operand 91 states. [2018-10-15 15:35:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:38,210 INFO L93 Difference]: Finished difference Result 1207 states and 1208 transitions. [2018-10-15 15:35:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 15:35:38,211 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 763 [2018-10-15 15:35:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:38,214 INFO L225 Difference]: With dead ends: 1207 [2018-10-15 15:35:38,214 INFO L226 Difference]: Without dead ends: 774 [2018-10-15 15:35:38,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10079, Invalid=21783, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:35:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-10-15 15:35:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 771. [2018-10-15 15:35:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-10-15 15:35:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 772 transitions. [2018-10-15 15:35:38,222 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 772 transitions. Word has length 763 [2018-10-15 15:35:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:38,222 INFO L481 AbstractCegarLoop]: Abstraction has 771 states and 772 transitions. [2018-10-15 15:35:38,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:35:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 772 transitions. [2018-10-15 15:35:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2018-10-15 15:35:38,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:38,227 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:38,227 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:38,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1966042964, now seen corresponding path program 66 times [2018-10-15 15:35:38,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16042 backedges. 6754 proven. 9288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:39,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:39,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:35:39,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:35:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:35:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1371, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:35:39,668 INFO L87 Difference]: Start difference. First operand 771 states and 772 transitions. Second operand 51 states. [2018-10-15 15:35:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:42,641 INFO L93 Difference]: Finished difference Result 802 states and 803 transitions. [2018-10-15 15:35:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 15:35:42,641 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 770 [2018-10-15 15:35:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:42,645 INFO L225 Difference]: With dead ends: 802 [2018-10-15 15:35:42,645 INFO L226 Difference]: Without dead ends: 802 [2018-10-15 15:35:42,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6344 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6631, Invalid=13391, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 15:35:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-10-15 15:35:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 791. [2018-10-15 15:35:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-10-15 15:35:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 792 transitions. [2018-10-15 15:35:42,652 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 792 transitions. Word has length 770 [2018-10-15 15:35:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:42,653 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 792 transitions. [2018-10-15 15:35:42,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:35:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 792 transitions. [2018-10-15 15:35:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2018-10-15 15:35:42,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:42,657 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:42,657 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:42,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1727320580, now seen corresponding path program 67 times [2018-10-15 15:35:42,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16924 backedges. 10170 proven. 6754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:46,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-15 15:35:46,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-15 15:35:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-15 15:35:46,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=6532, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 15:35:46,120 INFO L87 Difference]: Start difference. First operand 791 states and 792 transitions. Second operand 94 states. [2018-10-15 15:35:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:52,269 INFO L93 Difference]: Finished difference Result 1244 states and 1245 transitions. [2018-10-15 15:35:52,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 15:35:52,269 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 790 [2018-10-15 15:35:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:52,273 INFO L225 Difference]: With dead ends: 1244 [2018-10-15 15:35:52,273 INFO L226 Difference]: Without dead ends: 801 [2018-10-15 15:35:52,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10580, Invalid=23092, Unknown=0, NotChecked=0, Total=33672 [2018-10-15 15:35:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-15 15:35:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 798. [2018-10-15 15:35:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-10-15 15:35:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 799 transitions. [2018-10-15 15:35:52,282 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 799 transitions. Word has length 790 [2018-10-15 15:35:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:52,282 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 799 transitions. [2018-10-15 15:35:52,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-15 15:35:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 799 transitions. [2018-10-15 15:35:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2018-10-15 15:35:52,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:52,287 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:35:52,287 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:52,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash -983152650, now seen corresponding path program 68 times [2018-10-15 15:35:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 17235 backedges. 10170 proven. 7065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:35:55,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:35:55,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:35:55,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:35:55,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:35:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:35:55,916 INFO L87 Difference]: Start difference. First operand 798 states and 799 transitions. Second operand 95 states. [2018-10-15 15:36:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:02,141 INFO L93 Difference]: Finished difference Result 1261 states and 1262 transitions. [2018-10-15 15:36:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 15:36:02,141 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 797 [2018-10-15 15:36:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:02,145 INFO L225 Difference]: With dead ends: 1261 [2018-10-15 15:36:02,145 INFO L226 Difference]: Without dead ends: 808 [2018-10-15 15:36:02,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10997, Invalid=23785, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:36:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-10-15 15:36:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 805. [2018-10-15 15:36:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2018-10-15 15:36:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 806 transitions. [2018-10-15 15:36:02,151 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 806 transitions. Word has length 797 [2018-10-15 15:36:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:02,152 INFO L481 AbstractCegarLoop]: Abstraction has 805 states and 806 transitions. [2018-10-15 15:36:02,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:36:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 806 transitions. [2018-10-15 15:36:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2018-10-15 15:36:02,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:02,157 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:02,157 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:02,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2079514812, now seen corresponding path program 69 times [2018-10-15 15:36:02,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17553 backedges. 7383 proven. 10170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:03,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:03,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:36:03,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:36:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:36:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1478, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:36:03,791 INFO L87 Difference]: Start difference. First operand 805 states and 806 transitions. Second operand 53 states. [2018-10-15 15:36:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:07,059 INFO L93 Difference]: Finished difference Result 836 states and 837 transitions. [2018-10-15 15:36:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 15:36:07,060 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 804 [2018-10-15 15:36:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:07,064 INFO L225 Difference]: With dead ends: 836 [2018-10-15 15:36:07,065 INFO L226 Difference]: Without dead ends: 836 [2018-10-15 15:36:07,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6908 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7207, Invalid=14549, Unknown=0, NotChecked=0, Total=21756 [2018-10-15 15:36:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-10-15 15:36:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 825. [2018-10-15 15:36:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-10-15 15:36:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 826 transitions. [2018-10-15 15:36:07,074 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 826 transitions. Word has length 804 [2018-10-15 15:36:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:07,075 INFO L481 AbstractCegarLoop]: Abstraction has 825 states and 826 transitions. [2018-10-15 15:36:07,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:36:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 826 transitions. [2018-10-15 15:36:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-10-15 15:36:07,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:07,081 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:07,081 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:07,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 997512716, now seen corresponding path program 70 times [2018-10-15 15:36:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 18475 backedges. 11092 proven. 7383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:10,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:10,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 15:36:10,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 15:36:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 15:36:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2402, Invalid=7104, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 15:36:10,597 INFO L87 Difference]: Start difference. First operand 825 states and 826 transitions. Second operand 98 states. [2018-10-15 15:36:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:16,464 INFO L93 Difference]: Finished difference Result 1298 states and 1299 transitions. [2018-10-15 15:36:16,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:36:16,465 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 824 [2018-10-15 15:36:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:16,469 INFO L225 Difference]: With dead ends: 1298 [2018-10-15 15:36:16,470 INFO L226 Difference]: Without dead ends: 835 [2018-10-15 15:36:16,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11520, Invalid=25152, Unknown=0, NotChecked=0, Total=36672 [2018-10-15 15:36:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-10-15 15:36:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 832. [2018-10-15 15:36:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-10-15 15:36:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 833 transitions. [2018-10-15 15:36:16,479 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 833 transitions. Word has length 824 [2018-10-15 15:36:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:16,479 INFO L481 AbstractCegarLoop]: Abstraction has 832 states and 833 transitions. [2018-10-15 15:36:16,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 15:36:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 833 transitions. [2018-10-15 15:36:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-15 15:36:16,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:16,485 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:16,486 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:16,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash 729084294, now seen corresponding path program 71 times [2018-10-15 15:36:16,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18800 backedges. 11092 proven. 7708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:19,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:19,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:36:19,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:36:19,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:36:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:36:19,977 INFO L87 Difference]: Start difference. First operand 832 states and 833 transitions. Second operand 99 states. [2018-10-15 15:36:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:26,497 INFO L93 Difference]: Finished difference Result 1315 states and 1316 transitions. [2018-10-15 15:36:26,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 15:36:26,497 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 831 [2018-10-15 15:36:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:26,500 INFO L225 Difference]: With dead ends: 1315 [2018-10-15 15:36:26,500 INFO L226 Difference]: Without dead ends: 842 [2018-10-15 15:36:26,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11955, Invalid=25875, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:36:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-10-15 15:36:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 839. [2018-10-15 15:36:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-10-15 15:36:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 840 transitions. [2018-10-15 15:36:26,508 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 840 transitions. Word has length 831 [2018-10-15 15:36:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:26,509 INFO L481 AbstractCegarLoop]: Abstraction has 839 states and 840 transitions. [2018-10-15 15:36:26,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:36:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 840 transitions. [2018-10-15 15:36:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2018-10-15 15:36:26,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:26,516 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:26,516 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:26,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2088753356, now seen corresponding path program 72 times [2018-10-15 15:36:26,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19132 backedges. 8040 proven. 11092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:28,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:36:28,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:36:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:36:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1589, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:36:28,190 INFO L87 Difference]: Start difference. First operand 839 states and 840 transitions. Second operand 55 states. [2018-10-15 15:36:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:31,634 INFO L93 Difference]: Finished difference Result 870 states and 871 transitions. [2018-10-15 15:36:31,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 15:36:31,634 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 838 [2018-10-15 15:36:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:31,636 INFO L225 Difference]: With dead ends: 870 [2018-10-15 15:36:31,637 INFO L226 Difference]: Without dead ends: 870 [2018-10-15 15:36:31,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7496 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7807, Invalid=15755, Unknown=0, NotChecked=0, Total=23562 [2018-10-15 15:36:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-10-15 15:36:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 859. [2018-10-15 15:36:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-10-15 15:36:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 860 transitions. [2018-10-15 15:36:31,645 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 860 transitions. Word has length 838 [2018-10-15 15:36:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:31,646 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 860 transitions. [2018-10-15 15:36:31,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:36:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 860 transitions. [2018-10-15 15:36:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2018-10-15 15:36:31,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:31,651 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:31,651 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:31,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1969563164, now seen corresponding path program 73 times [2018-10-15 15:36:31,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20094 backedges. 12054 proven. 8040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:35,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:35,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 15:36:35,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 15:36:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 15:36:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2602, Invalid=7700, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 15:36:35,434 INFO L87 Difference]: Start difference. First operand 859 states and 860 transitions. Second operand 102 states. [2018-10-15 15:36:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:42,374 INFO L93 Difference]: Finished difference Result 1352 states and 1353 transitions. [2018-10-15 15:36:42,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 15:36:42,374 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 858 [2018-10-15 15:36:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:42,376 INFO L225 Difference]: With dead ends: 1352 [2018-10-15 15:36:42,376 INFO L226 Difference]: Without dead ends: 869 [2018-10-15 15:36:42,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12500, Invalid=27300, Unknown=0, NotChecked=0, Total=39800 [2018-10-15 15:36:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-15 15:36:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 866. [2018-10-15 15:36:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-10-15 15:36:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 867 transitions. [2018-10-15 15:36:42,383 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 867 transitions. Word has length 858 [2018-10-15 15:36:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:42,383 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 867 transitions. [2018-10-15 15:36:42,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 15:36:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 867 transitions. [2018-10-15 15:36:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2018-10-15 15:36:42,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:42,388 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:42,388 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:42,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1156178710, now seen corresponding path program 74 times [2018-10-15 15:36:42,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20433 backedges. 12054 proven. 8379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:46,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:36:46,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:36:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:36:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:36:46,211 INFO L87 Difference]: Start difference. First operand 866 states and 867 transitions. Second operand 103 states. [2018-10-15 15:36:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:53,247 INFO L93 Difference]: Finished difference Result 1369 states and 1370 transitions. [2018-10-15 15:36:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 15:36:53,247 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 865 [2018-10-15 15:36:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:53,249 INFO L225 Difference]: With dead ends: 1369 [2018-10-15 15:36:53,249 INFO L226 Difference]: Without dead ends: 876 [2018-10-15 15:36:53,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12953, Invalid=28053, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:36:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-10-15 15:36:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 873. [2018-10-15 15:36:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-10-15 15:36:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 874 transitions. [2018-10-15 15:36:53,255 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 874 transitions. Word has length 865 [2018-10-15 15:36:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:53,256 INFO L481 AbstractCegarLoop]: Abstraction has 873 states and 874 transitions. [2018-10-15 15:36:53,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:36:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 874 transitions. [2018-10-15 15:36:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2018-10-15 15:36:53,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:53,261 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:53,261 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:53,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2017494820, now seen corresponding path program 75 times [2018-10-15 15:36:53,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:36:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 20779 backedges. 8725 proven. 12054 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:36:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:36:55,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:36:55,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:36:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:36:55,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1704, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:36:55,020 INFO L87 Difference]: Start difference. First operand 873 states and 874 transitions. Second operand 57 states. [2018-10-15 15:36:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:36:58,571 INFO L93 Difference]: Finished difference Result 904 states and 905 transitions. [2018-10-15 15:36:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 15:36:58,571 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 872 [2018-10-15 15:36:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:36:58,573 INFO L225 Difference]: With dead ends: 904 [2018-10-15 15:36:58,573 INFO L226 Difference]: Without dead ends: 904 [2018-10-15 15:36:58,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8108 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8431, Invalid=17009, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 15:36:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-10-15 15:36:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 893. [2018-10-15 15:36:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-10-15 15:36:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 894 transitions. [2018-10-15 15:36:58,579 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 894 transitions. Word has length 872 [2018-10-15 15:36:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:36:58,580 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 894 transitions. [2018-10-15 15:36:58,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:36:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 894 transitions. [2018-10-15 15:36:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2018-10-15 15:36:58,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:36:58,585 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:36:58,585 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:36:58,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:36:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash -836493780, now seen corresponding path program 76 times [2018-10-15 15:36:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:36:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21781 backedges. 13056 proven. 8725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:02,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:02,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-10-15 15:37:02,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-15 15:37:02,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-15 15:37:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2810, Invalid=8320, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 15:37:02,977 INFO L87 Difference]: Start difference. First operand 893 states and 894 transitions. Second operand 106 states. [2018-10-15 15:37:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:10,082 INFO L93 Difference]: Finished difference Result 1406 states and 1407 transitions. [2018-10-15 15:37:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 15:37:10,082 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 892 [2018-10-15 15:37:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:10,085 INFO L225 Difference]: With dead ends: 1406 [2018-10-15 15:37:10,085 INFO L226 Difference]: Without dead ends: 903 [2018-10-15 15:37:10,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13520, Invalid=29536, Unknown=0, NotChecked=0, Total=43056 [2018-10-15 15:37:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-10-15 15:37:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 900. [2018-10-15 15:37:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-10-15 15:37:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 901 transitions. [2018-10-15 15:37:10,093 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 901 transitions. Word has length 892 [2018-10-15 15:37:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:10,093 INFO L481 AbstractCegarLoop]: Abstraction has 900 states and 901 transitions. [2018-10-15 15:37:10,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-15 15:37:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 901 transitions. [2018-10-15 15:37:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2018-10-15 15:37:10,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:10,099 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:10,099 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:10,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:10,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1495604390, now seen corresponding path program 77 times [2018-10-15 15:37:10,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22134 backedges. 13056 proven. 9078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:14,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:14,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:37:14,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:37:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:37:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:37:14,482 INFO L87 Difference]: Start difference. First operand 900 states and 901 transitions. Second operand 107 states. [2018-10-15 15:37:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:22,256 INFO L93 Difference]: Finished difference Result 1423 states and 1424 transitions. [2018-10-15 15:37:22,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 15:37:22,256 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 899 [2018-10-15 15:37:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:22,259 INFO L225 Difference]: With dead ends: 1423 [2018-10-15 15:37:22,259 INFO L226 Difference]: Without dead ends: 910 [2018-10-15 15:37:22,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13991, Invalid=30319, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:37:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-10-15 15:37:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 907. [2018-10-15 15:37:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-10-15 15:37:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 908 transitions. [2018-10-15 15:37:22,267 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 908 transitions. Word has length 899 [2018-10-15 15:37:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:22,267 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 908 transitions. [2018-10-15 15:37:22,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:37:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 908 transitions. [2018-10-15 15:37:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2018-10-15 15:37:22,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:22,276 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:22,276 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:22,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1509540076, now seen corresponding path program 78 times [2018-10-15 15:37:22,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22494 backedges. 9438 proven. 13056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:24,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:24,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:37:24,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:37:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:37:24,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1823, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:37:24,141 INFO L87 Difference]: Start difference. First operand 907 states and 908 transitions. Second operand 59 states. [2018-10-15 15:37:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:28,057 INFO L93 Difference]: Finished difference Result 938 states and 939 transitions. [2018-10-15 15:37:28,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 15:37:28,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 906 [2018-10-15 15:37:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:28,060 INFO L225 Difference]: With dead ends: 938 [2018-10-15 15:37:28,060 INFO L226 Difference]: Without dead ends: 938 [2018-10-15 15:37:28,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8744 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9079, Invalid=18311, Unknown=0, NotChecked=0, Total=27390 [2018-10-15 15:37:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-15 15:37:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 927. [2018-10-15 15:37:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-15 15:37:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 928 transitions. [2018-10-15 15:37:28,067 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 928 transitions. Word has length 906 [2018-10-15 15:37:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:28,067 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 928 transitions. [2018-10-15 15:37:28,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:37:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 928 transitions. [2018-10-15 15:37:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-15 15:37:28,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:28,073 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:28,074 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:28,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash 234470972, now seen corresponding path program 79 times [2018-10-15 15:37:28,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 23536 backedges. 14098 proven. 9438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:32,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:32,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-10-15 15:37:32,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-15 15:37:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-15 15:37:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3026, Invalid=8964, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 15:37:32,498 INFO L87 Difference]: Start difference. First operand 927 states and 928 transitions. Second operand 110 states. [2018-10-15 15:37:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:39,854 INFO L93 Difference]: Finished difference Result 1460 states and 1461 transitions. [2018-10-15 15:37:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 15:37:39,854 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 926 [2018-10-15 15:37:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:39,857 INFO L225 Difference]: With dead ends: 1460 [2018-10-15 15:37:39,857 INFO L226 Difference]: Without dead ends: 937 [2018-10-15 15:37:39,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14580, Invalid=31860, Unknown=0, NotChecked=0, Total=46440 [2018-10-15 15:37:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-15 15:37:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 934. [2018-10-15 15:37:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-10-15 15:37:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 935 transitions. [2018-10-15 15:37:39,866 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 935 transitions. Word has length 926 [2018-10-15 15:37:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:39,866 INFO L481 AbstractCegarLoop]: Abstraction has 934 states and 935 transitions. [2018-10-15 15:37:39,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-15 15:37:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 935 transitions. [2018-10-15 15:37:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2018-10-15 15:37:39,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:39,874 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:39,875 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:39,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash -360276426, now seen corresponding path program 80 times [2018-10-15 15:37:39,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 23903 backedges. 14098 proven. 9805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:44,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:44,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:37:44,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:37:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:37:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:37:44,686 INFO L87 Difference]: Start difference. First operand 934 states and 935 transitions. Second operand 111 states. [2018-10-15 15:37:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:53,113 INFO L93 Difference]: Finished difference Result 1477 states and 1478 transitions. [2018-10-15 15:37:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:37:53,114 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 933 [2018-10-15 15:37:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:53,116 INFO L225 Difference]: With dead ends: 1477 [2018-10-15 15:37:53,116 INFO L226 Difference]: Without dead ends: 944 [2018-10-15 15:37:53,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15069, Invalid=32673, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 15:37:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-10-15 15:37:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 941. [2018-10-15 15:37:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-15 15:37:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 942 transitions. [2018-10-15 15:37:53,123 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 942 transitions. Word has length 933 [2018-10-15 15:37:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:53,123 INFO L481 AbstractCegarLoop]: Abstraction has 941 states and 942 transitions. [2018-10-15 15:37:53,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:37:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 942 transitions. [2018-10-15 15:37:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2018-10-15 15:37:53,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:53,129 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:53,129 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:53,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1334398724, now seen corresponding path program 81 times [2018-10-15 15:37:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:37:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 24277 backedges. 10179 proven. 14098 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:37:55,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:37:55,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:37:55,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:37:55,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:37:55,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1946, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:37:55,195 INFO L87 Difference]: Start difference. First operand 941 states and 942 transitions. Second operand 61 states. [2018-10-15 15:37:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:37:59,256 INFO L93 Difference]: Finished difference Result 972 states and 973 transitions. [2018-10-15 15:37:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 15:37:59,258 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 940 [2018-10-15 15:37:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:37:59,260 INFO L225 Difference]: With dead ends: 972 [2018-10-15 15:37:59,261 INFO L226 Difference]: Without dead ends: 972 [2018-10-15 15:37:59,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9404 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=9751, Invalid=19661, Unknown=0, NotChecked=0, Total=29412 [2018-10-15 15:37:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-10-15 15:37:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 961. [2018-10-15 15:37:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2018-10-15 15:37:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 962 transitions. [2018-10-15 15:37:59,271 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 962 transitions. Word has length 940 [2018-10-15 15:37:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:37:59,272 INFO L481 AbstractCegarLoop]: Abstraction has 961 states and 962 transitions. [2018-10-15 15:37:59,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:37:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 962 transitions. [2018-10-15 15:37:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-15 15:37:59,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:37:59,280 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:37:59,280 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:37:59,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:37:59,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2116945484, now seen corresponding path program 82 times [2018-10-15 15:37:59,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:37:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25359 backedges. 15180 proven. 10179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:04,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 15:38:04,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 15:38:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 15:38:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=9632, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 15:38:04,333 INFO L87 Difference]: Start difference. First operand 961 states and 962 transitions. Second operand 114 states. [2018-10-15 15:38:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:12,183 INFO L93 Difference]: Finished difference Result 1514 states and 1515 transitions. [2018-10-15 15:38:12,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 15:38:12,184 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 960 [2018-10-15 15:38:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:12,186 INFO L225 Difference]: With dead ends: 1514 [2018-10-15 15:38:12,186 INFO L226 Difference]: Without dead ends: 971 [2018-10-15 15:38:12,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15680, Invalid=34272, Unknown=0, NotChecked=0, Total=49952 [2018-10-15 15:38:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-15 15:38:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 968. [2018-10-15 15:38:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-10-15 15:38:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 969 transitions. [2018-10-15 15:38:12,195 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 969 transitions. Word has length 960 [2018-10-15 15:38:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:12,195 INFO L481 AbstractCegarLoop]: Abstraction has 968 states and 969 transitions. [2018-10-15 15:38:12,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 15:38:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 969 transitions. [2018-10-15 15:38:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2018-10-15 15:38:12,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:12,201 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:12,201 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:12,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1986947014, now seen corresponding path program 83 times [2018-10-15 15:38:12,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25740 backedges. 15180 proven. 10560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:17,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:17,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:38:17,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:38:17,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:38:17,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:38:17,279 INFO L87 Difference]: Start difference. First operand 968 states and 969 transitions. Second operand 115 states. [2018-10-15 15:38:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:25,738 INFO L93 Difference]: Finished difference Result 1531 states and 1532 transitions. [2018-10-15 15:38:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 15:38:25,739 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 967 [2018-10-15 15:38:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:25,742 INFO L225 Difference]: With dead ends: 1531 [2018-10-15 15:38:25,742 INFO L226 Difference]: Without dead ends: 978 [2018-10-15 15:38:25,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=16187, Invalid=35115, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 15:38:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-10-15 15:38:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 975. [2018-10-15 15:38:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2018-10-15 15:38:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 976 transitions. [2018-10-15 15:38:25,755 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 976 transitions. Word has length 967 [2018-10-15 15:38:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:25,756 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 976 transitions. [2018-10-15 15:38:25,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:38:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 976 transitions. [2018-10-15 15:38:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2018-10-15 15:38:25,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:25,765 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:25,765 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:25,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1988212468, now seen corresponding path program 84 times [2018-10-15 15:38:25,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26128 backedges. 10948 proven. 15180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:27,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:27,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:38:27,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:38:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:38:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=2073, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:38:27,987 INFO L87 Difference]: Start difference. First operand 975 states and 976 transitions. Second operand 63 states. [2018-10-15 15:38:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:32,323 INFO L93 Difference]: Finished difference Result 1006 states and 1007 transitions. [2018-10-15 15:38:32,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 15:38:32,323 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 974 [2018-10-15 15:38:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:32,326 INFO L225 Difference]: With dead ends: 1006 [2018-10-15 15:38:32,326 INFO L226 Difference]: Without dead ends: 1006 [2018-10-15 15:38:32,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10088 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=10447, Invalid=21059, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 15:38:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-15 15:38:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 995. [2018-10-15 15:38:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-15 15:38:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 996 transitions. [2018-10-15 15:38:32,338 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 996 transitions. Word has length 974 [2018-10-15 15:38:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:32,338 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 996 transitions. [2018-10-15 15:38:32,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:38:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 996 transitions. [2018-10-15 15:38:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-10-15 15:38:32,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:32,347 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:32,347 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 688453212, now seen corresponding path program 85 times [2018-10-15 15:38:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27250 backedges. 16302 proven. 10948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:37,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:37,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 15:38:37,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 15:38:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 15:38:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3482, Invalid=10324, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 15:38:37,799 INFO L87 Difference]: Start difference. First operand 995 states and 996 transitions. Second operand 118 states. [2018-10-15 15:38:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:38:46,368 INFO L93 Difference]: Finished difference Result 1568 states and 1569 transitions. [2018-10-15 15:38:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 15:38:46,369 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 994 [2018-10-15 15:38:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:38:46,371 INFO L225 Difference]: With dead ends: 1568 [2018-10-15 15:38:46,371 INFO L226 Difference]: Without dead ends: 1005 [2018-10-15 15:38:46,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6553 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=16820, Invalid=36772, Unknown=0, NotChecked=0, Total=53592 [2018-10-15 15:38:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-10-15 15:38:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1002. [2018-10-15 15:38:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2018-10-15 15:38:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1003 transitions. [2018-10-15 15:38:46,381 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1003 transitions. Word has length 994 [2018-10-15 15:38:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:38:46,381 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 1003 transitions. [2018-10-15 15:38:46,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 15:38:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1003 transitions. [2018-10-15 15:38:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-10-15 15:38:46,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:38:46,391 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:38:46,391 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:38:46,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:38:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash 893155670, now seen corresponding path program 86 times [2018-10-15 15:38:46,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:38:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:38:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27645 backedges. 16302 proven. 11343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:38:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:38:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:38:51,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:38:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:38:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:38:51,830 INFO L87 Difference]: Start difference. First operand 1002 states and 1003 transitions. Second operand 119 states. [2018-10-15 15:39:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:01,582 INFO L93 Difference]: Finished difference Result 1585 states and 1586 transitions. [2018-10-15 15:39:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 15:39:01,582 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1001 [2018-10-15 15:39:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:01,583 INFO L225 Difference]: With dead ends: 1585 [2018-10-15 15:39:01,583 INFO L226 Difference]: Without dead ends: 1012 [2018-10-15 15:39:01,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=17345, Invalid=37645, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 15:39:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2018-10-15 15:39:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1009. [2018-10-15 15:39:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-10-15 15:39:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1010 transitions. [2018-10-15 15:39:01,590 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1010 transitions. Word has length 1001 [2018-10-15 15:39:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:01,591 INFO L481 AbstractCegarLoop]: Abstraction has 1009 states and 1010 transitions. [2018-10-15 15:39:01,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:39:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1010 transitions. [2018-10-15 15:39:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1009 [2018-10-15 15:39:01,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:01,597 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:01,597 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:01,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:01,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1683523868, now seen corresponding path program 87 times [2018-10-15 15:39:01,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 28047 backedges. 11745 proven. 16302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:03,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:03,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:39:03,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:39:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:39:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2204, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:39:03,923 INFO L87 Difference]: Start difference. First operand 1009 states and 1010 transitions. Second operand 65 states. [2018-10-15 15:39:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:08,457 INFO L93 Difference]: Finished difference Result 1040 states and 1041 transitions. [2018-10-15 15:39:08,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 15:39:08,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1008 [2018-10-15 15:39:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:08,459 INFO L225 Difference]: With dead ends: 1040 [2018-10-15 15:39:08,459 INFO L226 Difference]: Without dead ends: 1040 [2018-10-15 15:39:08,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10796 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=11167, Invalid=22505, Unknown=0, NotChecked=0, Total=33672 [2018-10-15 15:39:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-10-15 15:39:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1029. [2018-10-15 15:39:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-10-15 15:39:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1030 transitions. [2018-10-15 15:39:08,470 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1030 transitions. Word has length 1008 [2018-10-15 15:39:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:08,471 INFO L481 AbstractCegarLoop]: Abstraction has 1029 states and 1030 transitions. [2018-10-15 15:39:08,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:39:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1030 transitions. [2018-10-15 15:39:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2018-10-15 15:39:08,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:08,481 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:08,481 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:08,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 433229420, now seen corresponding path program 88 times [2018-10-15 15:39:08,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29209 backedges. 17464 proven. 11745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:14,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:14,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 15:39:14,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 15:39:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 15:39:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3722, Invalid=11040, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 15:39:14,120 INFO L87 Difference]: Start difference. First operand 1029 states and 1030 transitions. Second operand 122 states. [2018-10-15 15:39:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:23,951 INFO L93 Difference]: Finished difference Result 1622 states and 1623 transitions. [2018-10-15 15:39:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 15:39:23,951 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 1028 [2018-10-15 15:39:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:23,953 INFO L225 Difference]: With dead ends: 1622 [2018-10-15 15:39:23,953 INFO L226 Difference]: Without dead ends: 1039 [2018-10-15 15:39:23,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7019 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=18000, Invalid=39360, Unknown=0, NotChecked=0, Total=57360 [2018-10-15 15:39:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-10-15 15:39:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1036. [2018-10-15 15:39:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-10-15 15:39:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1037 transitions. [2018-10-15 15:39:23,962 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1037 transitions. Word has length 1028 [2018-10-15 15:39:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:23,962 INFO L481 AbstractCegarLoop]: Abstraction has 1036 states and 1037 transitions. [2018-10-15 15:39:23,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 15:39:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1037 transitions. [2018-10-15 15:39:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-10-15 15:39:23,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:23,969 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:23,969 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:23,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:23,970 INFO L82 PathProgramCache]: Analyzing trace with hash -632237338, now seen corresponding path program 89 times [2018-10-15 15:39:23,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 29618 backedges. 17464 proven. 12154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:29,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:29,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:39:29,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:39:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:39:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:39:29,616 INFO L87 Difference]: Start difference. First operand 1036 states and 1037 transitions. Second operand 123 states. [2018-10-15 15:39:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:38,705 INFO L93 Difference]: Finished difference Result 1639 states and 1640 transitions. [2018-10-15 15:39:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 15:39:38,705 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 1035 [2018-10-15 15:39:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:38,707 INFO L225 Difference]: With dead ends: 1639 [2018-10-15 15:39:38,707 INFO L226 Difference]: Without dead ends: 1046 [2018-10-15 15:39:38,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18543, Invalid=40263, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 15:39:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2018-10-15 15:39:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1043. [2018-10-15 15:39:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-10-15 15:39:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1044 transitions. [2018-10-15 15:39:38,716 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1044 transitions. Word has length 1035 [2018-10-15 15:39:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:38,716 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1044 transitions. [2018-10-15 15:39:38,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:39:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1044 transitions. [2018-10-15 15:39:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2018-10-15 15:39:38,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:38,723 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:38,723 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:38,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2125631188, now seen corresponding path program 90 times [2018-10-15 15:39:38,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30034 backedges. 12570 proven. 17464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:41,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:41,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:39:41,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:39:41,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:39:41,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2339, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:39:41,466 INFO L87 Difference]: Start difference. First operand 1043 states and 1044 transitions. Second operand 67 states. [2018-10-15 15:39:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:39:46,583 INFO L93 Difference]: Finished difference Result 1074 states and 1075 transitions. [2018-10-15 15:39:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 15:39:46,584 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1042 [2018-10-15 15:39:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:39:46,585 INFO L225 Difference]: With dead ends: 1074 [2018-10-15 15:39:46,585 INFO L226 Difference]: Without dead ends: 1074 [2018-10-15 15:39:46,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11528 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11911, Invalid=23999, Unknown=0, NotChecked=0, Total=35910 [2018-10-15 15:39:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2018-10-15 15:39:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1063. [2018-10-15 15:39:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-10-15 15:39:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1064 transitions. [2018-10-15 15:39:46,591 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1064 transitions. Word has length 1042 [2018-10-15 15:39:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:39:46,592 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1064 transitions. [2018-10-15 15:39:46,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:39:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1064 transitions. [2018-10-15 15:39:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-10-15 15:39:46,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:39:46,599 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:39:46,600 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:39:46,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:39:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1663906180, now seen corresponding path program 91 times [2018-10-15 15:39:46,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:39:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:39:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 31236 backedges. 18666 proven. 12570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:39:52,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:39:52,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 15:39:52,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 15:39:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 15:39:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3970, Invalid=11780, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 15:39:52,512 INFO L87 Difference]: Start difference. First operand 1063 states and 1064 transitions. Second operand 126 states. [2018-10-15 15:40:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:03,079 INFO L93 Difference]: Finished difference Result 1676 states and 1677 transitions. [2018-10-15 15:40:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:40:03,080 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 1062 [2018-10-15 15:40:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:03,081 INFO L225 Difference]: With dead ends: 1676 [2018-10-15 15:40:03,081 INFO L226 Difference]: Without dead ends: 1073 [2018-10-15 15:40:03,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7501 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19220, Invalid=42036, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 15:40:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-10-15 15:40:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1070. [2018-10-15 15:40:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2018-10-15 15:40:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1071 transitions. [2018-10-15 15:40:03,088 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1071 transitions. Word has length 1062 [2018-10-15 15:40:03,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:03,089 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1071 transitions. [2018-10-15 15:40:03,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 15:40:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1071 transitions. [2018-10-15 15:40:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1070 [2018-10-15 15:40:03,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:03,096 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:03,096 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:03,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1410036854, now seen corresponding path program 92 times [2018-10-15 15:40:03,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31659 backedges. 18666 proven. 12993 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:09,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:09,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:40:09,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:40:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:40:09,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4033, Invalid=11969, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:40:09,101 INFO L87 Difference]: Start difference. First operand 1070 states and 1071 transitions. Second operand 127 states. [2018-10-15 15:40:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:40:20,108 INFO L93 Difference]: Finished difference Result 1693 states and 1694 transitions. [2018-10-15 15:40:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 15:40:20,109 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 1069 [2018-10-15 15:40:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:40:20,110 INFO L225 Difference]: With dead ends: 1693 [2018-10-15 15:40:20,110 INFO L226 Difference]: Without dead ends: 1080 [2018-10-15 15:40:20,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19781, Invalid=42969, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:40:20,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-10-15 15:40:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1077. [2018-10-15 15:40:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2018-10-15 15:40:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1078 transitions. [2018-10-15 15:40:20,119 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1078 transitions. Word has length 1069 [2018-10-15 15:40:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:40:20,119 INFO L481 AbstractCegarLoop]: Abstraction has 1077 states and 1078 transitions. [2018-10-15 15:40:20,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:40:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1078 transitions. [2018-10-15 15:40:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2018-10-15 15:40:20,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:40:20,127 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:40:20,128 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:40:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:40:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash 564461884, now seen corresponding path program 93 times [2018-10-15 15:40:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:40:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:40:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32089 backedges. 13423 proven. 18666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:40:23,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:40:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:40:23,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:40:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:40:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2478, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:40:23,016 INFO L87 Difference]: Start difference. First operand 1077 states and 1078 transitions. Second operand 69 states.