java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:13:46,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:13:46,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:13:46,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:13:46,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:13:46,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:13:46,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:13:46,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:13:46,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:13:46,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:13:46,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:13:46,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:13:46,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:13:46,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:13:46,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:13:46,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:13:46,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:13:46,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:13:46,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:13:46,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:13:46,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:13:46,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:13:46,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:13:46,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:13:46,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:13:46,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:13:46,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:13:46,085 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:13:46,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:13:46,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:13:46,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:13:46,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:13:46,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:13:46,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:13:46,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:13:46,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:13:46,091 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:13:46,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:13:46,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:13:46,106 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:13:46,106 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:13:46,106 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:13:46,106 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:13:46,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:13:46,107 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:13:46,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:13:46,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:13:46,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:13:46,109 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:13:46,109 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:13:46,113 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:13:46,113 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:13:46,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:13:46,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:13:46,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:13:46,205 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:13:46,205 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:13:46,206 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_5.bpl [2018-10-15 13:13:46,206 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/string_concat-noarr_true-unreach-call_true-termination.i_5.bpl' [2018-10-15 13:13:46,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:13:46,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:13:46,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:13:46,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:13:46,271 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:13:46,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:13:46,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:13:46,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:13:46,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:13:46,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:13:46,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:13:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:13:46,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:13:46,759 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:13:46,759 INFO L202 PluginConnector]: Adding new model string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:46 BoogieIcfgContainer [2018-10-15 13:13:46,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:13:46,760 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:13:46,760 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:13:46,761 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:13:46,765 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:46" (1/1) ... [2018-10-15 13:13:46,770 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:13:46,787 INFO L202 PluginConnector]: Adding new model string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:46 BasicIcfg [2018-10-15 13:13:46,788 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:13:46,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:13:46,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:13:46,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:13:46,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:46" (1/3) ... [2018-10-15 13:13:46,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3913f393 and model type string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:13:46, skipping insertion in model container [2018-10-15 13:13:46,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:46" (2/3) ... [2018-10-15 13:13:46,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3913f393 and model type string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:13:46, skipping insertion in model container [2018-10-15 13:13:46,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string_concat-noarr_true-unreach-call_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:46" (3/3) ... [2018-10-15 13:13:46,797 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i_5.bplleft_unchanged_by_heapseparator [2018-10-15 13:13:46,807 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:13:46,817 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:13:46,835 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:13:46,865 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:13:46,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:13:46,867 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:13:46,867 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:13:46,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:13:46,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:13:46,868 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:13:46,868 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:13:46,868 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:13:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-15 13:13:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 13:13:46,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:46,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:46,896 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:46,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1395307045, now seen corresponding path program 1 times [2018-10-15 13:13:46,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:47,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:13:47,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 13:13:47,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:13:47,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:13:47,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:13:47,226 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-10-15 13:13:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:47,473 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-10-15 13:13:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:13:47,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 13:13:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:47,488 INFO L225 Difference]: With dead ends: 50 [2018-10-15 13:13:47,488 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:13:47,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:13:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-10-15 13:13:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:13:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-10-15 13:13:47,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-10-15 13:13:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:47,536 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-10-15 13:13:47,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:13:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-10-15 13:13:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 13:13:47,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:47,538 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:47,538 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:47,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash 288605089, now seen corresponding path program 1 times [2018-10-15 13:13:47,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 13:13:47,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:13:47,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 13:13:47,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:13:47,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:13:47,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:13:47,706 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-10-15 13:13:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:48,018 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-10-15 13:13:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:13:48,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-15 13:13:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:48,021 INFO L225 Difference]: With dead ends: 52 [2018-10-15 13:13:48,021 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 13:13:48,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 13:13:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2018-10-15 13:13:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 13:13:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-15 13:13:48,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 25 [2018-10-15 13:13:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:48,028 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-15 13:13:48,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:13:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-15 13:13:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:13:48,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:48,030 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 13:13:48,030 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:48,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1243069671, now seen corresponding path program 1 times [2018-10-15 13:13:48,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:48,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:48,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:13:48,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:13:48,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:13:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:48,172 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 7 states. [2018-10-15 13:13:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:48,433 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-10-15 13:13:48,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:13:48,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-10-15 13:13:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:48,436 INFO L225 Difference]: With dead ends: 61 [2018-10-15 13:13:48,436 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 13:13:48,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 13:13:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-10-15 13:13:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:13:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-15 13:13:48,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 28 [2018-10-15 13:13:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:48,445 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-15 13:13:48,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:13:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-15 13:13:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 13:13:48,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:48,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:48,447 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:48,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1895458273, now seen corresponding path program 1 times [2018-10-15 13:13:48,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:48,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:48,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:13:48,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:13:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:13:48,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:13:48,667 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 9 states. [2018-10-15 13:13:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:49,181 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-10-15 13:13:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:13:49,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-10-15 13:13:49,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:49,187 INFO L225 Difference]: With dead ends: 81 [2018-10-15 13:13:49,188 INFO L226 Difference]: Without dead ends: 75 [2018-10-15 13:13:49,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:13:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-15 13:13:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2018-10-15 13:13:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:13:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-15 13:13:49,195 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 34 [2018-10-15 13:13:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:49,196 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-15 13:13:49,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:13:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-10-15 13:13:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 13:13:49,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:49,198 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-15 13:13:49,198 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:49,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:49,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1030522021, now seen corresponding path program 2 times [2018-10-15 13:13:49,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:49,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:49,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:13:49,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:13:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:13:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:13:49,313 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 9 states. [2018-10-15 13:13:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:49,579 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-10-15 13:13:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:13:49,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-10-15 13:13:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:49,582 INFO L225 Difference]: With dead ends: 85 [2018-10-15 13:13:49,583 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 13:13:49,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 13:13:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-10-15 13:13:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 13:13:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-10-15 13:13:49,592 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 37 [2018-10-15 13:13:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:49,592 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-10-15 13:13:49,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:13:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-10-15 13:13:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:13:49,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:49,594 INFO L375 BasicCegarLoop]: trace histogram [3, 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 13:13:49,595 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:49,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:49,595 INFO L82 PathProgramCache]: Analyzing trace with hash 638905179, now seen corresponding path program 2 times [2018-10-15 13:13:49,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-15 13:13:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:13:49,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:13:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:13:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:49,683 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 7 states. [2018-10-15 13:13:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:50,242 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-10-15 13:13:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:13:50,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-10-15 13:13:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:50,244 INFO L225 Difference]: With dead ends: 96 [2018-10-15 13:13:50,244 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 13:13:50,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 13:13:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2018-10-15 13:13:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 13:13:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-10-15 13:13:50,251 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 40 [2018-10-15 13:13:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:50,251 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-10-15 13:13:50,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:13:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-10-15 13:13:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-15 13:13:50,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:50,253 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-15 13:13:50,254 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:50,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -68793439, now seen corresponding path program 3 times [2018-10-15 13:13:50,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:13:50,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:13:50,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:13:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:50,442 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-10-15 13:13:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:50,796 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-10-15 13:13:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:13:50,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-10-15 13:13:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:50,798 INFO L225 Difference]: With dead ends: 108 [2018-10-15 13:13:50,798 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 13:13:50,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:13:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 13:13:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2018-10-15 13:13:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 13:13:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-10-15 13:13:50,806 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 43 [2018-10-15 13:13:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:50,806 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-10-15 13:13:50,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:13:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-10-15 13:13:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:13:50,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:50,808 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-10-15 13:13:50,809 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:50,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -676020377, now seen corresponding path program 3 times [2018-10-15 13:13:50,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:13:50,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:13:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:13:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:50,953 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 11 states. [2018-10-15 13:13:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:51,210 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-10-15 13:13:51,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:13:51,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-10-15 13:13:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:51,212 INFO L225 Difference]: With dead ends: 103 [2018-10-15 13:13:51,212 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 13:13:51,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:13:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 13:13:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-10-15 13:13:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 13:13:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-10-15 13:13:51,219 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 46 [2018-10-15 13:13:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:51,220 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-10-15 13:13:51,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:13:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-10-15 13:13:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 13:13:51,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:51,222 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:51,222 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:51,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash -154054809, now seen corresponding path program 4 times [2018-10-15 13:13:51,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:51,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:51,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:13:51,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:13:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:13:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:51,402 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 13 states. [2018-10-15 13:13:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:51,749 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2018-10-15 13:13:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:13:51,749 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-10-15 13:13:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:51,751 INFO L225 Difference]: With dead ends: 140 [2018-10-15 13:13:51,751 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:13:51,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:13:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:13:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2018-10-15 13:13:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 13:13:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-10-15 13:13:51,758 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 49 [2018-10-15 13:13:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:51,758 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-10-15 13:13:51,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:13:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-10-15 13:13:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 13:13:51,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:51,760 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:51,761 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:51,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1923145185, now seen corresponding path program 5 times [2018-10-15 13:13:51,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:13:51,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:13:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:13:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:51,905 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-10-15 13:13:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:52,316 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-10-15 13:13:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:13:52,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-15 13:13:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:52,319 INFO L225 Difference]: With dead ends: 141 [2018-10-15 13:13:52,319 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 13:13:52,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:13:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 13:13:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2018-10-15 13:13:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 13:13:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-10-15 13:13:52,327 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 52 [2018-10-15 13:13:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:52,328 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-10-15 13:13:52,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:13:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-10-15 13:13:52,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:13:52,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:52,329 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:52,329 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:52,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash -315537189, now seen corresponding path program 4 times [2018-10-15 13:13:52,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:52,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:52,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:13:52,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:13:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:13:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:52,463 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-10-15 13:13:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:52,884 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-10-15 13:13:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:13:52,885 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-10-15 13:13:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:52,886 INFO L225 Difference]: With dead ends: 130 [2018-10-15 13:13:52,886 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:13:52,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:13:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:13:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 92. [2018-10-15 13:13:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 13:13:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-10-15 13:13:52,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 55 [2018-10-15 13:13:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:52,893 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-10-15 13:13:52,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:13:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-10-15 13:13:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 13:13:52,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:52,895 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 13:13:52,895 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:52,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1916790445, now seen corresponding path program 6 times [2018-10-15 13:13:52,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:53,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:53,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:13:53,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:13:53,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:13:53,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:53,343 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 15 states. [2018-10-15 13:13:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:53,883 INFO L93 Difference]: Finished difference Result 176 states and 181 transitions. [2018-10-15 13:13:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:13:53,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-10-15 13:13:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:53,885 INFO L225 Difference]: With dead ends: 176 [2018-10-15 13:13:53,885 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 13:13:53,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:13:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 13:13:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 98. [2018-10-15 13:13:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 13:13:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-10-15 13:13:53,891 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 55 [2018-10-15 13:13:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:53,891 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-10-15 13:13:53,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:13:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-10-15 13:13:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 13:13:53,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:53,893 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-10-15 13:13:53,893 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:53,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1563867355, now seen corresponding path program 7 times [2018-10-15 13:13:53,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:54,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:54,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:13:54,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:13:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:13:54,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:54,072 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 15 states. [2018-10-15 13:13:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:54,356 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2018-10-15 13:13:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:13:54,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-15 13:13:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:54,359 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:13:54,359 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 13:13:54,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:13:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 13:13:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 98. [2018-10-15 13:13:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 13:13:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-10-15 13:13:54,364 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 58 [2018-10-15 13:13:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:54,364 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-10-15 13:13:54,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:13:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-10-15 13:13:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 13:13:54,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:54,366 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:54,366 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:54,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash -502869087, now seen corresponding path program 8 times [2018-10-15 13:13:54,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:54,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:54,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:13:54,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:13:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:13:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:54,641 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 15 states. [2018-10-15 13:13:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:54,944 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2018-10-15 13:13:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:13:54,944 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-10-15 13:13:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:54,946 INFO L225 Difference]: With dead ends: 177 [2018-10-15 13:13:54,946 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 13:13:54,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:13:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 13:13:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2018-10-15 13:13:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 13:13:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-10-15 13:13:54,951 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 61 [2018-10-15 13:13:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:54,951 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-10-15 13:13:54,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:13:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-10-15 13:13:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 13:13:54,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:54,953 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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] [2018-10-15 13:13:54,953 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:54,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1729458547, now seen corresponding path program 9 times [2018-10-15 13:13:54,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:55,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:55,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:13:55,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:13:55,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:13:55,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:55,138 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 17 states. [2018-10-15 13:13:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:55,971 INFO L93 Difference]: Finished difference Result 190 states and 196 transitions. [2018-10-15 13:13:55,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:13:55,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-15 13:13:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:55,973 INFO L225 Difference]: With dead ends: 190 [2018-10-15 13:13:55,973 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:13:55,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:13:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 104. [2018-10-15 13:13:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 13:13:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-10-15 13:13:55,978 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 61 [2018-10-15 13:13:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:55,979 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-10-15 13:13:55,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:13:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-10-15 13:13:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:13:55,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:55,982 INFO L375 BasicCegarLoop]: trace histogram [6, 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] [2018-10-15 13:13:55,982 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:55,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1107698151, now seen corresponding path program 5 times [2018-10-15 13:13:55,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:56,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:56,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:13:56,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:13:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:13:56,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:56,763 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 15 states. [2018-10-15 13:13:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:57,012 INFO L93 Difference]: Finished difference Result 163 states and 169 transitions. [2018-10-15 13:13:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:13:57,013 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-10-15 13:13:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:57,014 INFO L225 Difference]: With dead ends: 163 [2018-10-15 13:13:57,015 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 13:13:57,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:13:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 13:13:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-10-15 13:13:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 13:13:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-10-15 13:13:57,019 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 64 [2018-10-15 13:13:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:57,019 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-10-15 13:13:57,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:13:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-10-15 13:13:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:13:57,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:57,020 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:57,021 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:57,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash -78188459, now seen corresponding path program 10 times [2018-10-15 13:13:57,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:57,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:13:57,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:13:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:13:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:57,408 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 17 states. [2018-10-15 13:13:57,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:57,710 INFO L93 Difference]: Finished difference Result 223 states and 229 transitions. [2018-10-15 13:13:57,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:13:57,710 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-10-15 13:13:57,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:57,713 INFO L225 Difference]: With dead ends: 223 [2018-10-15 13:13:57,713 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 13:13:57,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:13:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 13:13:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 116. [2018-10-15 13:13:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 13:13:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-10-15 13:13:57,718 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 64 [2018-10-15 13:13:57,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:57,718 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-10-15 13:13:57,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:13:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-10-15 13:13:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 13:13:57,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:57,719 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:57,720 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:57,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:57,720 INFO L82 PathProgramCache]: Analyzing trace with hash 689877479, now seen corresponding path program 11 times [2018-10-15 13:13:57,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:57,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:13:57,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:13:57,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:13:57,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:57,937 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 17 states. [2018-10-15 13:13:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:58,519 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-10-15 13:13:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:13:58,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-10-15 13:13:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:58,521 INFO L225 Difference]: With dead ends: 227 [2018-10-15 13:13:58,521 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 13:13:58,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:13:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 13:13:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 116. [2018-10-15 13:13:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 13:13:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-10-15 13:13:58,526 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 67 [2018-10-15 13:13:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:58,526 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-10-15 13:13:58,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:13:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-10-15 13:13:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 13:13:58,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:58,527 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 3, 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] [2018-10-15 13:13:58,527 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:58,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1372762183, now seen corresponding path program 12 times [2018-10-15 13:13:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:58,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:58,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:13:58,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:13:58,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:13:58,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:13:58,704 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 19 states. [2018-10-15 13:13:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,180 INFO L93 Difference]: Finished difference Result 231 states and 238 transitions. [2018-10-15 13:13:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:13:59,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-10-15 13:13:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,183 INFO L225 Difference]: With dead ends: 231 [2018-10-15 13:13:59,183 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 13:13:59,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1218, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:13:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 13:13:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 122. [2018-10-15 13:13:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 13:13:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-10-15 13:13:59,188 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 67 [2018-10-15 13:13:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,189 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-10-15 13:13:59,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:13:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-10-15 13:13:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:13:59,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,190 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:59,190 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1956206049, now seen corresponding path program 13 times [2018-10-15 13:13:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:13:59,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:13:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:13:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:59,354 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 17 states. [2018-10-15 13:14:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:00,703 INFO L93 Difference]: Finished difference Result 219 states and 226 transitions. [2018-10-15 13:14:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:14:00,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-10-15 13:14:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:00,706 INFO L225 Difference]: With dead ends: 219 [2018-10-15 13:14:00,706 INFO L226 Difference]: Without dead ends: 213 [2018-10-15 13:14:00,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:14:00,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-15 13:14:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 122. [2018-10-15 13:14:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 13:14:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-10-15 13:14:00,709 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 70 [2018-10-15 13:14:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:00,710 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-10-15 13:14:00,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:14:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-10-15 13:14:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:14:00,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:00,711 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2018-10-15 13:14:00,711 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:00,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:00,711 INFO L82 PathProgramCache]: Analyzing trace with hash 770319439, now seen corresponding path program 14 times [2018-10-15 13:14:00,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:00,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:00,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:14:00,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:14:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:14:00,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:00,977 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 19 states. [2018-10-15 13:14:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:01,412 INFO L93 Difference]: Finished difference Result 237 states and 244 transitions. [2018-10-15 13:14:01,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:14:01,412 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-10-15 13:14:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:01,414 INFO L225 Difference]: With dead ends: 237 [2018-10-15 13:14:01,414 INFO L226 Difference]: Without dead ends: 231 [2018-10-15 13:14:01,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1158, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:14:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-15 13:14:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 122. [2018-10-15 13:14:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 13:14:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-10-15 13:14:01,419 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 70 [2018-10-15 13:14:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:01,419 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-10-15 13:14:01,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:14:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-10-15 13:14:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 13:14:01,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:01,420 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:01,421 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:01,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash -804866469, now seen corresponding path program 6 times [2018-10-15 13:14:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:14:01,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:14:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:14:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:14:01,595 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 17 states. [2018-10-15 13:14:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:01,932 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2018-10-15 13:14:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:14:01,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-10-15 13:14:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:01,936 INFO L225 Difference]: With dead ends: 190 [2018-10-15 13:14:01,936 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:14:01,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:14:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 134. [2018-10-15 13:14:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 13:14:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-10-15 13:14:01,940 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 73 [2018-10-15 13:14:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:01,940 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-10-15 13:14:01,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:14:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-10-15 13:14:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 13:14:01,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:01,942 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-10-15 13:14:01,942 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:01,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1588837459, now seen corresponding path program 15 times [2018-10-15 13:14:01,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:02,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:02,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:14:02,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:14:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:14:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:02,103 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 19 states. [2018-10-15 13:14:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:03,512 INFO L93 Difference]: Finished difference Result 277 states and 284 transitions. [2018-10-15 13:14:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:14:03,513 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-10-15 13:14:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:03,514 INFO L225 Difference]: With dead ends: 277 [2018-10-15 13:14:03,514 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 13:14:03,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=314, Invalid=1092, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:14:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 13:14:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 134. [2018-10-15 13:14:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 13:14:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-10-15 13:14:03,519 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 73 [2018-10-15 13:14:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:03,519 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-10-15 13:14:03,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:14:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-10-15 13:14:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 13:14:03,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:03,520 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 3, 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] [2018-10-15 13:14:03,520 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:03,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 643490175, now seen corresponding path program 16 times [2018-10-15 13:14:03,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:03,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:03,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:03,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:03,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:03,906 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 21 states. [2018-10-15 13:14:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:04,391 INFO L93 Difference]: Finished difference Result 272 states and 280 transitions. [2018-10-15 13:14:04,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:14:04,391 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2018-10-15 13:14:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:04,393 INFO L225 Difference]: With dead ends: 272 [2018-10-15 13:14:04,393 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 13:14:04,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:14:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 13:14:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 140. [2018-10-15 13:14:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:14:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 13:14:04,398 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 73 [2018-10-15 13:14:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:04,398 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 13:14:04,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 13:14:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 13:14:04,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:04,399 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:04,400 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:04,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1282398629, now seen corresponding path program 17 times [2018-10-15 13:14:04,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:04,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:04,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:14:04,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:14:04,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:14:04,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:04,797 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 19 states. [2018-10-15 13:14:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:05,367 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2018-10-15 13:14:05,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:14:05,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-10-15 13:14:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:05,369 INFO L225 Difference]: With dead ends: 278 [2018-10-15 13:14:05,370 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 13:14:05,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:14:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 13:14:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 140. [2018-10-15 13:14:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:14:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 13:14:05,374 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 76 [2018-10-15 13:14:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:05,375 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 13:14:05,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:14:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 13:14:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 13:14:05,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:05,376 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 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] [2018-10-15 13:14:05,376 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:05,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1826682057, now seen corresponding path program 18 times [2018-10-15 13:14:05,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:05,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:05,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:05,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:05,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:05,926 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 21 states. [2018-10-15 13:14:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:06,552 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2018-10-15 13:14:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 13:14:06,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-10-15 13:14:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:06,554 INFO L225 Difference]: With dead ends: 282 [2018-10-15 13:14:06,554 INFO L226 Difference]: Without dead ends: 276 [2018-10-15 13:14:06,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=1480, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:14:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-15 13:14:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 140. [2018-10-15 13:14:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:14:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 13:14:06,559 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 76 [2018-10-15 13:14:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:06,559 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 13:14:06,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 13:14:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 13:14:06,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:06,560 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:06,560 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:06,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash 68508577, now seen corresponding path program 19 times [2018-10-15 13:14:06,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:07,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:07,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:14:07,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:14:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:14:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:07,075 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 19 states. [2018-10-15 13:14:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:07,363 INFO L93 Difference]: Finished difference Result 255 states and 263 transitions. [2018-10-15 13:14:07,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:14:07,364 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-10-15 13:14:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:07,366 INFO L225 Difference]: With dead ends: 255 [2018-10-15 13:14:07,366 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 13:14:07,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:14:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 13:14:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 140. [2018-10-15 13:14:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:14:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 13:14:07,370 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 79 [2018-10-15 13:14:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:07,371 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 13:14:07,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:14:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 13:14:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 13:14:07,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:07,372 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:07,372 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:07,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash -715462413, now seen corresponding path program 20 times [2018-10-15 13:14:07,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:07,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:07,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:07,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:07,595 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 21 states. [2018-10-15 13:14:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:08,011 INFO L93 Difference]: Finished difference Result 291 states and 299 transitions. [2018-10-15 13:14:08,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:14:08,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-10-15 13:14:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:08,013 INFO L225 Difference]: With dead ends: 291 [2018-10-15 13:14:08,013 INFO L226 Difference]: Without dead ends: 285 [2018-10-15 13:14:08,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:14:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-15 13:14:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 140. [2018-10-15 13:14:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 13:14:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-10-15 13:14:08,018 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 79 [2018-10-15 13:14:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:08,018 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-10-15 13:14:08,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-10-15 13:14:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 13:14:08,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:08,019 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 3, 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] [2018-10-15 13:14:08,020 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1516865221, now seen corresponding path program 21 times [2018-10-15 13:14:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:09,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:09,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:09,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:09,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:09,047 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 23 states. [2018-10-15 13:14:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:09,688 INFO L93 Difference]: Finished difference Result 286 states and 295 transitions. [2018-10-15 13:14:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:14:09,688 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-10-15 13:14:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:09,690 INFO L225 Difference]: With dead ends: 286 [2018-10-15 13:14:09,690 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 13:14:09,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=540, Invalid=1910, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:14:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 13:14:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 146. [2018-10-15 13:14:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 13:14:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-10-15 13:14:09,695 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 79 [2018-10-15 13:14:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:09,695 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-10-15 13:14:09,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-10-15 13:14:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:14:09,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:09,696 INFO L375 BasicCegarLoop]: trace histogram [8, 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] [2018-10-15 13:14:09,697 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:09,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash 682878055, now seen corresponding path program 7 times [2018-10-15 13:14:09,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:09,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:09,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:14:09,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:14:09,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:14:09,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:14:09,998 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 19 states. [2018-10-15 13:14:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:11,937 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-10-15 13:14:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:14:11,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-10-15 13:14:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:11,939 INFO L225 Difference]: With dead ends: 223 [2018-10-15 13:14:11,939 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 13:14:11,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:14:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 13:14:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 158. [2018-10-15 13:14:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:14:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 13:14:11,943 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 82 [2018-10-15 13:14:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:11,943 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 13:14:11,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:14:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 13:14:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:14:11,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:11,944 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:11,945 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:11,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:11,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1478282411, now seen corresponding path program 22 times [2018-10-15 13:14:11,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:12,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:12,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:12,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:12,226 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 21 states. [2018-10-15 13:14:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:12,626 INFO L93 Difference]: Finished difference Result 337 states and 346 transitions. [2018-10-15 13:14:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:14:12,626 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-10-15 13:14:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:12,628 INFO L225 Difference]: With dead ends: 337 [2018-10-15 13:14:12,628 INFO L226 Difference]: Without dead ends: 331 [2018-10-15 13:14:12,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:14:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-15 13:14:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 158. [2018-10-15 13:14:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:14:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 13:14:12,632 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 82 [2018-10-15 13:14:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:12,633 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 13:14:12,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 13:14:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:14:12,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:12,634 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 4, 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] [2018-10-15 13:14:12,634 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:12,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1630798275, now seen corresponding path program 23 times [2018-10-15 13:14:12,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:12,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:12,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:12,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:12,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:12,865 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 23 states. [2018-10-15 13:14:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:13,454 INFO L93 Difference]: Finished difference Result 332 states and 341 transitions. [2018-10-15 13:14:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:14:13,455 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-10-15 13:14:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:13,457 INFO L225 Difference]: With dead ends: 332 [2018-10-15 13:14:13,457 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 13:14:13,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1840, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 13:14:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 158. [2018-10-15 13:14:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:14:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 13:14:13,462 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 82 [2018-10-15 13:14:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:13,463 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 13:14:13,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 13:14:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:14:13,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:13,464 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:13,464 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:13,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1355314279, now seen corresponding path program 24 times [2018-10-15 13:14:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:13,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:13,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:13,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:13,887 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 21 states. [2018-10-15 13:14:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:14,269 INFO L93 Difference]: Finished difference Result 323 states and 332 transitions. [2018-10-15 13:14:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:14:14,270 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 85 [2018-10-15 13:14:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:14,272 INFO L225 Difference]: With dead ends: 323 [2018-10-15 13:14:14,272 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 13:14:14,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:14:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 13:14:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 158. [2018-10-15 13:14:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:14:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 13:14:14,277 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 85 [2018-10-15 13:14:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:14,277 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 13:14:14,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 13:14:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:14:14,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:14,278 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:14,278 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:14,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 571343289, now seen corresponding path program 25 times [2018-10-15 13:14:14,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:17,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:17,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:17,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:17,334 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 23 states. [2018-10-15 13:14:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:18,027 INFO L93 Difference]: Finished difference Result 341 states and 350 transitions. [2018-10-15 13:14:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:14:18,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-15 13:14:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:18,030 INFO L225 Difference]: With dead ends: 341 [2018-10-15 13:14:18,030 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 13:14:18,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=492, Invalid=1764, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:14:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 13:14:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 158. [2018-10-15 13:14:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 13:14:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-10-15 13:14:18,035 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 85 [2018-10-15 13:14:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:18,035 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-10-15 13:14:18,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-10-15 13:14:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 13:14:18,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:18,036 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 3, 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] [2018-10-15 13:14:18,036 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:18,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1491296373, now seen corresponding path program 26 times [2018-10-15 13:14:18,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:18,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:18,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:18,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:18,244 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 25 states. [2018-10-15 13:14:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:19,208 INFO L93 Difference]: Finished difference Result 327 states and 337 transitions. [2018-10-15 13:14:19,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:14:19,208 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-10-15 13:14:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:19,210 INFO L225 Difference]: With dead ends: 327 [2018-10-15 13:14:19,210 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 13:14:19,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=657, Invalid=2313, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:14:19,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 13:14:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 164. [2018-10-15 13:14:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 13:14:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 13:14:19,215 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 85 [2018-10-15 13:14:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:19,215 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 13:14:19,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 13:14:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:14:19,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:19,216 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:19,217 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:19,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -966537759, now seen corresponding path program 27 times [2018-10-15 13:14:19,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:19,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:19,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:19,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:19,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:19,464 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 21 states. [2018-10-15 13:14:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:19,863 INFO L93 Difference]: Finished difference Result 297 states and 307 transitions. [2018-10-15 13:14:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:14:19,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-10-15 13:14:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:19,865 INFO L225 Difference]: With dead ends: 297 [2018-10-15 13:14:19,865 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 13:14:19,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=1160, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:14:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 13:14:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 164. [2018-10-15 13:14:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 13:14:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 13:14:19,870 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 88 [2018-10-15 13:14:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:19,870 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 13:14:19,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 13:14:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:14:19,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:19,871 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2018-10-15 13:14:19,871 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:19,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:19,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1167269071, now seen corresponding path program 28 times [2018-10-15 13:14:19,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:20,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:20,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:20,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:20,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:20,338 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 23 states. [2018-10-15 13:14:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:20,794 INFO L93 Difference]: Finished difference Result 351 states and 361 transitions. [2018-10-15 13:14:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:14:20,795 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2018-10-15 13:14:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:20,797 INFO L225 Difference]: With dead ends: 351 [2018-10-15 13:14:20,797 INFO L226 Difference]: Without dead ends: 345 [2018-10-15 13:14:20,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:14:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-15 13:14:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 164. [2018-10-15 13:14:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 13:14:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 13:14:20,802 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 88 [2018-10-15 13:14:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:20,802 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 13:14:20,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 13:14:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:14:20,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:20,803 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 4, 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] [2018-10-15 13:14:20,804 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:20,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -18617539, now seen corresponding path program 29 times [2018-10-15 13:14:20,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:21,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:21,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:21,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:21,244 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 25 states. [2018-10-15 13:14:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:21,853 INFO L93 Difference]: Finished difference Result 346 states and 356 transitions. [2018-10-15 13:14:21,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:14:21,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-10-15 13:14:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:21,856 INFO L225 Difference]: With dead ends: 346 [2018-10-15 13:14:21,856 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 13:14:21,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=624, Invalid=2238, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:14:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 13:14:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 164. [2018-10-15 13:14:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 13:14:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-10-15 13:14:21,860 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 88 [2018-10-15 13:14:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:21,861 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-10-15 13:14:21,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-10-15 13:14:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 13:14:21,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:21,862 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:21,862 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:21,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash -395590693, now seen corresponding path program 8 times [2018-10-15 13:14:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:22,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:22,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:14:22,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:14:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:14:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:14:22,811 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 21 states. [2018-10-15 13:14:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:23,216 INFO L93 Difference]: Finished difference Result 250 states and 260 transitions. [2018-10-15 13:14:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:14:23,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-10-15 13:14:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:23,218 INFO L225 Difference]: With dead ends: 250 [2018-10-15 13:14:23,218 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 13:14:23,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:14:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 13:14:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 176. [2018-10-15 13:14:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:14:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-10-15 13:14:23,222 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 91 [2018-10-15 13:14:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:23,223 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-10-15 13:14:23,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:14:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-10-15 13:14:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 13:14:23,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:23,224 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:23,224 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:23,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:23,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1965334355, now seen corresponding path program 30 times [2018-10-15 13:14:23,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:23,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:23,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:23,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:23,624 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 23 states. [2018-10-15 13:14:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:24,301 INFO L93 Difference]: Finished difference Result 391 states and 401 transitions. [2018-10-15 13:14:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:14:24,301 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-10-15 13:14:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:24,303 INFO L225 Difference]: With dead ends: 391 [2018-10-15 13:14:24,303 INFO L226 Difference]: Without dead ends: 385 [2018-10-15 13:14:24,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=476, Invalid=1594, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:14:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-15 13:14:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 176. [2018-10-15 13:14:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:14:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-10-15 13:14:24,308 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 91 [2018-10-15 13:14:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:24,308 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-10-15 13:14:24,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-10-15 13:14:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 13:14:24,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:24,310 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:24,310 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:24,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1545661951, now seen corresponding path program 31 times [2018-10-15 13:14:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:24,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:24,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:24,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:24,602 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 25 states. [2018-10-15 13:14:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:25,382 INFO L93 Difference]: Finished difference Result 395 states and 405 transitions. [2018-10-15 13:14:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:14:25,383 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2018-10-15 13:14:25,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:25,385 INFO L225 Difference]: With dead ends: 395 [2018-10-15 13:14:25,385 INFO L226 Difference]: Without dead ends: 389 [2018-10-15 13:14:25,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=599, Invalid=2157, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-15 13:14:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 176. [2018-10-15 13:14:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 13:14:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-10-15 13:14:25,388 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 91 [2018-10-15 13:14:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:25,389 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-10-15 13:14:25,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-10-15 13:14:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 13:14:25,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:25,389 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 3, 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] [2018-10-15 13:14:25,390 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:25,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:25,390 INFO L82 PathProgramCache]: Analyzing trace with hash -516977711, now seen corresponding path program 32 times [2018-10-15 13:14:25,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:25,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:25,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:25,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:25,719 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 27 states. [2018-10-15 13:14:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:26,433 INFO L93 Difference]: Finished difference Result 368 states and 379 transitions. [2018-10-15 13:14:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:14:26,433 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 91 [2018-10-15 13:14:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:26,435 INFO L225 Difference]: With dead ends: 368 [2018-10-15 13:14:26,435 INFO L226 Difference]: Without dead ends: 362 [2018-10-15 13:14:26,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=786, Invalid=2754, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:14:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-15 13:14:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 182. [2018-10-15 13:14:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:26,440 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 91 [2018-10-15 13:14:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:26,440 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:26,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:14:26,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:26,441 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:26,441 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:26,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -428264485, now seen corresponding path program 33 times [2018-10-15 13:14:26,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:26,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:26,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:26,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:26,756 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 23 states. [2018-10-15 13:14:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:27,227 INFO L93 Difference]: Finished difference Result 374 states and 385 transitions. [2018-10-15 13:14:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 13:14:27,228 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2018-10-15 13:14:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:27,230 INFO L225 Difference]: With dead ends: 374 [2018-10-15 13:14:27,230 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 13:14:27,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=480, Invalid=1500, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:14:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 13:14:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 182. [2018-10-15 13:14:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:27,235 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 94 [2018-10-15 13:14:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:27,235 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:27,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:14:27,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:27,236 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:27,236 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:27,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1705542345, now seen corresponding path program 34 times [2018-10-15 13:14:27,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:27,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:27,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:27,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:27,492 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 25 states. [2018-10-15 13:14:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:27,983 INFO L93 Difference]: Finished difference Result 410 states and 421 transitions. [2018-10-15 13:14:27,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 13:14:27,984 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-10-15 13:14:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:27,986 INFO L225 Difference]: With dead ends: 410 [2018-10-15 13:14:27,986 INFO L226 Difference]: Without dead ends: 404 [2018-10-15 13:14:27,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=582, Invalid=2070, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:14:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-15 13:14:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 182. [2018-10-15 13:14:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:27,990 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 94 [2018-10-15 13:14:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:27,990 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:27,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:14:27,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:27,991 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 4, 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] [2018-10-15 13:14:27,992 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:27,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash 519655735, now seen corresponding path program 35 times [2018-10-15 13:14:27,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:28,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:28,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:28,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:28,352 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 27 states. [2018-10-15 13:14:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:29,280 INFO L93 Difference]: Finished difference Result 396 states and 407 transitions. [2018-10-15 13:14:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:14:29,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-10-15 13:14:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:29,283 INFO L225 Difference]: With dead ends: 396 [2018-10-15 13:14:29,283 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 13:14:29,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=748, Invalid=2674, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:14:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 13:14:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 182. [2018-10-15 13:14:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:29,287 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 94 [2018-10-15 13:14:29,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:29,287 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:29,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 13:14:29,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:29,289 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:29,289 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:29,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2104368223, now seen corresponding path program 36 times [2018-10-15 13:14:29,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:29,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:29,664 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 23 states. [2018-10-15 13:14:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:30,124 INFO L93 Difference]: Finished difference Result 333 states and 344 transitions. [2018-10-15 13:14:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:14:30,125 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2018-10-15 13:14:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:30,127 INFO L225 Difference]: With dead ends: 333 [2018-10-15 13:14:30,127 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 13:14:30,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=1400, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:14:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 13:14:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 182. [2018-10-15 13:14:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:30,130 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 97 [2018-10-15 13:14:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:30,130 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:30,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 13:14:30,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:30,131 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:30,132 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:30,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 620855411, now seen corresponding path program 37 times [2018-10-15 13:14:30,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:30,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:30,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:30,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:30,474 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 25 states. [2018-10-15 13:14:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:30,944 INFO L93 Difference]: Finished difference Result 405 states and 416 transitions. [2018-10-15 13:14:30,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:14:30,945 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2018-10-15 13:14:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:30,947 INFO L225 Difference]: With dead ends: 405 [2018-10-15 13:14:30,947 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 13:14:30,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=573, Invalid=1977, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:14:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 13:14:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 182. [2018-10-15 13:14:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:30,951 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 97 [2018-10-15 13:14:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:30,951 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:30,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 13:14:30,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:30,952 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:30,953 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:30,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash -163115579, now seen corresponding path program 38 times [2018-10-15 13:14:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:31,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:31,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:31,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:31,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:31,455 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 27 states. [2018-10-15 13:14:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:32,076 INFO L93 Difference]: Finished difference Result 409 states and 420 transitions. [2018-10-15 13:14:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:14:32,077 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 97 [2018-10-15 13:14:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:32,079 INFO L225 Difference]: With dead ends: 409 [2018-10-15 13:14:32,079 INFO L226 Difference]: Without dead ends: 403 [2018-10-15 13:14:32,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=718, Invalid=2588, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:14:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-15 13:14:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 182. [2018-10-15 13:14:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 13:14:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-10-15 13:14:32,084 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 97 [2018-10-15 13:14:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:32,084 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-10-15 13:14:32,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-10-15 13:14:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 13:14:32,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:32,085 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 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] [2018-10-15 13:14:32,085 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:32,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2069212055, now seen corresponding path program 39 times [2018-10-15 13:14:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:32,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:32,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:14:32,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:14:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:14:32,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:32,457 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 29 states. [2018-10-15 13:14:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:33,481 INFO L93 Difference]: Finished difference Result 382 states and 394 transitions. [2018-10-15 13:14:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:14:33,481 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 97 [2018-10-15 13:14:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:33,483 INFO L225 Difference]: With dead ends: 382 [2018-10-15 13:14:33,484 INFO L226 Difference]: Without dead ends: 376 [2018-10-15 13:14:33,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=927, Invalid=3233, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:14:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-15 13:14:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 188. [2018-10-15 13:14:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 13:14:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-10-15 13:14:33,488 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 97 [2018-10-15 13:14:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:33,489 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-10-15 13:14:33,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:14:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-10-15 13:14:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:14:33,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:33,490 INFO L375 BasicCegarLoop]: trace histogram [10, 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] [2018-10-15 13:14:33,490 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:33,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:33,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1855584537, now seen corresponding path program 9 times [2018-10-15 13:14:33,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:33,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:33,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:14:33,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:14:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:14:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:14:33,822 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 23 states. [2018-10-15 13:14:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:34,493 INFO L93 Difference]: Finished difference Result 283 states and 295 transitions. [2018-10-15 13:14:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:14:34,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-10-15 13:14:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:34,495 INFO L225 Difference]: With dead ends: 283 [2018-10-15 13:14:34,495 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 13:14:34,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:14:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 13:14:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2018-10-15 13:14:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:34,500 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 13:14:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:34,500 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:34,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:14:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:14:34,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:34,501 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:34,501 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:34,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:34,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1627698773, now seen corresponding path program 40 times [2018-10-15 13:14:34,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:34,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:34,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:34,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:34,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:34,781 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 25 states. [2018-10-15 13:14:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:35,267 INFO L93 Difference]: Finished difference Result 451 states and 463 transitions. [2018-10-15 13:14:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:14:35,268 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-10-15 13:14:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:35,270 INFO L225 Difference]: With dead ends: 451 [2018-10-15 13:14:35,271 INFO L226 Difference]: Without dead ends: 445 [2018-10-15 13:14:35,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=1878, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:14:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-15 13:14:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 200. [2018-10-15 13:14:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:35,275 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 13:14:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:35,275 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:35,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:14:35,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:35,276 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 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] [2018-10-15 13:14:35,276 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:35,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash -533461693, now seen corresponding path program 41 times [2018-10-15 13:14:35,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:35,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:35,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:35,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:35,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:35,745 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 27 states. [2018-10-15 13:14:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:36,362 INFO L93 Difference]: Finished difference Result 469 states and 481 transitions. [2018-10-15 13:14:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:14:36,362 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-10-15 13:14:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:36,365 INFO L225 Difference]: With dead ends: 469 [2018-10-15 13:14:36,365 INFO L226 Difference]: Without dead ends: 463 [2018-10-15 13:14:36,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=696, Invalid=2496, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:14:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-15 13:14:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 200. [2018-10-15 13:14:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:36,370 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 13:14:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:36,370 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:36,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:14:36,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:36,371 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 4, 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] [2018-10-15 13:14:36,371 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:36,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:36,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1719348303, now seen corresponding path program 42 times [2018-10-15 13:14:36,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:36,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:36,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:14:36,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:14:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:14:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:36,954 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 29 states. [2018-10-15 13:14:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:37,714 INFO L93 Difference]: Finished difference Result 446 states and 458 transitions. [2018-10-15 13:14:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:14:37,714 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2018-10-15 13:14:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:37,716 INFO L225 Difference]: With dead ends: 446 [2018-10-15 13:14:37,716 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 13:14:37,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=884, Invalid=3148, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:14:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 13:14:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 200. [2018-10-15 13:14:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:37,720 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 100 [2018-10-15 13:14:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:37,720 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:37,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:14:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:14:37,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:37,721 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:37,721 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:37,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:37,722 INFO L82 PathProgramCache]: Analyzing trace with hash 863409895, now seen corresponding path program 43 times [2018-10-15 13:14:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:37,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:37,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:37,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:37,961 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 25 states. [2018-10-15 13:14:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:38,482 INFO L93 Difference]: Finished difference Result 419 states and 431 transitions. [2018-10-15 13:14:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:14:38,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 103 [2018-10-15 13:14:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:38,484 INFO L225 Difference]: With dead ends: 419 [2018-10-15 13:14:38,484 INFO L226 Difference]: Without dead ends: 413 [2018-10-15 13:14:38,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-15 13:14:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 200. [2018-10-15 13:14:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:38,489 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 103 [2018-10-15 13:14:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:38,490 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:38,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:14:38,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:38,491 INFO L375 BasicCegarLoop]: trace histogram [7, 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] [2018-10-15 13:14:38,491 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:38,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -706333767, now seen corresponding path program 44 times [2018-10-15 13:14:38,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:39,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:39,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:39,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:39,422 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 27 states. [2018-10-15 13:14:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:40,102 INFO L93 Difference]: Finished difference Result 473 states and 485 transitions. [2018-10-15 13:14:40,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:14:40,103 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 103 [2018-10-15 13:14:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:40,105 INFO L225 Difference]: With dead ends: 473 [2018-10-15 13:14:40,105 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 13:14:40,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=682, Invalid=2398, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:14:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 13:14:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 200. [2018-10-15 13:14:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:40,109 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 103 [2018-10-15 13:14:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:40,109 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:40,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:14:40,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:40,110 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:40,110 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:40,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1490304757, now seen corresponding path program 45 times [2018-10-15 13:14:40,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:40,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:40,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:14:40,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:14:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:14:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:40,477 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 29 states. [2018-10-15 13:14:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:41,151 INFO L93 Difference]: Finished difference Result 468 states and 480 transitions. [2018-10-15 13:14:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:14:41,151 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 103 [2018-10-15 13:14:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:41,154 INFO L225 Difference]: With dead ends: 468 [2018-10-15 13:14:41,154 INFO L226 Difference]: Without dead ends: 462 [2018-10-15 13:14:41,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=849, Invalid=3057, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:14:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-15 13:14:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 200. [2018-10-15 13:14:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 13:14:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-10-15 13:14:41,158 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 103 [2018-10-15 13:14:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:41,159 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-10-15 13:14:41,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:14:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-10-15 13:14:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:14:41,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:41,160 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 3, 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] [2018-10-15 13:14:41,160 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:41,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 742022877, now seen corresponding path program 46 times [2018-10-15 13:14:41,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:43,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:43,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:14:43,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:14:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:14:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:43,715 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 31 states. [2018-10-15 13:14:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:44,796 INFO L93 Difference]: Finished difference Result 423 states and 436 transitions. [2018-10-15 13:14:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:14:44,796 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 103 [2018-10-15 13:14:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:44,799 INFO L225 Difference]: With dead ends: 423 [2018-10-15 13:14:44,799 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 13:14:44,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1080, Invalid=3750, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:14:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 13:14:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 206. [2018-10-15 13:14:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:14:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 13:14:44,803 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 103 [2018-10-15 13:14:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:44,803 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 13:14:44,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:14:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 13:14:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:14:44,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:44,804 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:44,804 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:44,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash -679459359, now seen corresponding path program 47 times [2018-10-15 13:14:44,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:45,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:45,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:45,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:45,074 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 25 states. [2018-10-15 13:14:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:45,570 INFO L93 Difference]: Finished difference Result 375 states and 388 transitions. [2018-10-15 13:14:45,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:14:45,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-10-15 13:14:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:45,572 INFO L225 Difference]: With dead ends: 375 [2018-10-15 13:14:45,573 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 13:14:45,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=594, Invalid=1662, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:14:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 13:14:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 206. [2018-10-15 13:14:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:14:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 13:14:45,576 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 13:14:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:45,576 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 13:14:45,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 13:14:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:14:45,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:45,577 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:45,577 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:45,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1491143345, now seen corresponding path program 48 times [2018-10-15 13:14:45,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:46,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:46,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:46,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:46,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:46,511 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 27 states. [2018-10-15 13:14:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:47,125 INFO L93 Difference]: Finished difference Result 465 states and 478 transitions. [2018-10-15 13:14:47,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:14:47,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 106 [2018-10-15 13:14:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:47,128 INFO L225 Difference]: With dead ends: 465 [2018-10-15 13:14:47,128 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 13:14:47,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=676, Invalid=2294, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:14:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 13:14:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 206. [2018-10-15 13:14:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:14:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 13:14:47,133 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 13:14:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:47,133 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 13:14:47,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 13:14:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:14:47,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:47,134 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 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] [2018-10-15 13:14:47,134 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:47,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash 642663485, now seen corresponding path program 49 times [2018-10-15 13:14:47,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:47,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:47,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:14:47,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:14:47,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:14:47,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:47,468 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 29 states. [2018-10-15 13:14:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:48,147 INFO L93 Difference]: Finished difference Result 483 states and 496 transitions. [2018-10-15 13:14:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:14:48,148 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 106 [2018-10-15 13:14:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:48,150 INFO L225 Difference]: With dead ends: 483 [2018-10-15 13:14:48,150 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 13:14:48,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=822, Invalid=2960, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:14:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 13:14:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 206. [2018-10-15 13:14:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:14:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 13:14:48,157 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 13:14:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:48,157 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 13:14:48,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:14:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 13:14:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:14:48,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:48,158 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 4, 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] [2018-10-15 13:14:48,158 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:48,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash -543223125, now seen corresponding path program 50 times [2018-10-15 13:14:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:48,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:48,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:14:48,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:14:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:14:48,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:48,968 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 31 states. [2018-10-15 13:14:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:50,025 INFO L93 Difference]: Finished difference Result 460 states and 473 transitions. [2018-10-15 13:14:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:14:50,026 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 106 [2018-10-15 13:14:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:50,028 INFO L225 Difference]: With dead ends: 460 [2018-10-15 13:14:50,028 INFO L226 Difference]: Without dead ends: 454 [2018-10-15 13:14:50,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1032, Invalid=3660, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:14:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-15 13:14:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 206. [2018-10-15 13:14:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 13:14:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-10-15 13:14:50,032 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 106 [2018-10-15 13:14:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:50,032 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-10-15 13:14:50,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:14:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-10-15 13:14:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:14:50,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:50,033 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:50,034 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:50,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash 230191451, now seen corresponding path program 10 times [2018-10-15 13:14:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:14:50,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:14:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:14:50,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:14:50,440 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 25 states. [2018-10-15 13:14:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:50,962 INFO L93 Difference]: Finished difference Result 310 states and 323 transitions. [2018-10-15 13:14:50,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:14:50,962 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2018-10-15 13:14:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:50,964 INFO L225 Difference]: With dead ends: 310 [2018-10-15 13:14:50,964 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 13:14:50,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:14:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 13:14:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 218. [2018-10-15 13:14:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 13:14:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 13:14:50,967 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 13:14:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:50,967 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 13:14:50,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:14:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 13:14:50,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:14:50,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:50,968 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:50,968 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:50,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 465386925, now seen corresponding path program 51 times [2018-10-15 13:14:50,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:51,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:51,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:51,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:51,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:51,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:51,200 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 27 states. [2018-10-15 13:14:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:51,745 INFO L93 Difference]: Finished difference Result 505 states and 518 transitions. [2018-10-15 13:14:51,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:14:51,746 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2018-10-15 13:14:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:51,748 INFO L225 Difference]: With dead ends: 505 [2018-10-15 13:14:51,748 INFO L226 Difference]: Without dead ends: 499 [2018-10-15 13:14:51,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=678, Invalid=2184, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:14:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-15 13:14:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 218. [2018-10-15 13:14:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 13:14:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 13:14:51,752 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 13:14:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:51,752 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 13:14:51,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 13:14:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:14:51,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:51,753 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:51,753 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:51,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1104356737, now seen corresponding path program 52 times [2018-10-15 13:14:51,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:52,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:52,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:14:52,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:14:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:14:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:52,033 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 29 states. [2018-10-15 13:14:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:52,723 INFO L93 Difference]: Finished difference Result 541 states and 554 transitions. [2018-10-15 13:14:52,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:14:52,724 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-10-15 13:14:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:52,726 INFO L225 Difference]: With dead ends: 541 [2018-10-15 13:14:52,726 INFO L226 Difference]: Without dead ends: 535 [2018-10-15 13:14:52,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=803, Invalid=2857, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:14:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-15 13:14:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 218. [2018-10-15 13:14:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 13:14:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 13:14:52,730 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 13:14:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:52,731 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 13:14:52,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:14:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 13:14:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:14:52,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:52,732 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:52,732 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1888327727, now seen corresponding path program 53 times [2018-10-15 13:14:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:53,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:53,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:14:53,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:14:53,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:14:53,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:53,104 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 31 states. [2018-10-15 13:14:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:53,898 INFO L93 Difference]: Finished difference Result 527 states and 540 transitions. [2018-10-15 13:14:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:14:53,898 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 109 [2018-10-15 13:14:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:53,901 INFO L225 Difference]: With dead ends: 527 [2018-10-15 13:14:53,901 INFO L226 Difference]: Without dead ends: 521 [2018-10-15 13:14:53,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=992, Invalid=3564, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:14:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-10-15 13:14:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 218. [2018-10-15 13:14:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 13:14:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2018-10-15 13:14:53,905 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 109 [2018-10-15 13:14:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:53,905 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2018-10-15 13:14:53,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:14:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2018-10-15 13:14:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 13:14:53,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:53,906 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 3, 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] [2018-10-15 13:14:53,906 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:53,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 343999907, now seen corresponding path program 54 times [2018-10-15 13:14:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 433 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:54,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:14:54,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:14:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:14:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:14:54,353 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand 33 states. [2018-10-15 13:14:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:55,564 INFO L93 Difference]: Finished difference Result 464 states and 478 transitions. [2018-10-15 13:14:55,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:14:55,565 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 109 [2018-10-15 13:14:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:55,567 INFO L225 Difference]: With dead ends: 464 [2018-10-15 13:14:55,567 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 13:14:55,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1245, Invalid=4305, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:14:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 13:14:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 224. [2018-10-15 13:14:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:14:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:14:55,571 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 109 [2018-10-15 13:14:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:55,571 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:14:55,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:14:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:14:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:14:55,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:55,572 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:55,572 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:55,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:55,572 INFO L82 PathProgramCache]: Analyzing trace with hash 222945627, now seen corresponding path program 55 times [2018-10-15 13:14:55,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:55,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:14:55,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:14:55,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:14:55,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:14:55,890 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 27 states. [2018-10-15 13:14:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:56,468 INFO L93 Difference]: Finished difference Result 470 states and 484 transitions. [2018-10-15 13:14:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 13:14:56,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 112 [2018-10-15 13:14:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:56,471 INFO L225 Difference]: With dead ends: 470 [2018-10-15 13:14:56,471 INFO L226 Difference]: Without dead ends: 464 [2018-10-15 13:14:56,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=688, Invalid=2068, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-15 13:14:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 224. [2018-10-15 13:14:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:14:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:14:56,475 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 13:14:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:56,475 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:14:56,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:14:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:14:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:14:56,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:56,476 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:56,476 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:56,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:56,476 INFO L82 PathProgramCache]: Analyzing trace with hash -588738359, now seen corresponding path program 56 times [2018-10-15 13:14:56,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:56,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:56,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:14:56,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:14:56,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:14:56,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:14:56,920 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 29 states. [2018-10-15 13:14:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:57,664 INFO L93 Difference]: Finished difference Result 542 states and 556 transitions. [2018-10-15 13:14:57,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:14:57,664 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2018-10-15 13:14:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:57,668 INFO L225 Difference]: With dead ends: 542 [2018-10-15 13:14:57,668 INFO L226 Difference]: Without dead ends: 536 [2018-10-15 13:14:57,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=792, Invalid=2748, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:14:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-15 13:14:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 224. [2018-10-15 13:14:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:14:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:14:57,672 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 13:14:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:57,673 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:14:57,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:14:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:14:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:14:57,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:57,674 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 6, 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] [2018-10-15 13:14:57,674 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:57,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1545068471, now seen corresponding path program 57 times [2018-10-15 13:14:57,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:57,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:57,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:14:57,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:14:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:14:57,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:14:57,985 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 31 states. [2018-10-15 13:14:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:58,814 INFO L93 Difference]: Finished difference Result 546 states and 560 transitions. [2018-10-15 13:14:58,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:14:58,815 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2018-10-15 13:14:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:58,817 INFO L225 Difference]: With dead ends: 546 [2018-10-15 13:14:58,818 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 13:14:58,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=960, Invalid=3462, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:14:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 13:14:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 224. [2018-10-15 13:14:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:14:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:14:58,821 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 13:14:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:58,822 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:14:58,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:14:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:14:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:14:58,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:58,822 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 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] [2018-10-15 13:14:58,823 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:58,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 359181861, now seen corresponding path program 58 times [2018-10-15 13:14:58,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:59,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:59,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:14:59,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:14:59,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:14:59,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:14:59,148 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 33 states. [2018-10-15 13:15:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:00,264 INFO L93 Difference]: Finished difference Result 510 states and 524 transitions. [2018-10-15 13:15:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:15:00,264 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2018-10-15 13:15:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:00,267 INFO L225 Difference]: With dead ends: 510 [2018-10-15 13:15:00,267 INFO L226 Difference]: Without dead ends: 504 [2018-10-15 13:15:00,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1192, Invalid=4210, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:15:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-15 13:15:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 224. [2018-10-15 13:15:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:15:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:15:00,271 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 112 [2018-10-15 13:15:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:00,271 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:15:00,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:15:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:15:00,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:00,272 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:00,272 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:00,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1576823713, now seen corresponding path program 59 times [2018-10-15 13:15:00,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:00,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:15:00,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:15:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:15:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:15:00,805 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 27 states. [2018-10-15 13:15:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:01,360 INFO L93 Difference]: Finished difference Result 411 states and 425 transitions. [2018-10-15 13:15:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:15:01,361 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 115 [2018-10-15 13:15:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:01,363 INFO L225 Difference]: With dead ends: 411 [2018-10-15 13:15:01,363 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 13:15:01,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=706, Invalid=1946, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:15:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 13:15:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 224. [2018-10-15 13:15:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:15:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:15:01,367 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 13:15:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:01,367 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:15:01,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:15:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:15:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:15:01,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:01,368 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:01,368 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:01,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1812019187, now seen corresponding path program 60 times [2018-10-15 13:15:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:02,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:02,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:15:02,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:15:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:15:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:15:02,172 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 29 states. [2018-10-15 13:15:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:02,836 INFO L93 Difference]: Finished difference Result 519 states and 533 transitions. [2018-10-15 13:15:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:15:02,837 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 115 [2018-10-15 13:15:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:02,839 INFO L225 Difference]: With dead ends: 519 [2018-10-15 13:15:02,839 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 13:15:02,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=789, Invalid=2633, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:15:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 13:15:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 224. [2018-10-15 13:15:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:15:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:15:02,843 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 13:15:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:02,843 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:15:02,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:15:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:15:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:15:02,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:02,844 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:02,844 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:02,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash 242275525, now seen corresponding path program 61 times [2018-10-15 13:15:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:03,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:03,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:03,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:03,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:03,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:03,129 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 31 states. [2018-10-15 13:15:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:03,952 INFO L93 Difference]: Finished difference Result 555 states and 569 transitions. [2018-10-15 13:15:03,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:15:03,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 115 [2018-10-15 13:15:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:03,955 INFO L225 Difference]: With dead ends: 555 [2018-10-15 13:15:03,955 INFO L226 Difference]: Without dead ends: 549 [2018-10-15 13:15:03,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=936, Invalid=3354, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:15:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-10-15 13:15:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 224. [2018-10-15 13:15:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:15:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:15:03,959 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 13:15:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:03,959 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:15:03,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:15:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:15:03,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:03,960 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:03,960 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:03,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash -541695465, now seen corresponding path program 62 times [2018-10-15 13:15:03,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:05,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:05,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:05,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:05,094 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 33 states. [2018-10-15 13:15:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:05,923 INFO L93 Difference]: Finished difference Result 541 states and 555 transitions. [2018-10-15 13:15:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:15:05,924 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 115 [2018-10-15 13:15:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:05,927 INFO L225 Difference]: With dead ends: 541 [2018-10-15 13:15:05,927 INFO L226 Difference]: Without dead ends: 535 [2018-10-15 13:15:05,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1147, Invalid=4109, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:15:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-15 13:15:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 224. [2018-10-15 13:15:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 13:15:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 238 transitions. [2018-10-15 13:15:05,930 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 238 transitions. Word has length 115 [2018-10-15 13:15:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:05,930 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 238 transitions. [2018-10-15 13:15:05,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 238 transitions. [2018-10-15 13:15:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 13:15:05,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:05,931 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 3, 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] [2018-10-15 13:15:05,931 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:05,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1690632169, now seen corresponding path program 63 times [2018-10-15 13:15:05,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:06,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:06,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:06,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:06,290 INFO L87 Difference]: Start difference. First operand 224 states and 238 transitions. Second operand 35 states. [2018-10-15 13:15:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:07,511 INFO L93 Difference]: Finished difference Result 478 states and 493 transitions. [2018-10-15 13:15:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:15:07,511 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 115 [2018-10-15 13:15:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:07,513 INFO L225 Difference]: With dead ends: 478 [2018-10-15 13:15:07,514 INFO L226 Difference]: Without dead ends: 472 [2018-10-15 13:15:07,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1422, Invalid=4898, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:15:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-15 13:15:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 230. [2018-10-15 13:15:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 13:15:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 245 transitions. [2018-10-15 13:15:07,518 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 245 transitions. Word has length 115 [2018-10-15 13:15:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:07,518 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 245 transitions. [2018-10-15 13:15:07,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 245 transitions. [2018-10-15 13:15:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:15:07,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:07,519 INFO L375 BasicCegarLoop]: trace histogram [12, 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] [2018-10-15 13:15:07,519 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:07,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:07,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1740933479, now seen corresponding path program 11 times [2018-10-15 13:15:07,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:15:07,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:15:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:15:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:15:07,776 INFO L87 Difference]: Start difference. First operand 230 states and 245 transitions. Second operand 27 states. [2018-10-15 13:15:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:08,366 INFO L93 Difference]: Finished difference Result 343 states and 358 transitions. [2018-10-15 13:15:08,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:15:08,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 118 [2018-10-15 13:15:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:08,369 INFO L225 Difference]: With dead ends: 343 [2018-10-15 13:15:08,369 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 13:15:08,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:15:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 13:15:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 242. [2018-10-15 13:15:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:08,372 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 13:15:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:08,373 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:08,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:15:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:15:08,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:08,373 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:08,373 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:08,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1544849067, now seen corresponding path program 64 times [2018-10-15 13:15:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:08,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:08,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:15:08,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:15:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:15:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:15:08,676 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 29 states. [2018-10-15 13:15:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:09,290 INFO L93 Difference]: Finished difference Result 565 states and 580 transitions. [2018-10-15 13:15:09,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:15:09,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-10-15 13:15:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:09,293 INFO L225 Difference]: With dead ends: 565 [2018-10-15 13:15:09,293 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 13:15:09,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=794, Invalid=2512, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:15:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 13:15:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 242. [2018-10-15 13:15:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:09,297 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 13:15:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:09,297 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:09,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:15:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:15:09,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:09,298 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 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] [2018-10-15 13:15:09,298 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:09,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1938434243, now seen corresponding path program 65 times [2018-10-15 13:15:09,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:09,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:09,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:09,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:09,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:09,585 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 31 states. [2018-10-15 13:15:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:10,540 INFO L93 Difference]: Finished difference Result 619 states and 634 transitions. [2018-10-15 13:15:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:15:10,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-10-15 13:15:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:10,543 INFO L225 Difference]: With dead ends: 619 [2018-10-15 13:15:10,543 INFO L226 Difference]: Without dead ends: 613 [2018-10-15 13:15:10,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=920, Invalid=3240, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:15:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-10-15 13:15:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 242. [2018-10-15 13:15:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:10,547 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 13:15:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:10,547 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:10,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:15:10,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:10,548 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 6, 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] [2018-10-15 13:15:10,549 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:10,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:10,549 INFO L82 PathProgramCache]: Analyzing trace with hash -222726223, now seen corresponding path program 66 times [2018-10-15 13:15:10,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:10,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:10,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:10,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:10,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:10,965 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 33 states. [2018-10-15 13:15:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:11,806 INFO L93 Difference]: Finished difference Result 614 states and 629 transitions. [2018-10-15 13:15:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:15:11,806 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 118 [2018-10-15 13:15:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:11,809 INFO L225 Difference]: With dead ends: 614 [2018-10-15 13:15:11,809 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 13:15:11,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=4002, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:15:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 13:15:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 242. [2018-10-15 13:15:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:11,813 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 13:15:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:11,814 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:11,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:15:11,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:11,814 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 4, 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] [2018-10-15 13:15:11,814 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1408612833, now seen corresponding path program 67 times [2018-10-15 13:15:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:12,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:12,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:12,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:12,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:12,151 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 35 states. [2018-10-15 13:15:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:13,160 INFO L93 Difference]: Finished difference Result 560 states and 575 transitions. [2018-10-15 13:15:13,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:15:13,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 118 [2018-10-15 13:15:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:13,163 INFO L225 Difference]: With dead ends: 560 [2018-10-15 13:15:13,163 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 13:15:13,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=4798, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:15:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 13:15:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 242. [2018-10-15 13:15:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:13,167 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 118 [2018-10-15 13:15:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:13,179 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:13,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:15:13,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:13,180 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:13,180 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:13,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 2094078311, now seen corresponding path program 68 times [2018-10-15 13:15:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:13,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:13,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:15:13,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:15:13,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:15:13,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:15:13,768 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 29 states. [2018-10-15 13:15:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:14,402 INFO L93 Difference]: Finished difference Result 515 states and 530 transitions. [2018-10-15 13:15:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:15:14,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 121 [2018-10-15 13:15:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:14,409 INFO L225 Difference]: With dead ends: 515 [2018-10-15 13:15:14,409 INFO L226 Difference]: Without dead ends: 509 [2018-10-15 13:15:14,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=807, Invalid=2385, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:15:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-15 13:15:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 242. [2018-10-15 13:15:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:14,412 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 13:15:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:14,413 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:14,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:15:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:15:14,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:14,413 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:14,414 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:14,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1965693511, now seen corresponding path program 69 times [2018-10-15 13:15:14,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:14,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:14,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:14,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:14,680 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 31 states. [2018-10-15 13:15:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:15,659 INFO L93 Difference]: Finished difference Result 605 states and 620 transitions. [2018-10-15 13:15:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:15:15,660 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2018-10-15 13:15:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:15,662 INFO L225 Difference]: With dead ends: 605 [2018-10-15 13:15:15,662 INFO L226 Difference]: Without dead ends: 599 [2018-10-15 13:15:15,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=912, Invalid=3120, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:15:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-15 13:15:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 242. [2018-10-15 13:15:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:15,666 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 13:15:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:15,667 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:15,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:15:15,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:15,667 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:15,667 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:15,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash 759530123, now seen corresponding path program 70 times [2018-10-15 13:15:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:15,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:15,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:15,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:15,966 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 33 states. [2018-10-15 13:15:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:16,869 INFO L93 Difference]: Finished difference Result 623 states and 638 transitions. [2018-10-15 13:15:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:15:16,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 121 [2018-10-15 13:15:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:16,873 INFO L225 Difference]: With dead ends: 623 [2018-10-15 13:15:16,873 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 13:15:16,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=3889, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:15:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 13:15:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 242. [2018-10-15 13:15:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:16,876 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 13:15:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:16,876 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:16,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:15:16,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:16,877 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:16,877 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:16,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -24440867, now seen corresponding path program 71 times [2018-10-15 13:15:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:17,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:17,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:17,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:17,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:17,277 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 35 states. [2018-10-15 13:15:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:18,342 INFO L93 Difference]: Finished difference Result 600 states and 615 transitions. [2018-10-15 13:15:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:15:18,342 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 121 [2018-10-15 13:15:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:18,345 INFO L225 Difference]: With dead ends: 600 [2018-10-15 13:15:18,345 INFO L226 Difference]: Without dead ends: 594 [2018-10-15 13:15:18,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1314, Invalid=4692, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:15:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-15 13:15:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 242. [2018-10-15 13:15:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:15:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-10-15 13:15:18,349 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 121 [2018-10-15 13:15:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:18,349 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-10-15 13:15:18,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-10-15 13:15:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 13:15:18,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:18,350 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 3, 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] [2018-10-15 13:15:18,350 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:18,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2087080529, now seen corresponding path program 72 times [2018-10-15 13:15:18,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:18,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:18,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:15:18,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:15:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:15:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:15:18,767 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 37 states. [2018-10-15 13:15:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:19,961 INFO L93 Difference]: Finished difference Result 519 states and 535 transitions. [2018-10-15 13:15:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:15:19,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 121 [2018-10-15 13:15:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:19,964 INFO L225 Difference]: With dead ends: 519 [2018-10-15 13:15:19,964 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 13:15:19,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1611, Invalid=5529, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:15:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 13:15:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 248. [2018-10-15 13:15:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:15:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 13:15:19,968 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 121 [2018-10-15 13:15:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:19,968 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 13:15:19,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:15:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 13:15:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:19,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:19,970 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:19,970 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:19,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 930004449, now seen corresponding path program 73 times [2018-10-15 13:15:19,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:20,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:15:20,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:15:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:15:20,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:15:20,413 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 29 states. [2018-10-15 13:15:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:21,050 INFO L93 Difference]: Finished difference Result 453 states and 469 transitions. [2018-10-15 13:15:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:15:21,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-15 13:15:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:21,053 INFO L225 Difference]: With dead ends: 453 [2018-10-15 13:15:21,053 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 13:15:21,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=828, Invalid=2252, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:15:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 13:15:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 248. [2018-10-15 13:15:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:15:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 13:15:21,057 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 13:15:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:21,057 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 13:15:21,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:15:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 13:15:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:21,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:21,058 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:21,059 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:21,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1939189199, now seen corresponding path program 74 times [2018-10-15 13:15:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:21,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:21,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:21,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:21,468 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 31 states. [2018-10-15 13:15:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:22,159 INFO L93 Difference]: Finished difference Result 579 states and 595 transitions. [2018-10-15 13:15:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:15:22,160 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 124 [2018-10-15 13:15:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:22,163 INFO L225 Difference]: With dead ends: 579 [2018-10-15 13:15:22,163 INFO L226 Difference]: Without dead ends: 573 [2018-10-15 13:15:22,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=912, Invalid=2994, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:15:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-10-15 13:15:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 248. [2018-10-15 13:15:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:15:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 13:15:22,168 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 13:15:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:22,168 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 13:15:22,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 13:15:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:22,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:22,169 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:22,169 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:22,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1127505213, now seen corresponding path program 75 times [2018-10-15 13:15:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:22,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:22,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:22,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:22,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:22,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:22,530 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 33 states. [2018-10-15 13:15:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:23,377 INFO L93 Difference]: Finished difference Result 633 states and 649 transitions. [2018-10-15 13:15:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:15:23,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-10-15 13:15:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:23,379 INFO L225 Difference]: With dead ends: 633 [2018-10-15 13:15:23,379 INFO L226 Difference]: Without dead ends: 627 [2018-10-15 13:15:23,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1060, Invalid=3770, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:15:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-15 13:15:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 248. [2018-10-15 13:15:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:15:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 13:15:23,383 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 13:15:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:23,383 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 13:15:23,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 13:15:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:23,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:23,384 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 6, 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] [2018-10-15 13:15:23,384 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:23,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1033655253, now seen corresponding path program 76 times [2018-10-15 13:15:23,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:23,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:23,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:23,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:23,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:23,746 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 35 states. [2018-10-15 13:15:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:24,665 INFO L93 Difference]: Finished difference Result 628 states and 644 transitions. [2018-10-15 13:15:24,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:15:24,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 124 [2018-10-15 13:15:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:24,667 INFO L225 Difference]: With dead ends: 628 [2018-10-15 13:15:24,667 INFO L226 Difference]: Without dead ends: 622 [2018-10-15 13:15:24,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1272, Invalid=4580, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:15:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-15 13:15:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 248. [2018-10-15 13:15:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:15:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 13:15:24,673 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 13:15:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:24,673 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 13:15:24,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 13:15:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:24,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:24,674 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 4, 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] [2018-10-15 13:15:24,674 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:24,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:24,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2075425433, now seen corresponding path program 77 times [2018-10-15 13:15:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:25,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:15:25,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:15:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:15:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:15:25,083 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 37 states. [2018-10-15 13:15:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:26,436 INFO L93 Difference]: Finished difference Result 574 states and 590 transitions. [2018-10-15 13:15:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:15:26,436 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 124 [2018-10-15 13:15:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:26,437 INFO L225 Difference]: With dead ends: 574 [2018-10-15 13:15:26,437 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 13:15:26,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1548, Invalid=5424, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:15:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 13:15:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 248. [2018-10-15 13:15:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 13:15:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-10-15 13:15:26,442 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 124 [2018-10-15 13:15:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:26,442 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-10-15 13:15:26,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:15:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-10-15 13:15:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:15:26,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:26,443 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:26,443 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:26,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash -247152933, now seen corresponding path program 12 times [2018-10-15 13:15:26,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:26,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:26,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:15:26,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:15:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:15:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:15:26,694 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 29 states. [2018-10-15 13:15:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:27,346 INFO L93 Difference]: Finished difference Result 370 states and 386 transitions. [2018-10-15 13:15:27,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:15:27,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 127 [2018-10-15 13:15:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:27,347 INFO L225 Difference]: With dead ends: 370 [2018-10-15 13:15:27,347 INFO L226 Difference]: Without dead ends: 364 [2018-10-15 13:15:27,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:15:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-15 13:15:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 260. [2018-10-15 13:15:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 13:15:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 13:15:27,352 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 13:15:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:27,352 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 13:15:27,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:15:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 13:15:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:15:27,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:27,353 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:27,353 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:27,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1396581715, now seen corresponding path program 78 times [2018-10-15 13:15:27,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:27,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:27,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:27,664 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 31 states. [2018-10-15 13:15:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:28,386 INFO L93 Difference]: Finished difference Result 619 states and 635 transitions. [2018-10-15 13:15:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:15:28,387 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 127 [2018-10-15 13:15:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:28,388 INFO L225 Difference]: With dead ends: 619 [2018-10-15 13:15:28,388 INFO L226 Difference]: Without dead ends: 613 [2018-10-15 13:15:28,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=920, Invalid=2862, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:15:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-10-15 13:15:28,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 260. [2018-10-15 13:15:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 13:15:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 13:15:28,392 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 13:15:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:28,393 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 13:15:28,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 13:15:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:15:28,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:28,393 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:28,394 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:28,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:28,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1161386241, now seen corresponding path program 79 times [2018-10-15 13:15:28,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:28,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:28,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:28,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:28,702 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 33 states. [2018-10-15 13:15:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:29,508 INFO L93 Difference]: Finished difference Result 691 states and 707 transitions. [2018-10-15 13:15:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:15:29,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 127 [2018-10-15 13:15:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:29,509 INFO L225 Difference]: With dead ends: 691 [2018-10-15 13:15:29,510 INFO L226 Difference]: Without dead ends: 685 [2018-10-15 13:15:29,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1047, Invalid=3645, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:15:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-15 13:15:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 260. [2018-10-15 13:15:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 13:15:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 13:15:29,514 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 13:15:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:29,514 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 13:15:29,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 13:15:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:15:29,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:29,515 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:29,515 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:29,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1563837393, now seen corresponding path program 80 times [2018-10-15 13:15:29,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:29,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:29,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:29,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:29,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:29,894 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 35 states. [2018-10-15 13:15:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:31,465 INFO L93 Difference]: Finished difference Result 695 states and 711 transitions. [2018-10-15 13:15:31,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:15:31,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 127 [2018-10-15 13:15:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:31,467 INFO L225 Difference]: With dead ends: 695 [2018-10-15 13:15:31,467 INFO L226 Difference]: Without dead ends: 689 [2018-10-15 13:15:31,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1238, Invalid=4462, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:15:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-10-15 13:15:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 260. [2018-10-15 13:15:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 13:15:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 13:15:31,472 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 13:15:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:31,472 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 13:15:31,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 13:15:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:15:31,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:31,473 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:31,473 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:31,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 779866403, now seen corresponding path program 81 times [2018-10-15 13:15:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:31,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:31,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:15:31,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:15:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:15:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:15:31,891 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 37 states. [2018-10-15 13:15:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:32,884 INFO L93 Difference]: Finished difference Result 659 states and 675 transitions. [2018-10-15 13:15:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:15:32,885 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-10-15 13:15:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:32,886 INFO L225 Difference]: With dead ends: 659 [2018-10-15 13:15:32,886 INFO L226 Difference]: Without dead ends: 653 [2018-10-15 13:15:32,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1493, Invalid=5313, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:15:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-15 13:15:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 260. [2018-10-15 13:15:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 13:15:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 276 transitions. [2018-10-15 13:15:32,891 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 276 transitions. Word has length 127 [2018-10-15 13:15:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:32,891 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 276 transitions. [2018-10-15 13:15:32,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:15:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2018-10-15 13:15:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 13:15:32,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:32,892 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 3, 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] [2018-10-15 13:15:32,892 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:32,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1282773259, now seen corresponding path program 82 times [2018-10-15 13:15:32,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 0 proven. 673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:33,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:33,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:15:33,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:15:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:15:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:15:33,343 INFO L87 Difference]: Start difference. First operand 260 states and 276 transitions. Second operand 39 states. [2018-10-15 13:15:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:34,665 INFO L93 Difference]: Finished difference Result 560 states and 577 transitions. [2018-10-15 13:15:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:15:34,665 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2018-10-15 13:15:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:34,666 INFO L225 Difference]: With dead ends: 560 [2018-10-15 13:15:34,666 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 13:15:34,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1812, Invalid=6198, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:15:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 13:15:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 266. [2018-10-15 13:15:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:34,671 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 127 [2018-10-15 13:15:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:34,671 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:34,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:15:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:34,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:34,672 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:34,672 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:34,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash 425340635, now seen corresponding path program 83 times [2018-10-15 13:15:34,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:34,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:34,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:34,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:34,972 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 31 states. [2018-10-15 13:15:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:35,914 INFO L93 Difference]: Finished difference Result 566 states and 583 transitions. [2018-10-15 13:15:35,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:15:35,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 130 [2018-10-15 13:15:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:35,916 INFO L225 Difference]: With dead ends: 566 [2018-10-15 13:15:35,916 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 13:15:35,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=936, Invalid=2724, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:15:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 13:15:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 266. [2018-10-15 13:15:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:35,920 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 13:15:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:35,921 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:35,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:35,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:35,922 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:35,922 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:35,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1434525385, now seen corresponding path program 84 times [2018-10-15 13:15:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:36,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:36,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:36,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:36,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:36,430 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 33 states. [2018-10-15 13:15:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:37,212 INFO L93 Difference]: Finished difference Result 674 states and 691 transitions. [2018-10-15 13:15:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:15:37,212 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2018-10-15 13:15:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:37,214 INFO L225 Difference]: With dead ends: 674 [2018-10-15 13:15:37,214 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 13:15:37,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1042, Invalid=3514, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:15:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 13:15:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 266. [2018-10-15 13:15:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:37,218 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 13:15:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:37,218 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:37,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:37,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:37,219 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 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] [2018-10-15 13:15:37,219 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:37,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:37,220 INFO L82 PathProgramCache]: Analyzing trace with hash 622841399, now seen corresponding path program 85 times [2018-10-15 13:15:37,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:37,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:37,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:37,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:37,608 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 35 states. [2018-10-15 13:15:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:38,603 INFO L93 Difference]: Finished difference Result 710 states and 727 transitions. [2018-10-15 13:15:38,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:15:38,603 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 130 [2018-10-15 13:15:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:38,605 INFO L225 Difference]: With dead ends: 710 [2018-10-15 13:15:38,605 INFO L226 Difference]: Without dead ends: 704 [2018-10-15 13:15:38,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1212, Invalid=4338, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:15:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2018-10-15 13:15:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 266. [2018-10-15 13:15:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:38,609 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 13:15:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:38,610 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:38,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:38,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:38,610 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 6, 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] [2018-10-15 13:15:38,611 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:38,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1538319067, now seen corresponding path program 86 times [2018-10-15 13:15:38,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:38,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:38,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:15:38,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:15:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:15:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:15:38,976 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 37 states. [2018-10-15 13:15:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:40,132 INFO L93 Difference]: Finished difference Result 696 states and 713 transitions. [2018-10-15 13:15:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:15:40,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 130 [2018-10-15 13:15:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:40,134 INFO L225 Difference]: With dead ends: 696 [2018-10-15 13:15:40,134 INFO L226 Difference]: Without dead ends: 690 [2018-10-15 13:15:40,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1446, Invalid=5196, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:15:40,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-10-15 13:15:40,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 266. [2018-10-15 13:15:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:40,140 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 13:15:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:40,140 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:40,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:15:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:40,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:40,141 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 4, 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] [2018-10-15 13:15:40,141 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:40,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:40,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1570761619, now seen corresponding path program 87 times [2018-10-15 13:15:40,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 607 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:40,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:40,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:15:40,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:15:40,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:15:40,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:15:40,741 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 39 states. [2018-10-15 13:15:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:42,099 INFO L93 Difference]: Finished difference Result 624 states and 641 transitions. [2018-10-15 13:15:42,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:15:42,099 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 130 [2018-10-15 13:15:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:42,100 INFO L225 Difference]: With dead ends: 624 [2018-10-15 13:15:42,100 INFO L226 Difference]: Without dead ends: 618 [2018-10-15 13:15:42,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1744, Invalid=6088, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:15:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-15 13:15:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 266. [2018-10-15 13:15:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:42,106 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 130 [2018-10-15 13:15:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:42,106 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:42,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:15:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 13:15:42,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:42,107 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:42,107 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:42,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1993667489, now seen corresponding path program 88 times [2018-10-15 13:15:42,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:42,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:42,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:42,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:42,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:42,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:42,400 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 31 states. [2018-10-15 13:15:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:43,108 INFO L93 Difference]: Finished difference Result 489 states and 506 transitions. [2018-10-15 13:15:43,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:15:43,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 133 [2018-10-15 13:15:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:43,109 INFO L225 Difference]: With dead ends: 489 [2018-10-15 13:15:43,110 INFO L226 Difference]: Without dead ends: 483 [2018-10-15 13:15:43,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=960, Invalid=2580, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:15:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-15 13:15:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 266. [2018-10-15 13:15:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:43,115 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 13:15:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:43,115 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:43,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 13:15:43,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:43,116 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:43,116 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:43,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:43,117 INFO L82 PathProgramCache]: Analyzing trace with hash 844238707, now seen corresponding path program 89 times [2018-10-15 13:15:43,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:43,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:43,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:43,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:43,464 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 33 states. [2018-10-15 13:15:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:44,445 INFO L93 Difference]: Finished difference Result 633 states and 650 transitions. [2018-10-15 13:15:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:15:44,446 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 133 [2018-10-15 13:15:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:44,447 INFO L225 Difference]: With dead ends: 633 [2018-10-15 13:15:44,448 INFO L226 Difference]: Without dead ends: 627 [2018-10-15 13:15:44,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1045, Invalid=3377, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:15:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-15 13:15:44,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 266. [2018-10-15 13:15:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:44,453 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 13:15:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:44,453 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:44,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 13:15:44,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:44,454 INFO L375 BasicCegarLoop]: trace histogram [9, 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] [2018-10-15 13:15:44,454 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:44,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1079434181, now seen corresponding path program 90 times [2018-10-15 13:15:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:44,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:44,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:44,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:44,887 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 35 states. [2018-10-15 13:15:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:45,970 INFO L93 Difference]: Finished difference Result 705 states and 722 transitions. [2018-10-15 13:15:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:15:45,970 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-10-15 13:15:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:45,971 INFO L225 Difference]: With dead ends: 705 [2018-10-15 13:15:45,971 INFO L226 Difference]: Without dead ends: 699 [2018-10-15 13:15:45,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1194, Invalid=4208, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:15:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-15 13:15:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 266. [2018-10-15 13:15:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:45,975 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 13:15:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:45,975 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:45,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 13:15:45,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:45,976 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:45,976 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:45,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:45,977 INFO L82 PathProgramCache]: Analyzing trace with hash -490309481, now seen corresponding path program 91 times [2018-10-15 13:15:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:46,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:46,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:15:46,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:15:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:15:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:15:46,412 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 37 states. [2018-10-15 13:15:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:47,385 INFO L93 Difference]: Finished difference Result 709 states and 726 transitions. [2018-10-15 13:15:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:15:47,386 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 133 [2018-10-15 13:15:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:47,388 INFO L225 Difference]: With dead ends: 709 [2018-10-15 13:15:47,388 INFO L226 Difference]: Without dead ends: 703 [2018-10-15 13:15:47,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1407, Invalid=5073, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:15:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-10-15 13:15:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 266. [2018-10-15 13:15:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:47,393 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 13:15:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:47,393 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:47,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:15:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 13:15:47,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:47,394 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:47,394 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:47,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1274280471, now seen corresponding path program 92 times [2018-10-15 13:15:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:48,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:48,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:15:48,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:15:48,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:15:48,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:15:48,186 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 39 states. [2018-10-15 13:15:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:49,402 INFO L93 Difference]: Finished difference Result 673 states and 690 transitions. [2018-10-15 13:15:49,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:15:49,402 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 133 [2018-10-15 13:15:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:49,403 INFO L225 Difference]: With dead ends: 673 [2018-10-15 13:15:49,404 INFO L226 Difference]: Without dead ends: 667 [2018-10-15 13:15:49,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1684, Invalid=5972, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:15:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-15 13:15:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 266. [2018-10-15 13:15:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 13:15:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-10-15 13:15:49,408 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 133 [2018-10-15 13:15:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:49,408 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-10-15 13:15:49,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:15:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-10-15 13:15:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 13:15:49,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:49,409 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 3, 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] [2018-10-15 13:15:49,409 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:49,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 958047163, now seen corresponding path program 93 times [2018-10-15 13:15:49,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:49,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:49,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:15:49,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:15:49,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:15:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:15:49,919 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 41 states. [2018-10-15 13:15:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:51,522 INFO L93 Difference]: Finished difference Result 574 states and 592 transitions. [2018-10-15 13:15:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:15:51,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2018-10-15 13:15:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:51,524 INFO L225 Difference]: With dead ends: 574 [2018-10-15 13:15:51,524 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 13:15:51,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2025, Invalid=6905, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:15:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 13:15:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 272. [2018-10-15 13:15:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 13:15:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 290 transitions. [2018-10-15 13:15:51,528 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 290 transitions. Word has length 133 [2018-10-15 13:15:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:51,528 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 290 transitions. [2018-10-15 13:15:51,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:15:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 290 transitions. [2018-10-15 13:15:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:51,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:51,529 INFO L375 BasicCegarLoop]: trace histogram [14, 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] [2018-10-15 13:15:51,529 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:51,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash -42505241, now seen corresponding path program 13 times [2018-10-15 13:15:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 0 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:51,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:51,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:15:51,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:15:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:15:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:15:51,838 INFO L87 Difference]: Start difference. First operand 272 states and 290 transitions. Second operand 31 states. [2018-10-15 13:15:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:52,543 INFO L93 Difference]: Finished difference Result 403 states and 421 transitions. [2018-10-15 13:15:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:15:52,544 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 136 [2018-10-15 13:15:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:52,545 INFO L225 Difference]: With dead ends: 403 [2018-10-15 13:15:52,545 INFO L226 Difference]: Without dead ends: 397 [2018-10-15 13:15:52,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:15:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-15 13:15:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 284. [2018-10-15 13:15:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:15:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:15:52,549 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 13:15:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:52,549 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:15:52,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:15:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:15:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:52,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:52,550 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:52,550 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:52,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash 29850709, now seen corresponding path program 94 times [2018-10-15 13:15:52,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:52,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:52,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:15:52,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:15:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:15:52,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:15:52,877 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 33 states. [2018-10-15 13:15:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:53,656 INFO L93 Difference]: Finished difference Result 679 states and 697 transitions. [2018-10-15 13:15:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:15:53,656 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-15 13:15:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:53,657 INFO L225 Difference]: With dead ends: 679 [2018-10-15 13:15:53,657 INFO L226 Difference]: Without dead ends: 673 [2018-10-15 13:15:53,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1056, Invalid=3234, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:15:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-15 13:15:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 284. [2018-10-15 13:15:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:15:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:15:53,662 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 13:15:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:53,662 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:15:53,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:15:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:15:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:53,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:53,663 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:53,663 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:53,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1039035459, now seen corresponding path program 95 times [2018-10-15 13:15:53,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:54,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:54,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:15:54,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:15:54,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:15:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:15:54,020 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 35 states. [2018-10-15 13:15:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:54,889 INFO L93 Difference]: Finished difference Result 769 states and 787 transitions. [2018-10-15 13:15:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:15:54,890 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-10-15 13:15:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:54,891 INFO L225 Difference]: With dead ends: 769 [2018-10-15 13:15:54,891 INFO L226 Difference]: Without dead ends: 763 [2018-10-15 13:15:54,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1184, Invalid=4072, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:15:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-10-15 13:15:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 284. [2018-10-15 13:15:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:15:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:15:54,895 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 13:15:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:54,895 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:15:54,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:15:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:15:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:54,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:54,896 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 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] [2018-10-15 13:15:54,896 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:54,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 227351473, now seen corresponding path program 96 times [2018-10-15 13:15:54,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:55,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:55,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:15:55,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:15:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:15:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:15:55,261 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 37 states. [2018-10-15 13:15:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:56,531 INFO L93 Difference]: Finished difference Result 787 states and 805 transitions. [2018-10-15 13:15:56,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:15:56,531 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 136 [2018-10-15 13:15:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:56,532 INFO L225 Difference]: With dead ends: 787 [2018-10-15 13:15:56,532 INFO L226 Difference]: Without dead ends: 781 [2018-10-15 13:15:56,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1376, Invalid=4944, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:15:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-10-15 13:15:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 284. [2018-10-15 13:15:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:15:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:15:56,537 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 13:15:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:56,537 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:15:56,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:15:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:15:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:56,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:56,538 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 6, 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] [2018-10-15 13:15:56,538 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:56,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1933808993, now seen corresponding path program 97 times [2018-10-15 13:15:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:56,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:15:56,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:15:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:15:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:15:56,984 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 39 states. [2018-10-15 13:15:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:58,160 INFO L93 Difference]: Finished difference Result 764 states and 782 transitions. [2018-10-15 13:15:58,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:15:58,160 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 136 [2018-10-15 13:15:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:58,161 INFO L225 Difference]: With dead ends: 764 [2018-10-15 13:15:58,161 INFO L226 Difference]: Without dead ends: 758 [2018-10-15 13:15:58,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1632, Invalid=5850, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:15:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-15 13:15:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 284. [2018-10-15 13:15:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:15:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:15:58,166 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 13:15:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:58,166 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:15:58,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:15:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:15:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:15:58,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:58,167 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 4, 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] [2018-10-15 13:15:58,168 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:58,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1175271693, now seen corresponding path program 98 times [2018-10-15 13:15:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:58,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:58,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:15:58,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:15:58,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:15:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:15:58,675 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 41 states. [2018-10-15 13:16:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:00,042 INFO L93 Difference]: Finished difference Result 674 states and 692 transitions. [2018-10-15 13:16:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:16:00,043 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 136 [2018-10-15 13:16:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:00,043 INFO L225 Difference]: With dead ends: 674 [2018-10-15 13:16:00,044 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 13:16:00,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1952, Invalid=6790, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:16:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 13:16:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 284. [2018-10-15 13:16:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:16:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:16:00,047 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 136 [2018-10-15 13:16:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:00,048 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:16:00,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:16:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:16:00,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:00,048 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:00,048 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:00,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:00,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1048574951, now seen corresponding path program 99 times [2018-10-15 13:16:00,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 0 proven. 628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:00,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:00,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:16:00,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:16:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:16:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:16:00,387 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 33 states. [2018-10-15 13:16:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:01,114 INFO L93 Difference]: Finished difference Result 611 states and 629 transitions. [2018-10-15 13:16:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:16:01,114 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 139 [2018-10-15 13:16:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:01,115 INFO L225 Difference]: With dead ends: 611 [2018-10-15 13:16:01,115 INFO L226 Difference]: Without dead ends: 605 [2018-10-15 13:16:01,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1075, Invalid=3085, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:16:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-15 13:16:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 284. [2018-10-15 13:16:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:16:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:16:01,118 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 13:16:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:01,119 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:16:01,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:16:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:16:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:16:01,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:01,119 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:01,120 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:01,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -100853831, now seen corresponding path program 100 times [2018-10-15 13:16:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:01,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:16:01,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:16:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:16:01,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:16:01,570 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 35 states. [2018-10-15 13:16:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:02,434 INFO L93 Difference]: Finished difference Result 737 states and 755 transitions. [2018-10-15 13:16:02,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:16:02,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-10-15 13:16:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:02,435 INFO L225 Difference]: With dead ends: 737 [2018-10-15 13:16:02,435 INFO L226 Difference]: Without dead ends: 731 [2018-10-15 13:16:02,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1182, Invalid=3930, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:16:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-10-15 13:16:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 284. [2018-10-15 13:16:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:16:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:16:02,439 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 13:16:02,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:02,439 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:16:02,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:16:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:16:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:16:02,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:02,440 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:02,440 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:02,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 134341643, now seen corresponding path program 101 times [2018-10-15 13:16:02,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:02,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:02,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:16:02,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:16:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:16:02,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:16:02,807 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 37 states. [2018-10-15 13:16:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:03,772 INFO L93 Difference]: Finished difference Result 791 states and 809 transitions. [2018-10-15 13:16:03,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:16:03,773 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 139 [2018-10-15 13:16:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:03,774 INFO L225 Difference]: With dead ends: 791 [2018-10-15 13:16:03,774 INFO L226 Difference]: Without dead ends: 785 [2018-10-15 13:16:03,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1353, Invalid=4809, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:16:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-15 13:16:03,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 284. [2018-10-15 13:16:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:16:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:16:03,778 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 13:16:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:03,778 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:16:03,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:16:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:16:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:16:03,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:03,779 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:03,779 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:03,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:03,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1435402019, now seen corresponding path program 102 times [2018-10-15 13:16:03,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 0 proven. 499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:04,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:04,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:16:04,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:16:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:16:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:16:04,186 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 39 states. [2018-10-15 13:16:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:05,338 INFO L93 Difference]: Finished difference Result 786 states and 804 transitions. [2018-10-15 13:16:05,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:16:05,339 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 139 [2018-10-15 13:16:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:05,340 INFO L225 Difference]: With dead ends: 786 [2018-10-15 13:16:05,340 INFO L226 Difference]: Without dead ends: 780 [2018-10-15 13:16:05,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1588, Invalid=5722, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:16:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-10-15 13:16:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 284. [2018-10-15 13:16:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:16:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:16:05,344 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 13:16:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:05,344 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:16:05,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:16:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:16:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:16:05,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:05,344 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:05,345 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:05,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:05,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2075594287, now seen corresponding path program 103 times [2018-10-15 13:16:05,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 0 proven. 636 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:05,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:05,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:16:05,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:16:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:16:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:16:05,800 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 41 states. [2018-10-15 13:16:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:07,310 INFO L93 Difference]: Finished difference Result 732 states and 750 transitions. [2018-10-15 13:16:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:16:07,311 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 139 [2018-10-15 13:16:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:07,312 INFO L225 Difference]: With dead ends: 732 [2018-10-15 13:16:07,312 INFO L226 Difference]: Without dead ends: 726 [2018-10-15 13:16:07,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1887, Invalid=6669, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:16:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-10-15 13:16:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 284. [2018-10-15 13:16:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 13:16:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 302 transitions. [2018-10-15 13:16:07,316 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 302 transitions. Word has length 139 [2018-10-15 13:16:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:07,316 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 302 transitions. [2018-10-15 13:16:07,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 302 transitions. [2018-10-15 13:16:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 13:16:07,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:07,317 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 3, 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] [2018-10-15 13:16:07,317 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:07,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash 12954625, now seen corresponding path program 104 times [2018-10-15 13:16:07,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:07,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:07,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:16:07,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:16:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:16:07,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:16:07,931 INFO L87 Difference]: Start difference. First operand 284 states and 302 transitions. Second operand 43 states. [2018-10-15 13:16:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:09,502 INFO L93 Difference]: Finished difference Result 615 states and 634 transitions. [2018-10-15 13:16:09,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:16:09,502 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 139 [2018-10-15 13:16:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:09,503 INFO L225 Difference]: With dead ends: 615 [2018-10-15 13:16:09,503 INFO L226 Difference]: Without dead ends: 609 [2018-10-15 13:16:09,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2250, Invalid=7650, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 13:16:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-10-15 13:16:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 290. [2018-10-15 13:16:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:09,507 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 139 [2018-10-15 13:16:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:09,508 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:09,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:16:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:09,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:09,508 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:09,508 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:09,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:09,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1783679519, now seen corresponding path program 105 times [2018-10-15 13:16:09,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:16:09,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:16:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:16:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:16:09,831 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 33 states. [2018-10-15 13:16:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:10,609 INFO L93 Difference]: Finished difference Result 531 states and 550 transitions. [2018-10-15 13:16:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:16:10,610 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 142 [2018-10-15 13:16:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:10,611 INFO L225 Difference]: With dead ends: 531 [2018-10-15 13:16:10,611 INFO L226 Difference]: Without dead ends: 525 [2018-10-15 13:16:10,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1102, Invalid=2930, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:16:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-15 13:16:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 290. [2018-10-15 13:16:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:10,614 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 13:16:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:10,615 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:10,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:16:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:10,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:10,615 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:10,616 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:10,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:10,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1711323569, now seen corresponding path program 106 times [2018-10-15 13:16:10,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:10,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:10,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:16:10,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:16:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:16:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:16:10,960 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 35 states. [2018-10-15 13:16:11,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:11,982 INFO L93 Difference]: Finished difference Result 693 states and 712 transitions. [2018-10-15 13:16:11,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:16:11,982 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-15 13:16:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:11,983 INFO L225 Difference]: With dead ends: 693 [2018-10-15 13:16:11,983 INFO L226 Difference]: Without dead ends: 687 [2018-10-15 13:16:11,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1188, Invalid=3782, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:16:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-15 13:16:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 290. [2018-10-15 13:16:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:11,988 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 13:16:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:11,988 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:11,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:16:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:11,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:11,989 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:11,989 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:11,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:11,989 INFO L82 PathProgramCache]: Analyzing trace with hash -702138819, now seen corresponding path program 107 times [2018-10-15 13:16:11,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:12,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:12,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:16:12,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:16:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:16:12,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:16:12,369 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 37 states. [2018-10-15 13:16:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:13,328 INFO L93 Difference]: Finished difference Result 783 states and 802 transitions. [2018-10-15 13:16:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:16:13,328 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-10-15 13:16:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:13,329 INFO L225 Difference]: With dead ends: 783 [2018-10-15 13:16:13,329 INFO L226 Difference]: Without dead ends: 777 [2018-10-15 13:16:13,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1338, Invalid=4668, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:16:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-10-15 13:16:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 290. [2018-10-15 13:16:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:13,334 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 13:16:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:13,334 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:13,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:16:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:13,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:13,335 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 8, 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] [2018-10-15 13:16:13,335 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:13,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:13,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1513822805, now seen corresponding path program 108 times [2018-10-15 13:16:13,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:13,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:13,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:16:13,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:16:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:16:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:16:13,733 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 39 states. [2018-10-15 13:16:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:14,818 INFO L93 Difference]: Finished difference Result 801 states and 820 transitions. [2018-10-15 13:16:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:16:14,819 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 142 [2018-10-15 13:16:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:14,820 INFO L225 Difference]: With dead ends: 801 [2018-10-15 13:16:14,820 INFO L226 Difference]: Without dead ends: 795 [2018-10-15 13:16:14,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1552, Invalid=5588, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:16:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-15 13:16:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 290. [2018-10-15 13:16:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:14,824 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 13:16:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:14,824 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:14,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:16:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:14,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:14,825 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 6, 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] [2018-10-15 13:16:14,825 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:14,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash 619984025, now seen corresponding path program 109 times [2018-10-15 13:16:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:15,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:15,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:16:15,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:16:15,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:16:15,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:16:15,263 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 41 states. [2018-10-15 13:16:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:16,777 INFO L93 Difference]: Finished difference Result 778 states and 797 transitions. [2018-10-15 13:16:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:16:16,777 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-10-15 13:16:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:16,778 INFO L225 Difference]: With dead ends: 778 [2018-10-15 13:16:16,778 INFO L226 Difference]: Without dead ends: 772 [2018-10-15 13:16:16,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=6542, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:16:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-10-15 13:16:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 290. [2018-10-15 13:16:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:16,783 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 13:16:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:16,783 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:16,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:16,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:16,784 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 4, 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] [2018-10-15 13:16:16,784 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:16,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash -565902585, now seen corresponding path program 110 times [2018-10-15 13:16:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:17,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:17,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:16:17,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:16:17,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:16:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1410, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:16:17,343 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 43 states. [2018-10-15 13:16:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:18,829 INFO L93 Difference]: Finished difference Result 688 states and 707 transitions. [2018-10-15 13:16:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:16:18,829 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 142 [2018-10-15 13:16:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:18,830 INFO L225 Difference]: With dead ends: 688 [2018-10-15 13:16:18,830 INFO L226 Difference]: Without dead ends: 682 [2018-10-15 13:16:18,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1986 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2172, Invalid=7530, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:16:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-10-15 13:16:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 290. [2018-10-15 13:16:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 13:16:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 309 transitions. [2018-10-15 13:16:18,835 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 309 transitions. Word has length 142 [2018-10-15 13:16:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:18,835 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 309 transitions. [2018-10-15 13:16:18,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:16:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 309 transitions. [2018-10-15 13:16:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:18,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:18,836 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:18,836 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:18,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1637307301, now seen corresponding path program 14 times [2018-10-15 13:16:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:19,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:19,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:16:19,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:16:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:16:19,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:16:19,146 INFO L87 Difference]: Start difference. First operand 290 states and 309 transitions. Second operand 33 states. [2018-10-15 13:16:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:19,777 INFO L93 Difference]: Finished difference Result 430 states and 449 transitions. [2018-10-15 13:16:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:16:19,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 145 [2018-10-15 13:16:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:19,778 INFO L225 Difference]: With dead ends: 430 [2018-10-15 13:16:19,778 INFO L226 Difference]: Without dead ends: 424 [2018-10-15 13:16:19,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:16:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-15 13:16:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 302. [2018-10-15 13:16:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:16:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 13:16:19,782 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 13:16:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:19,782 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 13:16:19,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:16:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 13:16:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:19,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:19,783 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:19,783 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:19,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash 45692845, now seen corresponding path program 111 times [2018-10-15 13:16:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:20,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:20,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:16:20,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:16:20,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:16:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:16:20,123 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 35 states. [2018-10-15 13:16:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:20,931 INFO L93 Difference]: Finished difference Result 733 states and 752 transitions. [2018-10-15 13:16:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:16:20,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-10-15 13:16:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:20,933 INFO L225 Difference]: With dead ends: 733 [2018-10-15 13:16:20,933 INFO L226 Difference]: Without dead ends: 727 [2018-10-15 13:16:20,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1202, Invalid=3628, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:16:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-15 13:16:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 302. [2018-10-15 13:16:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:16:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 13:16:20,937 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 13:16:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:20,937 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 13:16:20,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:16:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 13:16:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:20,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:20,938 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:20,938 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:20,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1103735937, now seen corresponding path program 112 times [2018-10-15 13:16:20,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 527 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:21,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:21,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:16:21,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:16:21,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:16:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:16:21,308 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 37 states. [2018-10-15 13:16:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:22,442 INFO L93 Difference]: Finished difference Result 841 states and 860 transitions. [2018-10-15 13:16:22,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:16:22,443 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 145 [2018-10-15 13:16:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:22,444 INFO L225 Difference]: With dead ends: 841 [2018-10-15 13:16:22,444 INFO L226 Difference]: Without dead ends: 835 [2018-10-15 13:16:22,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1331, Invalid=4521, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:16:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-10-15 13:16:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 302. [2018-10-15 13:16:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:16:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 13:16:22,450 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 13:16:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:22,450 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 13:16:22,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:16:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 13:16:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:22,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:22,451 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:22,451 INFO L424 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:22,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash -868540463, now seen corresponding path program 113 times [2018-10-15 13:16:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:22,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:22,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:16:22,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:16:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:16:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:16:22,874 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 39 states. [2018-10-15 13:16:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:23,967 INFO L93 Difference]: Finished difference Result 877 states and 896 transitions. [2018-10-15 13:16:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:16:23,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 145 [2018-10-15 13:16:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:23,969 INFO L225 Difference]: With dead ends: 877 [2018-10-15 13:16:23,969 INFO L226 Difference]: Without dead ends: 871 [2018-10-15 13:16:23,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1524, Invalid=5448, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:16:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-15 13:16:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 302. [2018-10-15 13:16:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:16:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 13:16:23,974 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 13:16:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:23,974 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 13:16:23,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:16:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 13:16:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:23,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:23,974 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:23,975 INFO L424 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:23,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1856683171, now seen corresponding path program 114 times [2018-10-15 13:16:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 0 proven. 567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:24,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:24,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:16:24,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:16:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:16:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:16:24,436 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 41 states. [2018-10-15 13:16:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:25,615 INFO L93 Difference]: Finished difference Result 863 states and 882 transitions. [2018-10-15 13:16:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:16:25,615 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 145 [2018-10-15 13:16:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:25,616 INFO L225 Difference]: With dead ends: 863 [2018-10-15 13:16:25,616 INFO L226 Difference]: Without dead ends: 857 [2018-10-15 13:16:25,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1781, Invalid=6409, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:16:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-10-15 13:16:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 302. [2018-10-15 13:16:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:16:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 13:16:25,621 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 13:16:25,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:25,621 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 13:16:25,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 13:16:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:25,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:25,622 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:25,622 INFO L424 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:25,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1072712181, now seen corresponding path program 115 times [2018-10-15 13:16:25,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:26,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:26,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:16:26,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:16:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:16:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:16:26,242 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 43 states. [2018-10-15 13:16:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:27,932 INFO L93 Difference]: Finished difference Result 791 states and 810 transitions. [2018-10-15 13:16:27,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:16:27,933 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 145 [2018-10-15 13:16:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:27,933 INFO L225 Difference]: With dead ends: 791 [2018-10-15 13:16:27,934 INFO L226 Difference]: Without dead ends: 785 [2018-10-15 13:16:27,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2102, Invalid=7404, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 13:16:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-15 13:16:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 302. [2018-10-15 13:16:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 13:16:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 321 transitions. [2018-10-15 13:16:27,938 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 321 transitions. Word has length 145 [2018-10-15 13:16:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:27,938 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 321 transitions. [2018-10-15 13:16:27,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:16:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 321 transitions. [2018-10-15 13:16:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 13:16:27,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:27,939 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 3, 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] [2018-10-15 13:16:27,939 INFO L424 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:27,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash -989927481, now seen corresponding path program 116 times [2018-10-15 13:16:27,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 0 proven. 967 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:28,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:28,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:16:28,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:16:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:16:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1529, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:16:28,521 INFO L87 Difference]: Start difference. First operand 302 states and 321 transitions. Second operand 45 states. [2018-10-15 13:16:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:30,205 INFO L93 Difference]: Finished difference Result 656 states and 676 transitions. [2018-10-15 13:16:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:16:30,205 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 145 [2018-10-15 13:16:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:30,206 INFO L225 Difference]: With dead ends: 656 [2018-10-15 13:16:30,206 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 13:16:30,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2487, Invalid=8433, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:16:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 13:16:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 308. [2018-10-15 13:16:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:30,210 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 145 [2018-10-15 13:16:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:30,211 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:30,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:16:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:30,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:30,211 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:30,211 INFO L424 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:30,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1442978907, now seen corresponding path program 117 times [2018-10-15 13:16:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 0 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:30,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:30,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:16:30,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:16:30,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:16:30,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=924, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:16:30,590 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 35 states. [2018-10-15 13:16:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:31,445 INFO L93 Difference]: Finished difference Result 662 states and 682 transitions. [2018-10-15 13:16:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:16:31,446 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 148 [2018-10-15 13:16:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:31,446 INFO L225 Difference]: With dead ends: 662 [2018-10-15 13:16:31,447 INFO L226 Difference]: Without dead ends: 656 [2018-10-15 13:16:31,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:16:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-10-15 13:16:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 308. [2018-10-15 13:16:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:31,450 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 13:16:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:31,451 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:31,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:16:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:31,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:31,451 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:31,451 INFO L424 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:31,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1515334857, now seen corresponding path program 118 times [2018-10-15 13:16:31,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:32,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:32,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:16:32,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:16:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:16:32,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:16:32,242 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 37 states. [2018-10-15 13:16:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:33,141 INFO L93 Difference]: Finished difference Result 806 states and 826 transitions. [2018-10-15 13:16:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:16:33,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-10-15 13:16:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:33,142 INFO L225 Difference]: With dead ends: 806 [2018-10-15 13:16:33,142 INFO L226 Difference]: Without dead ends: 800 [2018-10-15 13:16:33,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1332, Invalid=4368, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:16:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-10-15 13:16:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 308. [2018-10-15 13:16:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:33,147 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 13:16:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:33,148 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:33,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:16:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:33,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:33,148 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 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] [2018-10-15 13:16:33,148 INFO L424 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:33,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1770447689, now seen corresponding path program 119 times [2018-10-15 13:16:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:33,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:33,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:16:33,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:16:33,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:16:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:16:33,560 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 39 states. [2018-10-15 13:16:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:34,616 INFO L93 Difference]: Finished difference Result 878 states and 898 transitions. [2018-10-15 13:16:34,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:16:34,616 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-10-15 13:16:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:34,617 INFO L225 Difference]: With dead ends: 878 [2018-10-15 13:16:34,617 INFO L226 Difference]: Without dead ends: 872 [2018-10-15 13:16:34,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1504, Invalid=5302, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:16:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2018-10-15 13:16:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 308. [2018-10-15 13:16:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:34,621 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 13:16:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:34,622 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:34,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:16:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:34,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:34,622 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 8, 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] [2018-10-15 13:16:34,622 INFO L424 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:34,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:34,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1712835621, now seen corresponding path program 120 times [2018-10-15 13:16:34,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:35,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:35,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:16:35,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:16:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:16:35,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:16:35,077 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 41 states. [2018-10-15 13:16:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:36,194 INFO L93 Difference]: Finished difference Result 882 states and 902 transitions. [2018-10-15 13:16:36,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:16:36,194 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 148 [2018-10-15 13:16:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:36,195 INFO L225 Difference]: With dead ends: 882 [2018-10-15 13:16:36,195 INFO L226 Difference]: Without dead ends: 876 [2018-10-15 13:16:36,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1740, Invalid=6270, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:16:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-10-15 13:16:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 308. [2018-10-15 13:16:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:36,200 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 13:16:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:36,200 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:36,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:36,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:36,201 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 6, 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] [2018-10-15 13:16:36,201 INFO L424 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:36,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash -448324845, now seen corresponding path program 121 times [2018-10-15 13:16:36,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 0 proven. 674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:36,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:36,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:16:36,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:16:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:16:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:16:36,896 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 43 states. [2018-10-15 13:16:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:38,429 INFO L93 Difference]: Finished difference Result 846 states and 866 transitions. [2018-10-15 13:16:38,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:16:38,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 148 [2018-10-15 13:16:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:38,431 INFO L225 Difference]: With dead ends: 846 [2018-10-15 13:16:38,431 INFO L226 Difference]: Without dead ends: 840 [2018-10-15 13:16:38,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2040, Invalid=7272, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:16:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-10-15 13:16:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 308. [2018-10-15 13:16:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:38,436 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 13:16:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:38,436 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:38,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:16:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:16:38,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:38,436 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 4, 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] [2018-10-15 13:16:38,437 INFO L424 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:38,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1634211455, now seen corresponding path program 122 times [2018-10-15 13:16:38,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 0 proven. 883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:38,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:38,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:16:38,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:16:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:16:38,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=1544, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:16:38,966 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 45 states. [2018-10-15 13:16:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:40,492 INFO L93 Difference]: Finished difference Result 738 states and 758 transitions. [2018-10-15 13:16:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:16:40,492 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 148 [2018-10-15 13:16:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:40,493 INFO L225 Difference]: With dead ends: 738 [2018-10-15 13:16:40,493 INFO L226 Difference]: Without dead ends: 732 [2018-10-15 13:16:40,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2404, Invalid=8308, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:16:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-10-15 13:16:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 308. [2018-10-15 13:16:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:40,497 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 148 [2018-10-15 13:16:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:40,498 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:40,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:16:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:40,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:40,498 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:40,499 INFO L424 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:40,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1919190111, now seen corresponding path program 123 times [2018-10-15 13:16:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:40,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:40,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:16:40,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:16:40,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:16:40,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:16:40,873 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 35 states. [2018-10-15 13:16:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:41,776 INFO L93 Difference]: Finished difference Result 567 states and 587 transitions. [2018-10-15 13:16:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:16:41,777 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 151 [2018-10-15 13:16:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:41,777 INFO L225 Difference]: With dead ends: 567 [2018-10-15 13:16:41,778 INFO L226 Difference]: Without dead ends: 561 [2018-10-15 13:16:41,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1254, Invalid=3302, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:16:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-15 13:16:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 308. [2018-10-15 13:16:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:41,782 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 13:16:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:41,782 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:41,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:16:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:41,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:41,783 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:41,783 INFO L424 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:41,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash -236189965, now seen corresponding path program 124 times [2018-10-15 13:16:41,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 0 proven. 662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:42,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:42,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:16:42,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:16:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:16:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:16:42,569 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 37 states. [2018-10-15 13:16:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:43,475 INFO L93 Difference]: Finished difference Result 747 states and 767 transitions. [2018-10-15 13:16:43,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:16:43,476 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 151 [2018-10-15 13:16:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:43,477 INFO L225 Difference]: With dead ends: 747 [2018-10-15 13:16:43,477 INFO L226 Difference]: Without dead ends: 741 [2018-10-15 13:16:43,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1341, Invalid=4209, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:16:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-15 13:16:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 308. [2018-10-15 13:16:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:43,481 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 13:16:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:43,482 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:43,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:16:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:43,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:43,483 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:43,483 INFO L424 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:43,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1385618747, now seen corresponding path program 125 times [2018-10-15 13:16:43,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:43,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:16:43,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:16:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:16:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1188, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:16:43,895 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 39 states. [2018-10-15 13:16:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:44,972 INFO L93 Difference]: Finished difference Result 855 states and 875 transitions. [2018-10-15 13:16:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:16:44,972 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 151 [2018-10-15 13:16:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:44,973 INFO L225 Difference]: With dead ends: 855 [2018-10-15 13:16:44,973 INFO L226 Difference]: Without dead ends: 849 [2018-10-15 13:16:44,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:16:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-15 13:16:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 308. [2018-10-15 13:16:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:44,978 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 13:16:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:44,978 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:44,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:16:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:44,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:44,979 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:44,979 INFO L424 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:44,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:44,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1150423273, now seen corresponding path program 126 times [2018-10-15 13:16:44,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:45,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:45,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:16:45,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:16:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:16:45,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:16:45,427 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 41 states. [2018-10-15 13:16:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:46,618 INFO L93 Difference]: Finished difference Result 891 states and 911 transitions. [2018-10-15 13:16:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:16:46,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 151 [2018-10-15 13:16:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:46,620 INFO L225 Difference]: With dead ends: 891 [2018-10-15 13:16:46,620 INFO L226 Difference]: Without dead ends: 885 [2018-10-15 13:16:46,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1707, Invalid=6125, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:16:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-10-15 13:16:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 308. [2018-10-15 13:16:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:46,625 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 13:16:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:46,625 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:46,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:46,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:46,625 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:46,626 INFO L424 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:46,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1574800361, now seen corresponding path program 127 times [2018-10-15 13:16:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 0 proven. 641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:47,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:47,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:16:47,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:16:47,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:16:47,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:16:47,514 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 43 states. [2018-10-15 13:16:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:48,910 INFO L93 Difference]: Finished difference Result 877 states and 897 transitions. [2018-10-15 13:16:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:16:48,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 151 [2018-10-15 13:16:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:48,911 INFO L225 Difference]: With dead ends: 877 [2018-10-15 13:16:48,911 INFO L226 Difference]: Without dead ends: 871 [2018-10-15 13:16:48,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1884 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1986, Invalid=7134, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:16:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-10-15 13:16:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 308. [2018-10-15 13:16:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:48,916 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 13:16:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:48,916 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:48,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:16:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:48,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:48,917 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:48,917 INFO L424 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:48,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 790829371, now seen corresponding path program 128 times [2018-10-15 13:16:48,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 0 proven. 814 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:49,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:49,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:16:49,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:16:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:16:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:16:49,450 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 45 states. [2018-10-15 13:16:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:50,996 INFO L93 Difference]: Finished difference Result 805 states and 825 transitions. [2018-10-15 13:16:50,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:16:50,997 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 151 [2018-10-15 13:16:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:50,998 INFO L225 Difference]: With dead ends: 805 [2018-10-15 13:16:50,998 INFO L226 Difference]: Without dead ends: 799 [2018-10-15 13:16:50,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2329, Invalid=8177, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:16:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-10-15 13:16:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 308. [2018-10-15 13:16:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 13:16:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 328 transitions. [2018-10-15 13:16:51,003 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 328 transitions. Word has length 151 [2018-10-15 13:16:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:51,003 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 328 transitions. [2018-10-15 13:16:51,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:16:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 328 transitions. [2018-10-15 13:16:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 13:16:51,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:51,004 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 3, 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] [2018-10-15 13:16:51,004 INFO L424 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:51,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1271810291, now seen corresponding path program 129 times [2018-10-15 13:16:51,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:51,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:51,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:16:51,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:16:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:16:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:16:51,614 INFO L87 Difference]: Start difference. First operand 308 states and 328 transitions. Second operand 47 states. [2018-10-15 13:16:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:53,561 INFO L93 Difference]: Finished difference Result 670 states and 691 transitions. [2018-10-15 13:16:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:16:53,561 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 151 [2018-10-15 13:16:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:53,562 INFO L225 Difference]: With dead ends: 670 [2018-10-15 13:16:53,562 INFO L226 Difference]: Without dead ends: 664 [2018-10-15 13:16:53,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2469 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2736, Invalid=9254, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 13:16:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-15 13:16:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 314. [2018-10-15 13:16:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 13:16:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 335 transitions. [2018-10-15 13:16:53,568 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 335 transitions. Word has length 151 [2018-10-15 13:16:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:53,568 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 335 transitions. [2018-10-15 13:16:53,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:16:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 335 transitions. [2018-10-15 13:16:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:16:53,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:53,569 INFO L375 BasicCegarLoop]: trace histogram [16, 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] [2018-10-15 13:16:53,569 INFO L424 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:53,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1977176473, now seen corresponding path program 15 times [2018-10-15 13:16:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:54,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:54,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:16:54,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:16:54,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:16:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:16:54,038 INFO L87 Difference]: Start difference. First operand 314 states and 335 transitions. Second operand 35 states. [2018-10-15 13:16:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:54,829 INFO L93 Difference]: Finished difference Result 463 states and 484 transitions. [2018-10-15 13:16:54,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:16:54,830 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 154 [2018-10-15 13:16:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:54,830 INFO L225 Difference]: With dead ends: 463 [2018-10-15 13:16:54,830 INFO L226 Difference]: Without dead ends: 457 [2018-10-15 13:16:54,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:16:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-15 13:16:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 326. [2018-10-15 13:16:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:16:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:16:54,834 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:16:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:54,834 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:16:54,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:16:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:16:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:16:54,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:54,835 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:54,835 INFO L424 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:54,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash 533249877, now seen corresponding path program 130 times [2018-10-15 13:16:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:55,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:55,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:16:55,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:16:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:16:55,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:16:55,211 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 37 states. [2018-10-15 13:16:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:56,199 INFO L93 Difference]: Finished difference Result 793 states and 814 transitions. [2018-10-15 13:16:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:16:56,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 154 [2018-10-15 13:16:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:56,201 INFO L225 Difference]: With dead ends: 793 [2018-10-15 13:16:56,201 INFO L226 Difference]: Without dead ends: 787 [2018-10-15 13:16:56,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1358, Invalid=4044, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:16:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-10-15 13:16:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 326. [2018-10-15 13:16:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:16:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:16:56,205 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:16:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:56,206 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:16:56,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:16:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:16:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:16:56,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:56,206 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:56,206 INFO L424 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:56,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 605605827, now seen corresponding path program 131 times [2018-10-15 13:16:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:56,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:56,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:16:56,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:16:56,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:16:56,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:16:56,624 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 39 states. [2018-10-15 13:16:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:57,939 INFO L93 Difference]: Finished difference Result 919 states and 940 transitions. [2018-10-15 13:16:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:16:57,940 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-10-15 13:16:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:57,941 INFO L225 Difference]: With dead ends: 919 [2018-10-15 13:16:57,941 INFO L226 Difference]: Without dead ends: 913 [2018-10-15 13:16:57,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1488, Invalid=4992, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:16:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-15 13:16:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 326. [2018-10-15 13:16:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:16:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:16:57,945 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:16:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:57,945 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:16:57,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:16:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:16:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:16:57,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:57,946 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:57,946 INFO L424 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:57,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1614790577, now seen corresponding path program 132 times [2018-10-15 13:16:57,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:58,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:58,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:16:58,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:16:58,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:16:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:16:58,416 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 41 states. [2018-10-15 13:16:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:59,573 INFO L93 Difference]: Finished difference Result 973 states and 994 transitions. [2018-10-15 13:16:59,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:16:59,574 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2018-10-15 13:16:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:59,575 INFO L225 Difference]: With dead ends: 973 [2018-10-15 13:16:59,575 INFO L226 Difference]: Without dead ends: 967 [2018-10-15 13:16:59,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1682, Invalid=5974, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:16:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-15 13:16:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 326. [2018-10-15 13:16:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:16:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:16:59,579 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:16:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:59,579 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:16:59,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:16:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:16:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:16:59,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:59,580 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 8, 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] [2018-10-15 13:16:59,580 INFO L424 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:59,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:59,580 INFO L82 PathProgramCache]: Analyzing trace with hash 803106591, now seen corresponding path program 133 times [2018-10-15 13:16:59,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 623 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:00,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:00,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:17:00,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:17:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:17:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1446, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:17:00,069 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 43 states. [2018-10-15 13:17:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:01,323 INFO L93 Difference]: Finished difference Result 968 states and 989 transitions. [2018-10-15 13:17:01,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:17:01,324 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 154 [2018-10-15 13:17:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:01,325 INFO L225 Difference]: With dead ends: 968 [2018-10-15 13:17:01,325 INFO L226 Difference]: Without dead ends: 962 [2018-10-15 13:17:01,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1940, Invalid=6990, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:17:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-10-15 13:17:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 326. [2018-10-15 13:17:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:01,329 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:17:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:01,329 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:01,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:17:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:17:01,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:01,330 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 6, 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] [2018-10-15 13:17:01,331 INFO L424 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:01,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1358053875, now seen corresponding path program 134 times [2018-10-15 13:17:01,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:01,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:01,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:17:01,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:17:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:17:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:17:01,863 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 45 states. [2018-10-15 13:17:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:03,604 INFO L93 Difference]: Finished difference Result 914 states and 935 transitions. [2018-10-15 13:17:03,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:17:03,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 154 [2018-10-15 13:17:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:03,605 INFO L225 Difference]: With dead ends: 914 [2018-10-15 13:17:03,606 INFO L226 Difference]: Without dead ends: 908 [2018-10-15 13:17:03,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2262, Invalid=8040, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:17:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-10-15 13:17:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 326. [2018-10-15 13:17:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:03,610 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:17:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:03,611 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:03,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:17:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:17:03,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:03,611 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 4, 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] [2018-10-15 13:17:03,611 INFO L424 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:03,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1751026811, now seen corresponding path program 135 times [2018-10-15 13:17:03,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 987 backedges. 0 proven. 987 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:04,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:04,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:17:04,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:17:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:17:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:17:04,218 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 47 states. [2018-10-15 13:17:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:05,986 INFO L93 Difference]: Finished difference Result 788 states and 809 transitions. [2018-10-15 13:17:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:17:05,987 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 154 [2018-10-15 13:17:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:05,988 INFO L225 Difference]: With dead ends: 788 [2018-10-15 13:17:05,988 INFO L226 Difference]: Without dead ends: 782 [2018-10-15 13:17:05,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2648, Invalid=9124, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 13:17:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-10-15 13:17:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 326. [2018-10-15 13:17:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:05,992 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 154 [2018-10-15 13:17:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:05,993 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:05,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:17:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:05,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:05,993 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:05,993 INFO L424 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:05,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1881882215, now seen corresponding path program 136 times [2018-10-15 13:17:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 0 proven. 857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:06,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:17:06,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:17:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:17:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:17:06,679 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 37 states. [2018-10-15 13:17:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:07,728 INFO L93 Difference]: Finished difference Result 707 states and 728 transitions. [2018-10-15 13:17:07,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:17:07,729 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-10-15 13:17:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:07,730 INFO L225 Difference]: With dead ends: 707 [2018-10-15 13:17:07,730 INFO L226 Difference]: Without dead ends: 701 [2018-10-15 13:17:07,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1383, Invalid=3873, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:17:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-15 13:17:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 326. [2018-10-15 13:17:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:07,734 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 13:17:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:07,734 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:07,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:17:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:07,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:07,735 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:07,735 INFO L424 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:07,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash -730084935, now seen corresponding path program 137 times [2018-10-15 13:17:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:08,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:08,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:17:08,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:17:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:17:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:17:08,219 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 39 states. [2018-10-15 13:17:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:09,265 INFO L93 Difference]: Finished difference Result 869 states and 890 transitions. [2018-10-15 13:17:09,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:17:09,265 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 157 [2018-10-15 13:17:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:09,266 INFO L225 Difference]: With dead ends: 869 [2018-10-15 13:17:09,266 INFO L226 Difference]: Without dead ends: 863 [2018-10-15 13:17:09,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1492, Invalid=4828, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:17:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-10-15 13:17:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 326. [2018-10-15 13:17:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:09,271 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 13:17:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:09,271 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:09,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:17:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:09,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:09,272 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:09,272 INFO L424 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:09,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:09,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1879513717, now seen corresponding path program 138 times [2018-10-15 13:17:09,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:09,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:09,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:17:09,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:17:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:17:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:17:09,753 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 41 states. [2018-10-15 13:17:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:10,936 INFO L93 Difference]: Finished difference Result 959 states and 980 transitions. [2018-10-15 13:17:10,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:17:10,936 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-10-15 13:17:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:10,937 INFO L225 Difference]: With dead ends: 959 [2018-10-15 13:17:10,937 INFO L226 Difference]: Without dead ends: 953 [2018-10-15 13:17:10,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1665, Invalid=5817, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:17:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-15 13:17:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 326. [2018-10-15 13:17:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:10,942 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 13:17:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:10,943 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:10,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:17:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:10,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:10,944 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:10,944 INFO L424 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:10,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1644318243, now seen corresponding path program 139 times [2018-10-15 13:17:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:11,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:11,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:17:11,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:17:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:17:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:17:11,489 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 43 states. [2018-10-15 13:17:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:12,856 INFO L93 Difference]: Finished difference Result 977 states and 998 transitions. [2018-10-15 13:17:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:17:12,856 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 157 [2018-10-15 13:17:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:12,857 INFO L225 Difference]: With dead ends: 977 [2018-10-15 13:17:12,857 INFO L226 Difference]: Without dead ends: 971 [2018-10-15 13:17:12,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1902, Invalid=6840, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:17:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-15 13:17:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 326. [2018-10-15 13:17:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:12,860 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 13:17:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:12,861 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:12,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:17:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:12,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:12,861 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:12,862 INFO L424 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:12,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1080905391, now seen corresponding path program 140 times [2018-10-15 13:17:12,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 0 proven. 721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:13,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:13,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:17:13,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:17:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:17:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:17:13,516 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 45 states. [2018-10-15 13:17:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:15,003 INFO L93 Difference]: Finished difference Result 954 states and 975 transitions. [2018-10-15 13:17:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:17:15,003 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 157 [2018-10-15 13:17:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:15,004 INFO L225 Difference]: With dead ends: 954 [2018-10-15 13:17:15,005 INFO L226 Difference]: Without dead ends: 948 [2018-10-15 13:17:15,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2093 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=7897, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:17:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2018-10-15 13:17:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 326. [2018-10-15 13:17:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:15,009 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 13:17:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:15,009 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:15,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:17:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:15,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:15,010 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:15,010 INFO L424 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:15,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash 296934401, now seen corresponding path program 141 times [2018-10-15 13:17:15,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:15,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:15,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:17:15,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:17:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:17:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:17:15,733 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 47 states. [2018-10-15 13:17:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:17,337 INFO L93 Difference]: Finished difference Result 864 states and 885 transitions. [2018-10-15 13:17:17,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:17:17,338 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 157 [2018-10-15 13:17:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:17,339 INFO L225 Difference]: With dead ends: 864 [2018-10-15 13:17:17,339 INFO L226 Difference]: Without dead ends: 858 [2018-10-15 13:17:17,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2568, Invalid=8988, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:17:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-10-15 13:17:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 326. [2018-10-15 13:17:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 13:17:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 347 transitions. [2018-10-15 13:17:17,343 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 347 transitions. Word has length 157 [2018-10-15 13:17:17,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:17,343 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 347 transitions. [2018-10-15 13:17:17,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:17:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 347 transitions. [2018-10-15 13:17:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 13:17:17,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:17,344 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 3, 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] [2018-10-15 13:17:17,344 INFO L424 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:17,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1765705261, now seen corresponding path program 142 times [2018-10-15 13:17:17,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 0 proven. 1193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:18,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:17:18,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:17:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:17:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=1813, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:17:18,293 INFO L87 Difference]: Start difference. First operand 326 states and 347 transitions. Second operand 49 states. [2018-10-15 13:17:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:20,211 INFO L93 Difference]: Finished difference Result 711 states and 733 transitions. [2018-10-15 13:17:20,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:17:20,212 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 157 [2018-10-15 13:17:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:20,212 INFO L225 Difference]: With dead ends: 711 [2018-10-15 13:17:20,212 INFO L226 Difference]: Without dead ends: 705 [2018-10-15 13:17:20,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2997, Invalid=10113, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:17:20,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-10-15 13:17:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 332. [2018-10-15 13:17:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:20,216 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 157 [2018-10-15 13:17:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:20,217 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:20,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:17:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:20,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:20,217 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:20,218 INFO L424 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:20,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1044271647, now seen corresponding path program 143 times [2018-10-15 13:17:20,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 0 proven. 977 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:20,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:20,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:17:20,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:17:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:17:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:17:20,674 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 37 states. [2018-10-15 13:17:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:21,508 INFO L93 Difference]: Finished difference Result 609 states and 631 transitions. [2018-10-15 13:17:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:17:21,508 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 160 [2018-10-15 13:17:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:21,509 INFO L225 Difference]: With dead ends: 609 [2018-10-15 13:17:21,509 INFO L226 Difference]: Without dead ends: 603 [2018-10-15 13:17:21,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1416, Invalid=3696, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:17:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-15 13:17:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 332. [2018-10-15 13:17:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:21,513 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:21,513 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:21,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:17:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:21,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:21,514 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:21,514 INFO L424 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:21,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1466154703, now seen corresponding path program 144 times [2018-10-15 13:17:21,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 0 proven. 772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:21,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:21,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:17:21,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:17:21,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:17:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:17:21,962 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 39 states. [2018-10-15 13:17:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:22,819 INFO L93 Difference]: Finished difference Result 807 states and 829 transitions. [2018-10-15 13:17:22,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:17:22,820 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 160 [2018-10-15 13:17:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:22,821 INFO L225 Difference]: With dead ends: 807 [2018-10-15 13:17:22,821 INFO L226 Difference]: Without dead ends: 801 [2018-10-15 13:17:22,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1504, Invalid=4658, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:17:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-15 13:17:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 332. [2018-10-15 13:17:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:22,825 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:22,826 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:22,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:17:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:22,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:22,826 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:22,827 INFO L424 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:22,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1538510653, now seen corresponding path program 145 times [2018-10-15 13:17:22,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 657 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:23,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:23,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:17:23,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:17:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:17:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:17:23,510 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 41 states. [2018-10-15 13:17:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:24,564 INFO L93 Difference]: Finished difference Result 933 states and 955 transitions. [2018-10-15 13:17:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:17:24,565 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 160 [2018-10-15 13:17:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:24,566 INFO L225 Difference]: With dead ends: 933 [2018-10-15 13:17:24,566 INFO L226 Difference]: Without dead ends: 927 [2018-10-15 13:17:24,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1656, Invalid=5654, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:17:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-15 13:17:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 332. [2018-10-15 13:17:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:24,570 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:24,570 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:24,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:17:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:24,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:24,571 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 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] [2018-10-15 13:17:24,571 INFO L424 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:24,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1747271893, now seen corresponding path program 146 times [2018-10-15 13:17:24,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:25,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:25,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:17:25,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:17:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:17:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:17:25,098 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 43 states. [2018-10-15 13:17:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:26,352 INFO L93 Difference]: Finished difference Result 987 states and 1009 transitions. [2018-10-15 13:17:26,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:17:26,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2018-10-15 13:17:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:26,353 INFO L225 Difference]: With dead ends: 987 [2018-10-15 13:17:26,353 INFO L226 Difference]: Without dead ends: 981 [2018-10-15 13:17:26,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1797 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1872, Invalid=6684, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:17:26,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-15 13:17:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 332. [2018-10-15 13:17:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:26,359 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:26,359 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:26,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:17:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:26,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:26,360 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 8, 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] [2018-10-15 13:17:26,360 INFO L424 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:26,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1736011417, now seen corresponding path program 147 times [2018-10-15 13:17:26,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:26,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:26,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:17:26,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:17:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:17:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1584, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:17:26,900 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 45 states. [2018-10-15 13:17:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:28,439 INFO L93 Difference]: Finished difference Result 982 states and 1004 transitions. [2018-10-15 13:17:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:17:28,440 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 160 [2018-10-15 13:17:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:28,441 INFO L225 Difference]: With dead ends: 982 [2018-10-15 13:17:28,441 INFO L226 Difference]: Without dead ends: 976 [2018-10-15 13:17:28,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2152, Invalid=7748, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 13:17:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-10-15 13:17:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 332. [2018-10-15 13:17:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:28,447 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:28,447 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:28,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:17:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:28,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:28,448 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 6, 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] [2018-10-15 13:17:28,448 INFO L424 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:28,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash -425149049, now seen corresponding path program 148 times [2018-10-15 13:17:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:29,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:29,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:17:29,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:17:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:17:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:17:29,054 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 47 states. [2018-10-15 13:17:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:30,609 INFO L93 Difference]: Finished difference Result 928 states and 950 transitions. [2018-10-15 13:17:30,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:17:30,609 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 160 [2018-10-15 13:17:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:30,611 INFO L225 Difference]: With dead ends: 928 [2018-10-15 13:17:30,611 INFO L226 Difference]: Without dead ends: 922 [2018-10-15 13:17:30,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2496, Invalid=8846, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:17:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2018-10-15 13:17:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 332. [2018-10-15 13:17:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:30,617 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:30,617 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:30,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:17:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:17:30,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:30,618 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 4, 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] [2018-10-15 13:17:30,618 INFO L424 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:30,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1611035659, now seen corresponding path program 149 times [2018-10-15 13:17:30,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 0 proven. 1097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:31,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:31,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:17:31,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:17:31,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:17:31,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=1830, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:17:31,287 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 49 states. [2018-10-15 13:17:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:33,172 INFO L93 Difference]: Finished difference Result 802 states and 824 transitions. [2018-10-15 13:17:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:17:33,172 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 160 [2018-10-15 13:17:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:33,173 INFO L225 Difference]: With dead ends: 802 [2018-10-15 13:17:33,173 INFO L226 Difference]: Without dead ends: 796 [2018-10-15 13:17:33,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2904, Invalid=9978, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 13:17:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-10-15 13:17:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 332. [2018-10-15 13:17:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 13:17:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 354 transitions. [2018-10-15 13:17:33,178 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 354 transitions. Word has length 160 [2018-10-15 13:17:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:33,178 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 354 transitions. [2018-10-15 13:17:33,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:17:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 354 transitions. [2018-10-15 13:17:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:33,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:33,179 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:33,179 INFO L424 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:33,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:33,180 INFO L82 PathProgramCache]: Analyzing trace with hash -92522021, now seen corresponding path program 16 times [2018-10-15 13:17:33,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 0 proven. 1112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:33,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:33,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:17:33,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:17:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:17:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:17:33,707 INFO L87 Difference]: Start difference. First operand 332 states and 354 transitions. Second operand 37 states. [2018-10-15 13:17:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:34,467 INFO L93 Difference]: Finished difference Result 490 states and 512 transitions. [2018-10-15 13:17:34,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:17:34,467 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 163 [2018-10-15 13:17:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:34,468 INFO L225 Difference]: With dead ends: 490 [2018-10-15 13:17:34,468 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 13:17:34,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:17:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 13:17:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 344. [2018-10-15 13:17:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:34,471 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:34,472 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:34,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:17:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:34,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:34,472 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:34,472 INFO L424 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:34,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1316181165, now seen corresponding path program 150 times [2018-10-15 13:17:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 0 proven. 871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:34,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:17:34,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:17:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:17:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1160, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:17:34,886 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 39 states. [2018-10-15 13:17:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:35,837 INFO L93 Difference]: Finished difference Result 847 states and 869 transitions. [2018-10-15 13:17:35,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:17:35,844 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 163 [2018-10-15 13:17:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:35,845 INFO L225 Difference]: With dead ends: 847 [2018-10-15 13:17:35,845 INFO L226 Difference]: Without dead ends: 841 [2018-10-15 13:17:35,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1524, Invalid=4482, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:17:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-15 13:17:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 344. [2018-10-15 13:17:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:35,849 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:35,849 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:35,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:17:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:35,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:35,850 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:35,851 INFO L424 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:35,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:35,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1295785985, now seen corresponding path program 151 times [2018-10-15 13:17:35,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:36,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:36,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:17:36,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:17:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:17:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:17:36,314 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 41 states. [2018-10-15 13:17:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:37,326 INFO L93 Difference]: Finished difference Result 991 states and 1013 transitions. [2018-10-15 13:17:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:17:37,327 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163 [2018-10-15 13:17:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:37,328 INFO L225 Difference]: With dead ends: 991 [2018-10-15 13:17:37,329 INFO L226 Difference]: Without dead ends: 985 [2018-10-15 13:17:37,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1655, Invalid=5485, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:17:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-10-15 13:17:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 344. [2018-10-15 13:17:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:37,333 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:37,333 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:37,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:17:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:37,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:37,334 INFO L375 BasicCegarLoop]: trace histogram [11, 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] [2018-10-15 13:17:37,335 INFO L424 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:37,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1849752529, now seen corresponding path program 152 times [2018-10-15 13:17:37,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 0 proven. 659 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:17:37,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:17:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:17:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:17:37,976 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 43 states. [2018-10-15 13:17:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:39,291 INFO L93 Difference]: Finished difference Result 1063 states and 1085 transitions. [2018-10-15 13:17:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:17:39,291 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 163 [2018-10-15 13:17:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:39,292 INFO L225 Difference]: With dead ends: 1063 [2018-10-15 13:17:39,293 INFO L226 Difference]: Without dead ends: 1057 [2018-10-15 13:17:39,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1850, Invalid=6522, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:17:39,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-15 13:17:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 344. [2018-10-15 13:17:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:39,297 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:39,297 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:39,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:17:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:39,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:39,298 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:39,298 INFO L424 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2084948003, now seen corresponding path program 153 times [2018-10-15 13:17:39,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:39,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:39,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:17:39,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:17:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:17:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:17:39,827 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 45 states. [2018-10-15 13:17:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:41,170 INFO L93 Difference]: Finished difference Result 1067 states and 1089 transitions. [2018-10-15 13:17:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:17:41,171 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 163 [2018-10-15 13:17:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:41,172 INFO L225 Difference]: With dead ends: 1067 [2018-10-15 13:17:41,172 INFO L226 Difference]: Without dead ends: 1061 [2018-10-15 13:17:41,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2109, Invalid=7593, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:17:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-10-15 13:17:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 344. [2018-10-15 13:17:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:41,176 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:41,177 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:41,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:17:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:41,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:41,178 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:41,178 INFO L424 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:41,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash 515204341, now seen corresponding path program 154 times [2018-10-15 13:17:41,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:41,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:41,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:17:41,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:17:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:17:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:17:41,757 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 47 states. [2018-10-15 13:17:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:43,298 INFO L93 Difference]: Finished difference Result 1031 states and 1053 transitions. [2018-10-15 13:17:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:17:43,298 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 163 [2018-10-15 13:17:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:43,299 INFO L225 Difference]: With dead ends: 1031 [2018-10-15 13:17:43,300 INFO L226 Difference]: Without dead ends: 1025 [2018-10-15 13:17:43,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2432, Invalid=8698, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 13:17:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-10-15 13:17:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 344. [2018-10-15 13:17:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:43,304 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:43,304 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:43,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:17:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:43,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:43,305 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:43,305 INFO L424 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:43,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash -268766649, now seen corresponding path program 155 times [2018-10-15 13:17:43,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 0 proven. 1016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:44,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:44,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:17:44,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:17:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:17:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:17:44,226 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 49 states. [2018-10-15 13:17:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:46,015 INFO L93 Difference]: Finished difference Result 923 states and 945 transitions. [2018-10-15 13:17:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:17:46,016 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 163 [2018-10-15 13:17:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:46,017 INFO L225 Difference]: With dead ends: 923 [2018-10-15 13:17:46,017 INFO L226 Difference]: Without dead ends: 917 [2018-10-15 13:17:46,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2819, Invalid=9837, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:17:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-10-15 13:17:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 344. [2018-10-15 13:17:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 13:17:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 366 transitions. [2018-10-15 13:17:46,022 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 366 transitions. Word has length 163 [2018-10-15 13:17:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:46,023 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 366 transitions. [2018-10-15 13:17:46,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:17:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 366 transitions. [2018-10-15 13:17:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 13:17:46,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:46,024 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 3, 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] [2018-10-15 13:17:46,024 INFO L424 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:46,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1963560985, now seen corresponding path program 156 times [2018-10-15 13:17:46,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1315 backedges. 0 proven. 1315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:46,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:46,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:17:46,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:17:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:17:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=1964, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:17:46,780 INFO L87 Difference]: Start difference. First operand 344 states and 366 transitions. Second operand 51 states. [2018-10-15 13:17:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:49,011 INFO L93 Difference]: Finished difference Result 752 states and 775 transitions. [2018-10-15 13:17:49,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 13:17:49,011 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 163 [2018-10-15 13:17:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:49,012 INFO L225 Difference]: With dead ends: 752 [2018-10-15 13:17:49,012 INFO L226 Difference]: Without dead ends: 746 [2018-10-15 13:17:49,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3270, Invalid=11010, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 13:17:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-10-15 13:17:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 350. [2018-10-15 13:17:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:17:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:17:49,017 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 163 [2018-10-15 13:17:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:49,017 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:17:49,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:17:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:17:49,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:17:49,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:49,018 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:49,018 INFO L424 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:49,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash -392582693, now seen corresponding path program 157 times [2018-10-15 13:17:49,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 0 proven. 985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:49,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:49,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:17:49,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:17:49,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:17:49,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1148, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:17:49,476 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 39 states. [2018-10-15 13:17:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:50,411 INFO L93 Difference]: Finished difference Result 758 states and 781 transitions. [2018-10-15 13:17:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:17:50,411 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 166 [2018-10-15 13:17:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:50,412 INFO L225 Difference]: With dead ends: 758 [2018-10-15 13:17:50,412 INFO L226 Difference]: Without dead ends: 752 [2018-10-15 13:17:50,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1552, Invalid=4300, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:17:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-10-15 13:17:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 350. [2018-10-15 13:17:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:17:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:17:50,417 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:17:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:50,417 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:17:50,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:17:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:17:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:17:50,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:50,417 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:50,418 INFO L424 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2117843657, now seen corresponding path program 158 times [2018-10-15 13:17:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 0 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:50,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:50,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:17:50,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:17:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:17:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1302, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:17:50,952 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 41 states. [2018-10-15 13:17:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:51,969 INFO L93 Difference]: Finished difference Result 938 states and 961 transitions. [2018-10-15 13:17:51,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:17:51,969 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 166 [2018-10-15 13:17:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:51,970 INFO L225 Difference]: With dead ends: 938 [2018-10-15 13:17:51,970 INFO L226 Difference]: Without dead ends: 932 [2018-10-15 13:17:51,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1662, Invalid=5310, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:17:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-10-15 13:17:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 350. [2018-10-15 13:17:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:17:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:17:51,975 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:17:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:51,975 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:17:51,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:17:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:17:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:17:51,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:51,976 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:51,976 INFO L424 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:51,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2104767689, now seen corresponding path program 159 times [2018-10-15 13:17:51,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 0 proven. 701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:52,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:52,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:17:52,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:17:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:17:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:17:52,466 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 43 states. [2018-10-15 13:17:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:53,664 INFO L93 Difference]: Finished difference Result 1046 states and 1069 transitions. [2018-10-15 13:17:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:17:53,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-15 13:17:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:53,665 INFO L225 Difference]: With dead ends: 1046 [2018-10-15 13:17:53,665 INFO L226 Difference]: Without dead ends: 1040 [2018-10-15 13:17:53,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1836, Invalid=6354, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:17:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-10-15 13:17:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 350. [2018-10-15 13:17:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:17:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:17:53,669 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:17:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:53,669 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:17:53,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:17:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:17:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:17:53,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:53,670 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 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] [2018-10-15 13:17:53,670 INFO L424 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:53,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:53,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1095582939, now seen corresponding path program 160 times [2018-10-15 13:17:53,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:54,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:54,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:17:54,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:17:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:17:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:17:54,339 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 45 states. [2018-10-15 13:17:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:55,632 INFO L93 Difference]: Finished difference Result 1082 states and 1105 transitions. [2018-10-15 13:17:55,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:17:55,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 166 [2018-10-15 13:17:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:55,634 INFO L225 Difference]: With dead ends: 1082 [2018-10-15 13:17:55,649 INFO L226 Difference]: Without dead ends: 1076 [2018-10-15 13:17:55,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2074, Invalid=7432, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 13:17:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-10-15 13:17:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 350. [2018-10-15 13:17:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:17:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:17:55,653 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:17:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:55,653 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:17:55,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:17:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:17:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:17:55,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:55,654 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 8, 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] [2018-10-15 13:17:55,654 INFO L424 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:55,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1907266925, now seen corresponding path program 161 times [2018-10-15 13:17:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:56,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:17:56,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:17:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:17:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1728, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:17:56,248 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 47 states. [2018-10-15 13:17:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:57,734 INFO L93 Difference]: Finished difference Result 1068 states and 1091 transitions. [2018-10-15 13:17:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:17:57,735 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 166 [2018-10-15 13:17:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:57,736 INFO L225 Difference]: With dead ends: 1068 [2018-10-15 13:17:57,736 INFO L226 Difference]: Without dead ends: 1062 [2018-10-15 13:17:57,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2376, Invalid=8544, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:17:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-10-15 13:17:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 350. [2018-10-15 13:17:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:17:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:17:57,742 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:17:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:57,742 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:17:57,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:17:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:17:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:17:57,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:57,743 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 6, 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] [2018-10-15 13:17:57,743 INFO L424 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:57,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:57,744 INFO L82 PathProgramCache]: Analyzing trace with hash 226539905, now seen corresponding path program 162 times [2018-10-15 13:17:57,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:58,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:58,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:17:58,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:17:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:17:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1858, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:17:58,391 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 49 states. [2018-10-15 13:18:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:00,208 INFO L93 Difference]: Finished difference Result 996 states and 1019 transitions. [2018-10-15 13:18:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 13:18:00,208 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 166 [2018-10-15 13:18:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:00,209 INFO L225 Difference]: With dead ends: 996 [2018-10-15 13:18:00,209 INFO L226 Difference]: Without dead ends: 990 [2018-10-15 13:18:00,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2582 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2742, Invalid=9690, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 13:18:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-10-15 13:18:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 350. [2018-10-15 13:18:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:00,214 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:18:00,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:00,214 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:00,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:18:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:18:00,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:00,215 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 4, 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] [2018-10-15 13:18:00,215 INFO L424 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:00,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -959346705, now seen corresponding path program 163 times [2018-10-15 13:18:00,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 0 proven. 1213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:00,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:00,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:18:00,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:18:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:18:00,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=1982, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:18:00,959 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 51 states. [2018-10-15 13:18:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:02,848 INFO L93 Difference]: Finished difference Result 852 states and 875 transitions. [2018-10-15 13:18:02,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 13:18:02,848 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 166 [2018-10-15 13:18:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:02,849 INFO L225 Difference]: With dead ends: 852 [2018-10-15 13:18:02,849 INFO L226 Difference]: Without dead ends: 846 [2018-10-15 13:18:02,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2912 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3172, Invalid=10870, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:18:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-10-15 13:18:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 350. [2018-10-15 13:18:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:02,853 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 166 [2018-10-15 13:18:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:02,853 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:02,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:18:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:02,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:02,854 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:02,854 INFO L424 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:02,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1120928673, now seen corresponding path program 164 times [2018-10-15 13:18:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 0 proven. 1114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:03,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:03,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:18:03,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:18:03,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:18:03,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:18:03,290 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 39 states. [2018-10-15 13:18:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:04,368 INFO L93 Difference]: Finished difference Result 645 states and 668 transitions. [2018-10-15 13:18:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:18:04,369 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 169 [2018-10-15 13:18:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:04,369 INFO L225 Difference]: With dead ends: 645 [2018-10-15 13:18:04,369 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 13:18:04,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1588, Invalid=4112, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:18:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 13:18:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 350. [2018-10-15 13:18:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:04,373 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:04,374 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:04,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:18:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:04,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:04,374 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:04,374 INFO L424 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1765335437, now seen corresponding path program 165 times [2018-10-15 13:18:04,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 0 proven. 891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:04,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:04,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:18:04,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:18:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:18:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:18:04,864 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 41 states. [2018-10-15 13:18:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:05,795 INFO L93 Difference]: Finished difference Result 861 states and 884 transitions. [2018-10-15 13:18:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:18:05,795 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-10-15 13:18:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:05,796 INFO L225 Difference]: With dead ends: 861 [2018-10-15 13:18:05,797 INFO L226 Difference]: Without dead ends: 855 [2018-10-15 13:18:05,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1677, Invalid=5129, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:18:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-10-15 13:18:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 350. [2018-10-15 13:18:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:05,800 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:05,800 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:05,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:18:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:05,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:05,801 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:05,801 INFO L424 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:05,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -82335291, now seen corresponding path program 166 times [2018-10-15 13:18:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:06,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:06,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:18:06,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:18:06,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:18:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1446, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:18:06,303 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 43 states. [2018-10-15 13:18:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:07,422 INFO L93 Difference]: Finished difference Result 1005 states and 1028 transitions. [2018-10-15 13:18:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:18:07,422 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 169 [2018-10-15 13:18:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:07,424 INFO L225 Difference]: With dead ends: 1005 [2018-10-15 13:18:07,424 INFO L226 Difference]: Without dead ends: 999 [2018-10-15 13:18:07,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=6180, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:18:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-15 13:18:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 350. [2018-10-15 13:18:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:07,428 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:07,428 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:07,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:18:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:07,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:07,429 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:07,429 INFO L424 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:07,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:07,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1231764073, now seen corresponding path program 167 times [2018-10-15 13:18:07,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:07,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:07,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:18:07,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:18:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:18:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1593, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:18:07,969 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 45 states. [2018-10-15 13:18:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:09,393 INFO L93 Difference]: Finished difference Result 1077 states and 1100 transitions. [2018-10-15 13:18:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:18:09,394 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 169 [2018-10-15 13:18:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:09,395 INFO L225 Difference]: With dead ends: 1077 [2018-10-15 13:18:09,395 INFO L226 Difference]: Without dead ends: 1071 [2018-10-15 13:18:09,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2047, Invalid=7265, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:18:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-10-15 13:18:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 350. [2018-10-15 13:18:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:09,400 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:09,400 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:09,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:18:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:09,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:09,400 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:09,401 INFO L424 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:09,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash -996568599, now seen corresponding path program 168 times [2018-10-15 13:18:09,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:10,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:10,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:18:10,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:18:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:18:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=1734, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:18:10,008 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 47 states. [2018-10-15 13:18:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:11,424 INFO L93 Difference]: Finished difference Result 1081 states and 1104 transitions. [2018-10-15 13:18:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:18:11,424 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 169 [2018-10-15 13:18:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:11,425 INFO L225 Difference]: With dead ends: 1081 [2018-10-15 13:18:11,425 INFO L226 Difference]: Without dead ends: 1075 [2018-10-15 13:18:11,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2328, Invalid=8384, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:18:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-10-15 13:18:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 350. [2018-10-15 13:18:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:11,430 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:11,430 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:11,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:18:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:11,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:11,431 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:11,431 INFO L424 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:11,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:11,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1728655035, now seen corresponding path program 169 times [2018-10-15 13:18:11,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 0 proven. 899 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:12,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:12,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:18:12,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:18:12,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:18:12,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1869, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:18:12,074 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 49 states. [2018-10-15 13:18:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:13,722 INFO L93 Difference]: Finished difference Result 1045 states and 1068 transitions. [2018-10-15 13:18:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:18:13,722 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 169 [2018-10-15 13:18:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:13,723 INFO L225 Difference]: With dead ends: 1045 [2018-10-15 13:18:13,723 INFO L226 Difference]: Without dead ends: 1039 [2018-10-15 13:18:13,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2544 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2673, Invalid=9537, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:18:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-10-15 13:18:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 350. [2018-10-15 13:18:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:13,727 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:13,728 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:13,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:18:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:13,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:13,728 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:13,729 INFO L424 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:13,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 944684045, now seen corresponding path program 170 times [2018-10-15 13:18:13,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 0 proven. 1126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:14,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:14,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:18:14,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:18:14,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:18:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1998, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:18:14,621 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 51 states. [2018-10-15 13:18:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:16,513 INFO L93 Difference]: Finished difference Result 937 states and 960 transitions. [2018-10-15 13:18:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 13:18:16,513 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 169 [2018-10-15 13:18:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:16,514 INFO L225 Difference]: With dead ends: 937 [2018-10-15 13:18:16,515 INFO L226 Difference]: Without dead ends: 931 [2018-10-15 13:18:16,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2868 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3082, Invalid=10724, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 13:18:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-10-15 13:18:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 350. [2018-10-15 13:18:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 13:18:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 373 transitions. [2018-10-15 13:18:16,520 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 373 transitions. Word has length 169 [2018-10-15 13:18:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:16,520 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 373 transitions. [2018-10-15 13:18:16,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:18:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 373 transitions. [2018-10-15 13:18:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 13:18:16,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:16,521 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 3, 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] [2018-10-15 13:18:16,521 INFO L424 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:16,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:16,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1117955617, now seen corresponding path program 171 times [2018-10-15 13:18:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 0 proven. 1443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:17,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:17,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:18:17,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:18:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:18:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=2121, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:18:17,273 INFO L87 Difference]: Start difference. First operand 350 states and 373 transitions. Second operand 53 states. [2018-10-15 13:18:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:19,542 INFO L93 Difference]: Finished difference Result 766 states and 790 transitions. [2018-10-15 13:18:19,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 13:18:19,542 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 169 [2018-10-15 13:18:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:19,543 INFO L225 Difference]: With dead ends: 766 [2018-10-15 13:18:19,543 INFO L226 Difference]: Without dead ends: 760 [2018-10-15 13:18:19,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3219 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3555, Invalid=11945, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:18:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-15 13:18:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 356. [2018-10-15 13:18:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 13:18:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 380 transitions. [2018-10-15 13:18:19,547 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 380 transitions. Word has length 169 [2018-10-15 13:18:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:19,547 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 380 transitions. [2018-10-15 13:18:19,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:18:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 380 transitions. [2018-10-15 13:18:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:19,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:19,548 INFO L375 BasicCegarLoop]: trace histogram [18, 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] [2018-10-15 13:18:19,548 INFO L424 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:19,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:19,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1418047257, now seen corresponding path program 17 times [2018-10-15 13:18:19,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 0 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:20,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:20,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:18:20,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:18:20,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:18:20,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:18:20,005 INFO L87 Difference]: Start difference. First operand 356 states and 380 transitions. Second operand 39 states. [2018-10-15 13:18:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:20,925 INFO L93 Difference]: Finished difference Result 523 states and 547 transitions. [2018-10-15 13:18:20,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:18:20,925 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 172 [2018-10-15 13:18:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:20,926 INFO L225 Difference]: With dead ends: 523 [2018-10-15 13:18:20,926 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 13:18:20,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:18:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 13:18:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 368. [2018-10-15 13:18:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:20,930 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:20,930 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:20,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:18:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:20,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:20,931 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:20,931 INFO L424 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:20,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1222688171, now seen corresponding path program 172 times [2018-10-15 13:18:20,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:18:21,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:18:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:18:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1282, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:18:21,563 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 41 states. [2018-10-15 13:18:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:22,543 INFO L93 Difference]: Finished difference Result 907 states and 931 transitions. [2018-10-15 13:18:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:18:22,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-15 13:18:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:22,545 INFO L225 Difference]: With dead ends: 907 [2018-10-15 13:18:22,545 INFO L226 Difference]: Without dead ends: 901 [2018-10-15 13:18:22,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1700, Invalid=4942, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:18:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-10-15 13:18:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 368. [2018-10-15 13:18:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:22,550 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:22,550 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:22,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:18:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:22,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:22,551 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:22,551 INFO L424 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:22,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:22,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1287738179, now seen corresponding path program 173 times [2018-10-15 13:18:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:23,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:23,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:18:23,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:18:23,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:18:23,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:18:23,063 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 43 states. [2018-10-15 13:18:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:24,149 INFO L93 Difference]: Finished difference Result 1069 states and 1093 transitions. [2018-10-15 13:18:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:18:24,149 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 172 [2018-10-15 13:18:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:24,151 INFO L225 Difference]: With dead ends: 1069 [2018-10-15 13:18:24,151 INFO L226 Difference]: Without dead ends: 1063 [2018-10-15 13:18:24,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1616 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1832, Invalid=6000, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:18:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-15 13:18:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 368. [2018-10-15 13:18:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:24,156 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:24,156 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:24,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:18:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:24,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:24,158 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:24,158 INFO L424 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:24,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:24,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1360094129, now seen corresponding path program 174 times [2018-10-15 13:18:24,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:24,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:24,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:18:24,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:18:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:18:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:18:24,872 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 45 states. [2018-10-15 13:18:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:26,125 INFO L93 Difference]: Finished difference Result 1159 states and 1183 transitions. [2018-10-15 13:18:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:18:26,126 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-15 13:18:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:26,127 INFO L225 Difference]: With dead ends: 1159 [2018-10-15 13:18:26,128 INFO L226 Difference]: Without dead ends: 1153 [2018-10-15 13:18:26,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1927 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2028, Invalid=7092, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:18:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-15 13:18:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 368. [2018-10-15 13:18:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:26,133 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:26,133 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:26,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:18:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:26,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:26,134 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 10, 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] [2018-10-15 13:18:26,134 INFO L424 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:26,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:26,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1925688417, now seen corresponding path program 175 times [2018-10-15 13:18:26,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:26,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:26,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:18:26,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:18:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:18:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1738, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:18:26,733 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 47 states. [2018-10-15 13:18:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:28,168 INFO L93 Difference]: Finished difference Result 1177 states and 1201 transitions. [2018-10-15 13:18:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:18:28,168 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 172 [2018-10-15 13:18:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:28,169 INFO L225 Difference]: With dead ends: 1177 [2018-10-15 13:18:28,169 INFO L226 Difference]: Without dead ends: 1171 [2018-10-15 13:18:28,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2288, Invalid=8218, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:18:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2018-10-15 13:18:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 368. [2018-10-15 13:18:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:28,174 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:28,175 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:28,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:18:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:28,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:28,175 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 8, 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] [2018-10-15 13:18:28,176 INFO L424 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:28,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1557594893, now seen corresponding path program 176 times [2018-10-15 13:18:28,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:28,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:28,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:18:28,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:18:28,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:18:28,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:18:28,832 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 49 states. [2018-10-15 13:18:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:30,580 INFO L93 Difference]: Finished difference Result 1154 states and 1178 transitions. [2018-10-15 13:18:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:18:30,580 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 172 [2018-10-15 13:18:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:30,581 INFO L225 Difference]: With dead ends: 1154 [2018-10-15 13:18:30,582 INFO L226 Difference]: Without dead ends: 1148 [2018-10-15 13:18:30,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2612, Invalid=9378, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 13:18:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-10-15 13:18:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 368. [2018-10-15 13:18:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:30,586 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:30,586 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:30,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:18:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:30,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:30,587 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 6, 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] [2018-10-15 13:18:30,587 INFO L424 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:30,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash -603565573, now seen corresponding path program 177 times [2018-10-15 13:18:30,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 0 proven. 1054 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:31,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:31,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:18:31,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:18:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:18:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=2012, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:18:31,296 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 51 states. [2018-10-15 13:18:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:33,086 INFO L93 Difference]: Finished difference Result 1064 states and 1088 transitions. [2018-10-15 13:18:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 13:18:33,086 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 172 [2018-10-15 13:18:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:33,087 INFO L225 Difference]: With dead ends: 1064 [2018-10-15 13:18:33,088 INFO L226 Difference]: Without dead ends: 1058 [2018-10-15 13:18:33,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2826 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3000, Invalid=10572, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 13:18:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-10-15 13:18:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 368. [2018-10-15 13:18:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:33,092 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:33,092 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:33,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:18:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:18:33,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:33,093 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 4, 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] [2018-10-15 13:18:33,093 INFO L424 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:33,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:33,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1789452183, now seen corresponding path program 178 times [2018-10-15 13:18:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:33,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:33,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:18:33,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:18:33,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:18:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=2140, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:18:33,852 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 53 states. [2018-10-15 13:18:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:36,138 INFO L93 Difference]: Finished difference Result 902 states and 926 transitions. [2018-10-15 13:18:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 13:18:36,138 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 172 [2018-10-15 13:18:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:36,139 INFO L225 Difference]: With dead ends: 902 [2018-10-15 13:18:36,139 INFO L226 Difference]: Without dead ends: 896 [2018-10-15 13:18:36,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3171 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3452, Invalid=11800, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 13:18:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-10-15 13:18:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 368. [2018-10-15 13:18:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:36,142 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 172 [2018-10-15 13:18:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:36,142 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:36,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:18:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:36,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:36,143 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:36,143 INFO L424 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:36,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1870323943, now seen corresponding path program 179 times [2018-10-15 13:18:36,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:36,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:18:36,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:18:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:18:36,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:18:36,639 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 41 states. [2018-10-15 13:18:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:37,578 INFO L93 Difference]: Finished difference Result 803 states and 827 transitions. [2018-10-15 13:18:37,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:18:37,579 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-10-15 13:18:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:37,579 INFO L225 Difference]: With dead ends: 803 [2018-10-15 13:18:37,580 INFO L226 Difference]: Without dead ends: 797 [2018-10-15 13:18:37,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:18:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-10-15 13:18:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 368. [2018-10-15 13:18:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:37,583 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:37,583 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:37,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:18:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:37,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:37,584 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:37,584 INFO L424 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:37,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1015940167, now seen corresponding path program 180 times [2018-10-15 13:18:37,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 0 proven. 917 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:38,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:38,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:18:38,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:18:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:18:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:18:38,085 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 43 states. [2018-10-15 13:18:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:39,147 INFO L93 Difference]: Finished difference Result 1001 states and 1025 transitions. [2018-10-15 13:18:39,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:18:39,147 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 175 [2018-10-15 13:18:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:39,148 INFO L225 Difference]: With dead ends: 1001 [2018-10-15 13:18:39,149 INFO L226 Difference]: Without dead ends: 995 [2018-10-15 13:18:39,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1842, Invalid=5814, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:18:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2018-10-15 13:18:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 368. [2018-10-15 13:18:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:39,153 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:39,153 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:39,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:18:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:39,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:39,154 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:39,154 INFO L424 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:39,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash 667059979, now seen corresponding path program 181 times [2018-10-15 13:18:39,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 0 proven. 802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:18:39,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:18:39,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:18:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:18:39,713 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 45 states. [2018-10-15 13:18:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:41,089 INFO L93 Difference]: Finished difference Result 1127 states and 1151 transitions. [2018-10-15 13:18:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:18:41,089 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 175 [2018-10-15 13:18:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:41,091 INFO L225 Difference]: With dead ends: 1127 [2018-10-15 13:18:41,091 INFO L226 Difference]: Without dead ends: 1121 [2018-10-15 13:18:41,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2017, Invalid=6913, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:18:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-15 13:18:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 368. [2018-10-15 13:18:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:41,096 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:41,096 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:41,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:18:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:41,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:41,097 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:41,097 INFO L424 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:41,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash -482368803, now seen corresponding path program 182 times [2018-10-15 13:18:41,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 0 proven. 777 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:41,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:41,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:18:41,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:18:41,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:18:41,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:18:41,715 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 47 states. [2018-10-15 13:18:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:43,068 INFO L93 Difference]: Finished difference Result 1181 states and 1205 transitions. [2018-10-15 13:18:43,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:18:43,069 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 175 [2018-10-15 13:18:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:43,070 INFO L225 Difference]: With dead ends: 1181 [2018-10-15 13:18:43,070 INFO L226 Difference]: Without dead ends: 1175 [2018-10-15 13:18:43,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2256, Invalid=8046, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:18:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-10-15 13:18:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 368. [2018-10-15 13:18:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:43,075 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:43,075 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:43,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:18:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:43,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:43,076 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:43,076 INFO L424 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:43,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:43,076 INFO L82 PathProgramCache]: Analyzing trace with hash -247173329, now seen corresponding path program 183 times [2018-10-15 13:18:43,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 842 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:43,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:43,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:18:43,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:18:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:18:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:18:43,762 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 49 states. [2018-10-15 13:18:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:45,474 INFO L93 Difference]: Finished difference Result 1176 states and 1200 transitions. [2018-10-15 13:18:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:18:45,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 175 [2018-10-15 13:18:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:45,476 INFO L225 Difference]: With dead ends: 1176 [2018-10-15 13:18:45,476 INFO L226 Difference]: Without dead ends: 1170 [2018-10-15 13:18:45,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2559, Invalid=9213, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 13:18:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-15 13:18:45,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 368. [2018-10-15 13:18:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:45,480 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:45,480 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:45,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:18:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:45,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:45,481 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:45,481 INFO L424 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:45,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1816916991, now seen corresponding path program 184 times [2018-10-15 13:18:45,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 0 proven. 997 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:46,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:46,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:18:46,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:18:46,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:18:46,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=2024, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:18:46,207 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 51 states. [2018-10-15 13:18:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:47,982 INFO L93 Difference]: Finished difference Result 1122 states and 1146 transitions. [2018-10-15 13:18:47,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:18:47,983 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 175 [2018-10-15 13:18:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:47,984 INFO L225 Difference]: With dead ends: 1122 [2018-10-15 13:18:47,984 INFO L226 Difference]: Without dead ends: 1116 [2018-10-15 13:18:47,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=10414, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 13:18:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-10-15 13:18:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 368. [2018-10-15 13:18:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:47,989 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:47,989 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:47,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:18:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:47,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:47,990 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:47,990 INFO L424 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:47,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1694079315, now seen corresponding path program 185 times [2018-10-15 13:18:47,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:18:48,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:18:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:18:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2157, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:18:48,721 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 53 states. [2018-10-15 13:18:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:50,945 INFO L93 Difference]: Finished difference Result 996 states and 1020 transitions. [2018-10-15 13:18:50,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 13:18:50,946 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 175 [2018-10-15 13:18:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:50,947 INFO L225 Difference]: With dead ends: 996 [2018-10-15 13:18:50,947 INFO L226 Difference]: Without dead ends: 990 [2018-10-15 13:18:50,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3357, Invalid=11649, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:18:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-10-15 13:18:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 368. [2018-10-15 13:18:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 13:18:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 392 transitions. [2018-10-15 13:18:50,951 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 392 transitions. Word has length 175 [2018-10-15 13:18:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:50,951 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 392 transitions. [2018-10-15 13:18:50,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:18:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 392 transitions. [2018-10-15 13:18:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 13:18:50,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:50,952 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 3, 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] [2018-10-15 13:18:50,952 INFO L424 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash -368560347, now seen corresponding path program 186 times [2018-10-15 13:18:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:18:51,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:18:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:18:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=2284, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:18:51,776 INFO L87 Difference]: Start difference. First operand 368 states and 392 transitions. Second operand 55 states. [2018-10-15 13:18:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:54,086 INFO L93 Difference]: Finished difference Result 807 states and 832 transitions. [2018-10-15 13:18:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 13:18:54,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 175 [2018-10-15 13:18:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:54,088 INFO L225 Difference]: With dead ends: 807 [2018-10-15 13:18:54,088 INFO L226 Difference]: Without dead ends: 801 [2018-10-15 13:18:54,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3491 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3852, Invalid=12918, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 13:18:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-15 13:18:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 374. [2018-10-15 13:18:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:18:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:18:54,092 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 175 [2018-10-15 13:18:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:54,092 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:18:54,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:18:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:18:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:18:54,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:54,093 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:54,093 INFO L424 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:54,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1423563295, now seen corresponding path program 187 times [2018-10-15 13:18:54,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:54,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:54,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:18:54,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:18:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:18:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1254, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:18:54,566 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 41 states. [2018-10-15 13:18:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:55,665 INFO L93 Difference]: Finished difference Result 687 states and 712 transitions. [2018-10-15 13:18:55,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:18:55,666 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-10-15 13:18:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:55,666 INFO L225 Difference]: With dead ends: 687 [2018-10-15 13:18:55,667 INFO L226 Difference]: Without dead ends: 681 [2018-10-15 13:18:55,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=4550, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:18:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-10-15 13:18:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 374. [2018-10-15 13:18:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:18:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:18:55,671 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:18:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:55,671 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:18:55,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:18:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:18:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:18:55,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:55,672 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:55,672 INFO L424 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:55,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1228204209, now seen corresponding path program 188 times [2018-10-15 13:18:55,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 1019 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:56,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:56,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:18:56,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:18:56,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:18:56,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1422, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:18:56,215 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 43 states. [2018-10-15 13:18:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:57,310 INFO L93 Difference]: Finished difference Result 921 states and 946 transitions. [2018-10-15 13:18:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:18:57,311 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 178 [2018-10-15 13:18:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:57,312 INFO L225 Difference]: With dead ends: 921 [2018-10-15 13:18:57,312 INFO L226 Difference]: Without dead ends: 915 [2018-10-15 13:18:57,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1860, Invalid=5622, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:18:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-15 13:18:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 374. [2018-10-15 13:18:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:18:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:18:57,316 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:18:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:57,316 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:18:57,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:18:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:18:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:18:57,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:57,317 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:57,317 INFO L424 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:57,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1282222141, now seen corresponding path program 189 times [2018-10-15 13:18:57,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:57,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:57,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:18:57,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:18:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:18:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1584, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:18:57,858 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 45 states. [2018-10-15 13:18:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:59,064 INFO L93 Difference]: Finished difference Result 1083 states and 1108 transitions. [2018-10-15 13:18:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:18:59,065 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 178 [2018-10-15 13:18:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:59,066 INFO L225 Difference]: With dead ends: 1083 [2018-10-15 13:18:59,066 INFO L226 Difference]: Without dead ends: 1077 [2018-10-15 13:18:59,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2014, Invalid=6728, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:18:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-10-15 13:18:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 374. [2018-10-15 13:18:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:18:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:18:59,071 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:18:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:59,071 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:18:59,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:18:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:18:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:18:59,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:59,072 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 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] [2018-10-15 13:18:59,072 INFO L424 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:59,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1354578091, now seen corresponding path program 190 times [2018-10-15 13:18:59,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 0 proven. 807 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:59,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:59,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:18:59,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:18:59,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:18:59,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:18:59,691 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 47 states. [2018-10-15 13:19:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:01,245 INFO L93 Difference]: Finished difference Result 1173 states and 1198 transitions. [2018-10-15 13:19:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:19:01,246 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 178 [2018-10-15 13:19:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:01,247 INFO L225 Difference]: With dead ends: 1173 [2018-10-15 13:19:01,247 INFO L226 Difference]: Without dead ends: 1167 [2018-10-15 13:19:01,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2232, Invalid=7868, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:19:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-10-15 13:19:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 374. [2018-10-15 13:19:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:19:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:19:01,252 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:19:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:01,252 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:19:01,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:19:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:19:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:19:01,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:01,253 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 10, 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] [2018-10-15 13:19:01,253 INFO L424 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:01,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1931204455, now seen corresponding path program 191 times [2018-10-15 13:19:01,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:01,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:19:01,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:19:01,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:19:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:19:01,875 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 49 states. [2018-10-15 13:19:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:03,348 INFO L93 Difference]: Finished difference Result 1191 states and 1216 transitions. [2018-10-15 13:19:03,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:19:03,349 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 178 [2018-10-15 13:19:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:03,350 INFO L225 Difference]: With dead ends: 1191 [2018-10-15 13:19:03,350 INFO L226 Difference]: Without dead ends: 1185 [2018-10-15 13:19:03,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2514, Invalid=9042, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:19:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2018-10-15 13:19:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 374. [2018-10-15 13:19:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:19:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:19:03,355 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:19:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:03,355 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:19:03,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:19:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:19:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:19:03,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:03,356 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 8, 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] [2018-10-15 13:19:03,356 INFO L424 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:03,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1552078855, now seen corresponding path program 192 times [2018-10-15 13:19:03,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 0 proven. 955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:04,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:04,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:19:04,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:19:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:19:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2034, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:19:04,075 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 51 states. [2018-10-15 13:19:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:05,986 INFO L93 Difference]: Finished difference Result 1168 states and 1193 transitions. [2018-10-15 13:19:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:19:05,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 178 [2018-10-15 13:19:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:05,987 INFO L225 Difference]: With dead ends: 1168 [2018-10-15 13:19:05,988 INFO L226 Difference]: Without dead ends: 1162 [2018-10-15 13:19:05,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2860, Invalid=10250, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:19:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-10-15 13:19:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 374. [2018-10-15 13:19:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:19:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:19:05,992 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:19:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:05,992 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:19:05,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:19:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:19:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:19:05,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:05,993 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 6, 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] [2018-10-15 13:19:05,993 INFO L424 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:05,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash -609081611, now seen corresponding path program 193 times [2018-10-15 13:19:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 1164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:06,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:06,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:19:06,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:19:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:19:06,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=2172, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:19:06,726 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 53 states. [2018-10-15 13:19:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:08,668 INFO L93 Difference]: Finished difference Result 1078 states and 1103 transitions. [2018-10-15 13:19:08,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 13:19:08,669 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 178 [2018-10-15 13:19:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:08,670 INFO L225 Difference]: With dead ends: 1078 [2018-10-15 13:19:08,670 INFO L226 Difference]: Without dead ends: 1072 [2018-10-15 13:19:08,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3270, Invalid=11492, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:19:08,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2018-10-15 13:19:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 374. [2018-10-15 13:19:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:19:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:19:08,674 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:19:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:08,675 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:19:08,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:19:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:19:08,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:19:08,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:08,675 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 4, 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] [2018-10-15 13:19:08,676 INFO L424 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:08,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1794968221, now seen corresponding path program 194 times [2018-10-15 13:19:08,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 0 proven. 1463 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:09,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:09,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:19:09,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:19:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:19:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=2304, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:19:09,647 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 55 states. [2018-10-15 13:19:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:12,043 INFO L93 Difference]: Finished difference Result 916 states and 941 transitions. [2018-10-15 13:19:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 13:19:12,043 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 178 [2018-10-15 13:19:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:12,044 INFO L225 Difference]: With dead ends: 916 [2018-10-15 13:19:12,044 INFO L226 Difference]: Without dead ends: 910 [2018-10-15 13:19:12,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3441 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3744, Invalid=12768, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:19:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-10-15 13:19:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 374. [2018-10-15 13:19:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 13:19:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 399 transitions. [2018-10-15 13:19:12,049 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 399 transitions. Word has length 178 [2018-10-15 13:19:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:12,049 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 399 transitions. [2018-10-15 13:19:12,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:19:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 399 transitions. [2018-10-15 13:19:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:12,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:12,050 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:12,050 INFO L424 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:12,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1154967387, now seen corresponding path program 18 times [2018-10-15 13:19:12,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1413 backedges. 0 proven. 1413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:19:12,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:19:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:19:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:19:12,529 INFO L87 Difference]: Start difference. First operand 374 states and 399 transitions. Second operand 41 states. [2018-10-15 13:19:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:13,477 INFO L93 Difference]: Finished difference Result 550 states and 575 transitions. [2018-10-15 13:19:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:19:13,478 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 181 [2018-10-15 13:19:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:13,479 INFO L225 Difference]: With dead ends: 550 [2018-10-15 13:19:13,479 INFO L226 Difference]: Without dead ends: 544 [2018-10-15 13:19:13,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:19:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-10-15 13:19:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 386. [2018-10-15 13:19:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:13,483 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:13,484 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:13,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:19:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:13,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:13,484 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:13,484 INFO L424 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:13,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 750793133, now seen corresponding path program 195 times [2018-10-15 13:19:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 1136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:14,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:19:14,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:19:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:19:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1410, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:19:14,001 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 43 states. [2018-10-15 13:19:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:15,095 INFO L93 Difference]: Finished difference Result 961 states and 986 transitions. [2018-10-15 13:19:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:19:15,095 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2018-10-15 13:19:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:15,096 INFO L225 Difference]: With dead ends: 961 [2018-10-15 13:19:15,096 INFO L226 Difference]: Without dead ends: 955 [2018-10-15 13:19:15,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1886, Invalid=5424, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:19:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-10-15 13:19:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 386. [2018-10-15 13:19:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:15,100 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:15,101 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:15,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:19:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:15,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:15,101 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:15,102 INFO L424 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:15,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2135470977, now seen corresponding path program 196 times [2018-10-15 13:19:15,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 0 proven. 949 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:15,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:15,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:19:15,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:19:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:19:15,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:19:15,851 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 45 states. [2018-10-15 13:19:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:17,126 INFO L93 Difference]: Finished difference Result 1141 states and 1166 transitions. [2018-10-15 13:19:17,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:19:17,126 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 181 [2018-10-15 13:19:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:17,127 INFO L225 Difference]: With dead ends: 1141 [2018-10-15 13:19:17,127 INFO L226 Difference]: Without dead ends: 1135 [2018-10-15 13:19:17,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2019, Invalid=6537, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:19:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2018-10-15 13:19:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 386. [2018-10-15 13:19:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:17,133 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:17,133 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:17,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:19:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:17,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:17,134 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:17,134 INFO L424 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:17,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -452470831, now seen corresponding path program 197 times [2018-10-15 13:19:17,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:19:17,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:19:17,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:19:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1738, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:19:17,736 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 47 states. [2018-10-15 13:19:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:19,086 INFO L93 Difference]: Finished difference Result 1249 states and 1274 transitions. [2018-10-15 13:19:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:19:19,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 181 [2018-10-15 13:19:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:19,087 INFO L225 Difference]: With dead ends: 1249 [2018-10-15 13:19:19,087 INFO L226 Difference]: Without dead ends: 1243 [2018-10-15 13:19:19,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2099 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2216, Invalid=7684, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 13:19:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-10-15 13:19:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 386. [2018-10-15 13:19:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:19,093 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:19,093 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:19,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:19:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:19,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:19,094 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:19,094 INFO L424 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:19,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1601899613, now seen corresponding path program 198 times [2018-10-15 13:19:19,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 0 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:19,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:19,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:19:19,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:19:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:19:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1893, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:19:19,934 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 49 states. [2018-10-15 13:19:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:21,596 INFO L93 Difference]: Finished difference Result 1285 states and 1310 transitions. [2018-10-15 13:19:21,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:19:21,597 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 181 [2018-10-15 13:19:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:21,598 INFO L225 Difference]: With dead ends: 1285 [2018-10-15 13:19:21,598 INFO L226 Difference]: Without dead ends: 1279 [2018-10-15 13:19:21,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2410 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2477, Invalid=8865, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:19:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-15 13:19:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 386. [2018-10-15 13:19:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:21,611 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:21,611 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:21,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:19:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:21,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:21,612 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:21,612 INFO L424 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:21,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:21,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1366704139, now seen corresponding path program 199 times [2018-10-15 13:19:21,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 928 backedges. 0 proven. 928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:22,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:22,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:19:22,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:19:22,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:19:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:19:22,292 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 51 states. [2018-10-15 13:19:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:23,968 INFO L93 Difference]: Finished difference Result 1271 states and 1296 transitions. [2018-10-15 13:19:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:19:23,968 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 181 [2018-10-15 13:19:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:23,970 INFO L225 Difference]: With dead ends: 1271 [2018-10-15 13:19:23,970 INFO L226 Difference]: Without dead ends: 1265 [2018-10-15 13:19:23,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2802, Invalid=10080, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 13:19:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-10-15 13:19:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 386. [2018-10-15 13:19:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:23,975 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:23,975 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:23,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:19:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:23,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:23,976 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:23,976 INFO L424 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:23,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1358519495, now seen corresponding path program 200 times [2018-10-15 13:19:23,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 0 proven. 1101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:24,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:24,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:19:24,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:19:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:19:24,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=2185, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:19:24,713 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 53 states. [2018-10-15 13:19:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:26,866 INFO L93 Difference]: Finished difference Result 1199 states and 1224 transitions. [2018-10-15 13:19:26,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 13:19:26,866 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 181 [2018-10-15 13:19:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:26,867 INFO L225 Difference]: With dead ends: 1199 [2018-10-15 13:19:26,867 INFO L226 Difference]: Without dead ends: 1193 [2018-10-15 13:19:26,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3039 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3191, Invalid=11329, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:19:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-10-15 13:19:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 386. [2018-10-15 13:19:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:26,873 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:26,873 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:26,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:19:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:26,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:26,874 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:26,874 INFO L424 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:26,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 574548505, now seen corresponding path program 201 times [2018-10-15 13:19:26,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 1364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:27,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:27,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:19:27,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:19:27,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:19:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=2322, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:19:27,702 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 55 states. [2018-10-15 13:19:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:29,916 INFO L93 Difference]: Finished difference Result 1055 states and 1080 transitions. [2018-10-15 13:19:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:19:29,916 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 181 [2018-10-15 13:19:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:29,917 INFO L225 Difference]: With dead ends: 1055 [2018-10-15 13:19:29,917 INFO L226 Difference]: Without dead ends: 1049 [2018-10-15 13:19:29,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3644, Invalid=12612, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 13:19:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-10-15 13:19:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 386. [2018-10-15 13:19:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 13:19:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 411 transitions. [2018-10-15 13:19:29,922 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 411 transitions. Word has length 181 [2018-10-15 13:19:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:29,922 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 411 transitions. [2018-10-15 13:19:29,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:19:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 411 transitions. [2018-10-15 13:19:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 13:19:29,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:29,923 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 3, 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] [2018-10-15 13:19:29,923 INFO L424 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:29,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:29,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1488091157, now seen corresponding path program 202 times [2018-10-15 13:19:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:30,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:30,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:19:30,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:19:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:19:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2453, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:19:30,801 INFO L87 Difference]: Start difference. First operand 386 states and 411 transitions. Second operand 57 states. [2018-10-15 13:19:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:33,480 INFO L93 Difference]: Finished difference Result 848 states and 874 transitions. [2018-10-15 13:19:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 13:19:33,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 181 [2018-10-15 13:19:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:33,482 INFO L225 Difference]: With dead ends: 848 [2018-10-15 13:19:33,482 INFO L226 Difference]: Without dead ends: 842 [2018-10-15 13:19:33,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3774 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4161, Invalid=13929, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:19:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-10-15 13:19:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 392. [2018-10-15 13:19:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:33,487 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 181 [2018-10-15 13:19:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:33,487 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:33,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:19:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:33,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:33,488 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:33,488 INFO L424 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:33,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1350096731, now seen corresponding path program 203 times [2018-10-15 13:19:33,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 0 proven. 1268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:34,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:34,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:19:34,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:19:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:19:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:19:34,035 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 43 states. [2018-10-15 13:19:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:35,084 INFO L93 Difference]: Finished difference Result 854 states and 880 transitions. [2018-10-15 13:19:35,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:19:35,085 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 184 [2018-10-15 13:19:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:35,086 INFO L225 Difference]: With dead ends: 854 [2018-10-15 13:19:35,086 INFO L226 Difference]: Without dead ends: 848 [2018-10-15 13:19:35,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1920, Invalid=5220, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:19:35,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-15 13:19:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 392. [2018-10-15 13:19:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:35,090 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:35,090 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:35,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:19:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:35,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:35,091 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:35,091 INFO L424 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:35,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1545455817, now seen corresponding path program 204 times [2018-10-15 13:19:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 0 proven. 1045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:35,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:35,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:19:35,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:19:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:19:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:19:35,660 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 45 states. [2018-10-15 13:19:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:36,983 INFO L93 Difference]: Finished difference Result 1070 states and 1096 transitions. [2018-10-15 13:19:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:19:36,984 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-10-15 13:19:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:36,985 INFO L225 Difference]: With dead ends: 1070 [2018-10-15 13:19:36,985 INFO L226 Difference]: Without dead ends: 1064 [2018-10-15 13:19:36,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2032, Invalid=6340, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:19:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2018-10-15 13:19:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 392. [2018-10-15 13:19:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:36,990 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:36,990 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:36,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:19:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:36,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:36,991 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:36,992 INFO L424 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:36,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash -239085129, now seen corresponding path program 205 times [2018-10-15 13:19:36,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:37,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:37,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:19:37,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:19:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:19:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=1734, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:19:37,602 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 47 states. [2018-10-15 13:19:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:38,920 INFO L93 Difference]: Finished difference Result 1214 states and 1240 transitions. [2018-10-15 13:19:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:19:38,920 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-10-15 13:19:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:38,922 INFO L225 Difference]: With dead ends: 1214 [2018-10-15 13:19:38,922 INFO L226 Difference]: Without dead ends: 1208 [2018-10-15 13:19:38,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2047 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2208, Invalid=7494, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:19:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-15 13:19:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 392. [2018-10-15 13:19:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:38,927 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:38,927 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:38,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:19:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:38,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:38,928 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:38,928 INFO L424 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:38,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash -166729179, now seen corresponding path program 206 times [2018-10-15 13:19:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 0 proven. 869 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:39,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:19:39,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:19:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:19:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1894, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:19:39,568 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 49 states. [2018-10-15 13:19:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:40,996 INFO L93 Difference]: Finished difference Result 1286 states and 1312 transitions. [2018-10-15 13:19:40,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:19:40,996 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-10-15 13:19:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:40,997 INFO L225 Difference]: With dead ends: 1286 [2018-10-15 13:19:40,997 INFO L226 Difference]: Without dead ends: 1280 [2018-10-15 13:19:40,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2372 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2448, Invalid=8682, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 13:19:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-10-15 13:19:41,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 392. [2018-10-15 13:19:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:41,002 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:41,002 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:41,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:19:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:41,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:41,003 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 10, 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] [2018-10-15 13:19:41,003 INFO L424 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:41,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 842455571, now seen corresponding path program 207 times [2018-10-15 13:19:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 916 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:41,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:19:41,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:19:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:19:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:19:41,937 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 51 states. [2018-10-15 13:19:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:43,537 INFO L93 Difference]: Finished difference Result 1290 states and 1316 transitions. [2018-10-15 13:19:43,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 13:19:43,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 184 [2018-10-15 13:19:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:43,538 INFO L225 Difference]: With dead ends: 1290 [2018-10-15 13:19:43,539 INFO L226 Difference]: Without dead ends: 1284 [2018-10-15 13:19:43,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2752, Invalid=9904, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:19:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-10-15 13:19:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 392. [2018-10-15 13:19:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:43,544 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:43,544 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:43,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:19:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:43,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:43,545 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 8, 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] [2018-10-15 13:19:43,545 INFO L424 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:43,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash 30771585, now seen corresponding path program 208 times [2018-10-15 13:19:43,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:44,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:44,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:19:44,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:19:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:19:44,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=2196, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:19:44,297 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 53 states. [2018-10-15 13:19:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:46,164 INFO L93 Difference]: Finished difference Result 1254 states and 1280 transitions. [2018-10-15 13:19:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 13:19:46,165 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 184 [2018-10-15 13:19:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:46,166 INFO L225 Difference]: With dead ends: 1254 [2018-10-15 13:19:46,166 INFO L226 Difference]: Without dead ends: 1248 [2018-10-15 13:19:46,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2999 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3120, Invalid=11160, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 13:19:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-10-15 13:19:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 392. [2018-10-15 13:19:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:46,171 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:46,171 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:46,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:19:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:46,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:46,172 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 6, 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] [2018-10-15 13:19:46,172 INFO L424 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:46,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2130388881, now seen corresponding path program 209 times [2018-10-15 13:19:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 0 proven. 1280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:19:47,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:19:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:19:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2338, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:19:47,156 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 55 states. [2018-10-15 13:19:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:49,306 INFO L93 Difference]: Finished difference Result 1146 states and 1172 transitions. [2018-10-15 13:19:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 13:19:49,306 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 184 [2018-10-15 13:19:49,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:49,307 INFO L225 Difference]: With dead ends: 1146 [2018-10-15 13:19:49,307 INFO L226 Difference]: Without dead ends: 1140 [2018-10-15 13:19:49,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3347 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3552, Invalid=12450, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:19:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-15 13:19:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 392. [2018-10-15 13:19:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:49,311 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:49,311 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:49,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:19:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:19:49,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:49,312 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 4, 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] [2018-10-15 13:19:49,312 INFO L424 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:49,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash 978691805, now seen corresponding path program 210 times [2018-10-15 13:19:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1597 backedges. 0 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:50,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:50,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:19:50,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:19:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:19:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=718, Invalid=2474, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:19:50,195 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 57 states. [2018-10-15 13:19:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:52,823 INFO L93 Difference]: Finished difference Result 966 states and 992 transitions. [2018-10-15 13:19:52,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 13:19:52,823 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 184 [2018-10-15 13:19:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:52,824 INFO L225 Difference]: With dead ends: 966 [2018-10-15 13:19:52,824 INFO L226 Difference]: Without dead ends: 960 [2018-10-15 13:19:52,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3722 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4048, Invalid=13774, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 13:19:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2018-10-15 13:19:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 392. [2018-10-15 13:19:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:52,829 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 184 [2018-10-15 13:19:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:52,830 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:52,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:19:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:19:52,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:52,831 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:52,831 INFO L424 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:52,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:52,831 INFO L82 PathProgramCache]: Analyzing trace with hash 384994209, now seen corresponding path program 211 times [2018-10-15 13:19:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 0 proven. 1415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:53,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:53,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:19:53,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:19:53,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:19:53,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1380, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:19:53,372 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 43 states. [2018-10-15 13:19:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:54,453 INFO L93 Difference]: Finished difference Result 723 states and 749 transitions. [2018-10-15 13:19:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:19:54,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 187 [2018-10-15 13:19:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:54,455 INFO L225 Difference]: With dead ends: 723 [2018-10-15 13:19:54,455 INFO L226 Difference]: Without dead ends: 717 [2018-10-15 13:19:54,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1962, Invalid=5010, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:19:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-15 13:19:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 392. [2018-10-15 13:19:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:54,459 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:19:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:54,459 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:54,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:19:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:19:54,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:54,460 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:54,460 INFO L424 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:54,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash -19180045, now seen corresponding path program 212 times [2018-10-15 13:19:54,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:19:55,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:19:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:19:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1557, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:19:55,025 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 45 states. [2018-10-15 13:19:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:56,199 INFO L93 Difference]: Finished difference Result 975 states and 1001 transitions. [2018-10-15 13:19:56,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:19:56,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-10-15 13:19:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:56,201 INFO L225 Difference]: With dead ends: 975 [2018-10-15 13:19:56,201 INFO L226 Difference]: Without dead ends: 969 [2018-10-15 13:19:56,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2053, Invalid=6137, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:19:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-15 13:19:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 392. [2018-10-15 13:19:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:56,205 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:19:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:56,206 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:56,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:19:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:19:56,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:56,206 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:56,206 INFO L424 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:56,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1389523141, now seen corresponding path program 213 times [2018-10-15 13:19:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 987 backedges. 0 proven. 987 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:57,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:19:57,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:19:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:19:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1728, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:19:57,085 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 47 states. [2018-10-15 13:19:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:58,326 INFO L93 Difference]: Finished difference Result 1155 states and 1181 transitions. [2018-10-15 13:19:58,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:19:58,327 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 187 [2018-10-15 13:19:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:58,328 INFO L225 Difference]: With dead ends: 1155 [2018-10-15 13:19:58,328 INFO L226 Difference]: Without dead ends: 1149 [2018-10-15 13:19:58,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2208, Invalid=7298, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 13:19:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2018-10-15 13:19:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 392. [2018-10-15 13:19:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:19:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:19:58,333 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:19:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:58,333 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:19:58,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:19:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:19:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:19:58,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:58,334 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:58,334 INFO L424 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:58,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1222444009, now seen corresponding path program 214 times [2018-10-15 13:19:58,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 0 proven. 908 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:19:59,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:19:59,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:19:59,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1893, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:19:59,005 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 49 states. [2018-10-15 13:20:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:00,436 INFO L93 Difference]: Finished difference Result 1263 states and 1289 transitions. [2018-10-15 13:20:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:20:00,436 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 187 [2018-10-15 13:20:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:00,438 INFO L225 Difference]: With dead ends: 1263 [2018-10-15 13:20:00,438 INFO L226 Difference]: Without dead ends: 1257 [2018-10-15 13:20:00,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2328 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2427, Invalid=8493, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:20:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-10-15 13:20:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 392. [2018-10-15 13:20:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:20:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:20:00,443 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:20:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:00,443 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:20:00,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:20:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:20:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:20:00,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:00,444 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:00,444 INFO L424 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:00,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1923094505, now seen corresponding path program 215 times [2018-10-15 13:20:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 919 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:01,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:01,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:20:01,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:20:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:20:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2052, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:20:01,135 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 51 states. [2018-10-15 13:20:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:02,919 INFO L93 Difference]: Finished difference Result 1299 states and 1325 transitions. [2018-10-15 13:20:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:20:02,920 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 187 [2018-10-15 13:20:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:02,921 INFO L225 Difference]: With dead ends: 1299 [2018-10-15 13:20:02,921 INFO L226 Difference]: Without dead ends: 1293 [2018-10-15 13:20:02,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2710, Invalid=9722, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 13:20:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-10-15 13:20:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 392. [2018-10-15 13:20:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:20:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:20:02,926 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:20:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:02,926 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:20:02,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:20:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:20:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:20:02,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:02,927 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:02,927 INFO L424 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:02,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2136677317, now seen corresponding path program 216 times [2018-10-15 13:20:02,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:03,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:03,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:20:03,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:20:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:20:03,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=2205, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:20:03,686 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 53 states. [2018-10-15 13:20:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:05,423 INFO L93 Difference]: Finished difference Result 1285 states and 1311 transitions. [2018-10-15 13:20:05,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 13:20:05,423 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 187 [2018-10-15 13:20:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:05,425 INFO L225 Difference]: With dead ends: 1285 [2018-10-15 13:20:05,425 INFO L226 Difference]: Without dead ends: 1279 [2018-10-15 13:20:05,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2961 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3057, Invalid=10985, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:20:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-15 13:20:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 392. [2018-10-15 13:20:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:20:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:20:05,430 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:20:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:05,430 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:20:05,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:20:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:20:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:20:05,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:05,431 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:05,431 INFO L424 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:05,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 588546317, now seen corresponding path program 217 times [2018-10-15 13:20:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 0 proven. 1211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:06,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:20:06,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:20:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:20:06,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=2352, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:20:06,228 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 55 states. [2018-10-15 13:20:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:08,474 INFO L93 Difference]: Finished difference Result 1213 states and 1239 transitions. [2018-10-15 13:20:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 13:20:08,482 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 187 [2018-10-15 13:20:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:08,483 INFO L225 Difference]: With dead ends: 1213 [2018-10-15 13:20:08,483 INFO L226 Difference]: Without dead ends: 1207 [2018-10-15 13:20:08,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3303 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3468, Invalid=12282, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 13:20:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-10-15 13:20:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 392. [2018-10-15 13:20:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:20:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:20:08,487 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:20:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:08,487 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:20:08,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:20:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:20:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:20:08,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:08,488 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:08,489 INFO L424 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:08,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash -195424673, now seen corresponding path program 218 times [2018-10-15 13:20:08,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 0 proven. 1492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:09,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:09,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:20:09,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:20:09,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:20:09,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2493, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:20:09,347 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 57 states. [2018-10-15 13:20:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:11,717 INFO L93 Difference]: Finished difference Result 1069 states and 1095 transitions. [2018-10-15 13:20:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 13:20:11,718 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 187 [2018-10-15 13:20:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:11,719 INFO L225 Difference]: With dead ends: 1069 [2018-10-15 13:20:11,719 INFO L226 Difference]: Without dead ends: 1063 [2018-10-15 13:20:11,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3672 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3943, Invalid=13613, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:20:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-10-15 13:20:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 392. [2018-10-15 13:20:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 13:20:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 418 transitions. [2018-10-15 13:20:11,724 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 418 transitions. Word has length 187 [2018-10-15 13:20:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:11,725 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 418 transitions. [2018-10-15 13:20:11,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:20:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 418 transitions. [2018-10-15 13:20:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 13:20:11,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:11,725 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 3, 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] [2018-10-15 13:20:11,725 INFO L424 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:11,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:11,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2036902961, now seen corresponding path program 219 times [2018-10-15 13:20:11,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:12,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:12,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:20:12,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:20:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:20:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=2628, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:20:12,879 INFO L87 Difference]: Start difference. First operand 392 states and 418 transitions. Second operand 59 states. [2018-10-15 13:20:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:15,568 INFO L93 Difference]: Finished difference Result 862 states and 889 transitions. [2018-10-15 13:20:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 13:20:15,568 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 187 [2018-10-15 13:20:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:15,569 INFO L225 Difference]: With dead ends: 862 [2018-10-15 13:20:15,569 INFO L226 Difference]: Without dead ends: 856 [2018-10-15 13:20:15,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4068 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4482, Invalid=14978, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 13:20:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-15 13:20:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 398. [2018-10-15 13:20:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 13:20:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 425 transitions. [2018-10-15 13:20:15,574 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 425 transitions. Word has length 187 [2018-10-15 13:20:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:15,574 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 425 transitions. [2018-10-15 13:20:15,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:20:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 425 transitions. [2018-10-15 13:20:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:15,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:15,575 INFO L375 BasicCegarLoop]: trace histogram [20, 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] [2018-10-15 13:20:15,575 INFO L424 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:15,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash -451259545, now seen corresponding path program 19 times [2018-10-15 13:20:15,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:16,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:16,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:20:16,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:20:16,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:20:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:20:16,112 INFO L87 Difference]: Start difference. First operand 398 states and 425 transitions. Second operand 43 states. [2018-10-15 13:20:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:17,404 INFO L93 Difference]: Finished difference Result 583 states and 610 transitions. [2018-10-15 13:20:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:20:17,404 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 190 [2018-10-15 13:20:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:17,405 INFO L225 Difference]: With dead ends: 583 [2018-10-15 13:20:17,405 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 13:20:17,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:20:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 13:20:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 410. [2018-10-15 13:20:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:17,409 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:17,409 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:17,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:20:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:17,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:17,410 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:17,410 INFO L424 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:17,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1795488427, now seen corresponding path program 220 times [2018-10-15 13:20:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 0 proven. 1282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:17,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:17,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:20:17,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:20:17,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:20:17,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=1544, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:20:17,998 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 45 states. [2018-10-15 13:20:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:19,190 INFO L93 Difference]: Finished difference Result 1021 states and 1048 transitions. [2018-10-15 13:20:19,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:20:19,190 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 190 [2018-10-15 13:20:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:19,192 INFO L225 Difference]: With dead ends: 1021 [2018-10-15 13:20:19,192 INFO L226 Difference]: Without dead ends: 1015 [2018-10-15 13:20:19,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2082, Invalid=5928, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:20:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-10-15 13:20:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 410. [2018-10-15 13:20:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:19,196 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:19,197 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:19,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:20:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:19,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:19,197 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:19,198 INFO L424 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:19,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1600129341, now seen corresponding path program 221 times [2018-10-15 13:20:19,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:19,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:19,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:20:19,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:20:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:20:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:20:19,918 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 47 states. [2018-10-15 13:20:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:21,172 INFO L93 Difference]: Finished difference Result 1219 states and 1246 transitions. [2018-10-15 13:20:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:20:21,172 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 190 [2018-10-15 13:20:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:21,173 INFO L225 Difference]: With dead ends: 1219 [2018-10-15 13:20:21,173 INFO L226 Difference]: Without dead ends: 1213 [2018-10-15 13:20:21,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2216, Invalid=7096, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:20:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2018-10-15 13:20:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 410. [2018-10-15 13:20:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:21,179 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:21,179 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:21,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:20:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:21,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:21,180 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:21,180 INFO L424 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:21,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash 910297009, now seen corresponding path program 222 times [2018-10-15 13:20:21,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:21,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:21,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:20:21,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:20:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:20:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1890, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:20:21,827 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 49 states. [2018-10-15 13:20:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:23,399 INFO L93 Difference]: Finished difference Result 1345 states and 1372 transitions. [2018-10-15 13:20:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:20:23,400 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-10-15 13:20:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:23,401 INFO L225 Difference]: With dead ends: 1345 [2018-10-15 13:20:23,401 INFO L226 Difference]: Without dead ends: 1339 [2018-10-15 13:20:23,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2414, Invalid=8298, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:20:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-10-15 13:20:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 410. [2018-10-15 13:20:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:23,407 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:23,407 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:23,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:20:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:23,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:23,408 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 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] [2018-10-15 13:20:23,408 INFO L424 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:23,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 982652959, now seen corresponding path program 223 times [2018-10-15 13:20:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:24,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:24,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:20:24,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:20:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:20:24,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2054, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:20:24,100 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 51 states. [2018-10-15 13:20:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:25,655 INFO L93 Difference]: Finished difference Result 1399 states and 1426 transitions. [2018-10-15 13:20:25,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:20:25,655 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 190 [2018-10-15 13:20:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:25,657 INFO L225 Difference]: With dead ends: 1399 [2018-10-15 13:20:25,657 INFO L226 Difference]: Without dead ends: 1393 [2018-10-15 13:20:25,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2676, Invalid=9534, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:20:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2018-10-15 13:20:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 410. [2018-10-15 13:20:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:25,662 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:25,662 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:25,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:20:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:25,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:25,663 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 10, 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] [2018-10-15 13:20:25,663 INFO L424 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:25,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1991837709, now seen corresponding path program 224 times [2018-10-15 13:20:25,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 1002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:26,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:26,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:20:26,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:20:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:20:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2212, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:20:26,439 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 53 states. [2018-10-15 13:20:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:28,389 INFO L93 Difference]: Finished difference Result 1394 states and 1421 transitions. [2018-10-15 13:20:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 13:20:28,389 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-10-15 13:20:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:28,391 INFO L225 Difference]: With dead ends: 1394 [2018-10-15 13:20:28,391 INFO L226 Difference]: Without dead ends: 1388 [2018-10-15 13:20:28,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3002, Invalid=10804, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 13:20:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2018-10-15 13:20:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 410. [2018-10-15 13:20:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:28,397 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:28,397 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:28,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:20:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:28,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:28,398 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 8, 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] [2018-10-15 13:20:28,398 INFO L424 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:28,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1180153723, now seen corresponding path program 225 times [2018-10-15 13:20:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 1157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:29,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:29,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:20:29,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:20:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:20:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:20:29,219 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 55 states. [2018-10-15 13:20:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:31,260 INFO L93 Difference]: Finished difference Result 1340 states and 1367 transitions. [2018-10-15 13:20:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 13:20:31,260 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 190 [2018-10-15 13:20:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:31,261 INFO L225 Difference]: With dead ends: 1340 [2018-10-15 13:20:31,261 INFO L226 Difference]: Without dead ends: 1334 [2018-10-15 13:20:31,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3392, Invalid=12108, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:20:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-10-15 13:20:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 410. [2018-10-15 13:20:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:31,265 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:31,266 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:31,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:20:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:31,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:31,266 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 6, 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] [2018-10-15 13:20:31,267 INFO L424 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:31,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash -981006743, now seen corresponding path program 226 times [2018-10-15 13:20:31,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1402 backedges. 0 proven. 1402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:32,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:32,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:20:32,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:20:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:20:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:20:32,208 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 57 states. [2018-10-15 13:20:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:34,653 INFO L93 Difference]: Finished difference Result 1214 states and 1241 transitions. [2018-10-15 13:20:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 13:20:34,653 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 190 [2018-10-15 13:20:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:34,654 INFO L225 Difference]: With dead ends: 1214 [2018-10-15 13:20:34,654 INFO L226 Difference]: Without dead ends: 1208 [2018-10-15 13:20:34,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3624 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3846, Invalid=13446, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 13:20:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-15 13:20:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 410. [2018-10-15 13:20:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:34,660 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:34,660 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:34,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:20:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:20:34,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:34,661 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 4, 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] [2018-10-15 13:20:34,661 INFO L424 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:34,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2128073943, now seen corresponding path program 227 times [2018-10-15 13:20:34,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 0 proven. 1737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:35,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:35,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:20:35,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:20:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:20:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=2650, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:20:35,598 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 59 states. [2018-10-15 13:20:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:38,394 INFO L93 Difference]: Finished difference Result 1016 states and 1043 transitions. [2018-10-15 13:20:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 13:20:38,395 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 190 [2018-10-15 13:20:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:38,396 INFO L225 Difference]: With dead ends: 1016 [2018-10-15 13:20:38,396 INFO L226 Difference]: Without dead ends: 1010 [2018-10-15 13:20:38,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4014 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4364, Invalid=14818, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:20:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-10-15 13:20:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 410. [2018-10-15 13:20:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:38,401 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 190 [2018-10-15 13:20:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:38,401 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:38,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:20:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:38,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:38,402 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:38,402 INFO L424 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:38,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2145983641, now seen corresponding path program 228 times [2018-10-15 13:20:38,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 0 proven. 1423 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:38,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:38,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:20:38,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:20:38,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:20:38,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1529, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:20:38,986 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 45 states. [2018-10-15 13:20:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:40,175 INFO L93 Difference]: Finished difference Result 899 states and 926 transitions. [2018-10-15 13:20:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:20:40,176 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 193 [2018-10-15 13:20:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:40,177 INFO L225 Difference]: With dead ends: 899 [2018-10-15 13:20:40,177 INFO L226 Difference]: Without dead ends: 893 [2018-10-15 13:20:40,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2119, Invalid=5713, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:20:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-15 13:20:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 410. [2018-10-15 13:20:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:40,181 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:40,181 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:40,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:20:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:40,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:40,182 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:40,182 INFO L424 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:40,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1744809401, now seen corresponding path program 229 times [2018-10-15 13:20:40,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 1182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:40,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:40,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:20:40,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:20:40,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:20:40,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:20:40,810 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 47 states. [2018-10-15 13:20:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:42,072 INFO L93 Difference]: Finished difference Result 1133 states and 1160 transitions. [2018-10-15 13:20:42,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:20:42,072 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 193 [2018-10-15 13:20:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:42,073 INFO L225 Difference]: With dead ends: 1133 [2018-10-15 13:20:42,074 INFO L226 Difference]: Without dead ends: 1127 [2018-10-15 13:20:42,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2232, Invalid=6888, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:20:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2018-10-15 13:20:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 410. [2018-10-15 13:20:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:42,079 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:42,080 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:42,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:20:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:42,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:42,081 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:42,081 INFO L424 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:42,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1141454709, now seen corresponding path program 230 times [2018-10-15 13:20:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 1031 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:42,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:42,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:20:42,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:20:42,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:20:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:20:42,924 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 49 states. [2018-10-15 13:20:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:44,313 INFO L93 Difference]: Finished difference Result 1295 states and 1322 transitions. [2018-10-15 13:20:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:20:44,314 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 193 [2018-10-15 13:20:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:44,315 INFO L225 Difference]: With dead ends: 1295 [2018-10-15 13:20:44,315 INFO L226 Difference]: Without dead ends: 1289 [2018-10-15 13:20:44,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2409, Invalid=8097, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:20:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-15 13:20:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 410. [2018-10-15 13:20:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:44,320 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:44,320 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:44,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:20:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:44,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:44,321 INFO L375 BasicCegarLoop]: trace histogram [13, 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] [2018-10-15 13:20:44,321 INFO L424 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:44,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash 541545437, now seen corresponding path program 231 times [2018-10-15 13:20:44,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:45,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:45,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:20:45,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:20:45,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:20:45,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2054, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:20:45,004 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 51 states. [2018-10-15 13:20:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:46,524 INFO L93 Difference]: Finished difference Result 1385 states and 1412 transitions. [2018-10-15 13:20:46,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:20:46,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 193 [2018-10-15 13:20:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:46,525 INFO L225 Difference]: With dead ends: 1385 [2018-10-15 13:20:46,526 INFO L226 Difference]: Without dead ends: 1379 [2018-10-15 13:20:46,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2650, Invalid=9340, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 13:20:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2018-10-15 13:20:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 410. [2018-10-15 13:20:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:46,531 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:46,531 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:46,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:20:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:46,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:46,532 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:46,532 INFO L424 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:46,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash -607883345, now seen corresponding path program 232 times [2018-10-15 13:20:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 0 proven. 999 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:47,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:47,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:20:47,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:20:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:20:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:20:47,273 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 53 states. [2018-10-15 13:20:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:49,030 INFO L93 Difference]: Finished difference Result 1403 states and 1430 transitions. [2018-10-15 13:20:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:20:49,030 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 193 [2018-10-15 13:20:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:49,032 INFO L225 Difference]: With dead ends: 1403 [2018-10-15 13:20:49,032 INFO L226 Difference]: Without dead ends: 1397 [2018-10-15 13:20:49,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2891 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2955, Invalid=10617, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 13:20:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-10-15 13:20:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 410. [2018-10-15 13:20:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:49,036 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:49,037 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:49,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:20:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:49,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:49,037 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:49,038 INFO L424 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:49,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -372687871, now seen corresponding path program 233 times [2018-10-15 13:20:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 0 proven. 1118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:49,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:49,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:20:49,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:20:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:20:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=2374, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:20:49,817 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 55 states. [2018-10-15 13:20:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:51,719 INFO L93 Difference]: Finished difference Result 1380 states and 1407 transitions. [2018-10-15 13:20:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 13:20:51,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 193 [2018-10-15 13:20:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:51,721 INFO L225 Difference]: With dead ends: 1380 [2018-10-15 13:20:51,721 INFO L226 Difference]: Without dead ends: 1374 [2018-10-15 13:20:51,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3324, Invalid=11928, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 13:20:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2018-10-15 13:20:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 410. [2018-10-15 13:20:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:51,726 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:51,726 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:51,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:20:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:51,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:51,727 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:51,727 INFO L424 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:51,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:51,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1942431533, now seen corresponding path program 234 times [2018-10-15 13:20:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 0 proven. 1327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:52,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:52,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:20:52,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:20:52,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:20:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=2525, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:20:52,575 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 57 states. [2018-10-15 13:20:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:54,785 INFO L93 Difference]: Finished difference Result 1290 states and 1317 transitions. [2018-10-15 13:20:54,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 13:20:54,786 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 193 [2018-10-15 13:20:54,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:54,787 INFO L225 Difference]: With dead ends: 1290 [2018-10-15 13:20:54,787 INFO L226 Difference]: Without dead ends: 1284 [2018-10-15 13:20:54,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3578 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3757, Invalid=13273, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:20:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-10-15 13:20:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 410. [2018-10-15 13:20:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:54,793 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:54,793 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:54,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:20:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:54,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:54,794 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:54,795 INFO L424 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:54,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1568564773, now seen corresponding path program 235 times [2018-10-15 13:20:54,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1626 backedges. 0 proven. 1626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:55,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:55,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:20:55,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:20:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:20:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=2670, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:20:55,741 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 59 states. [2018-10-15 13:20:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:58,237 INFO L93 Difference]: Finished difference Result 1128 states and 1155 transitions. [2018-10-15 13:20:58,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 13:20:58,239 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 193 [2018-10-15 13:20:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:58,240 INFO L225 Difference]: With dead ends: 1128 [2018-10-15 13:20:58,241 INFO L226 Difference]: Without dead ends: 1122 [2018-10-15 13:20:58,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3962 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4254, Invalid=14652, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 13:20:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2018-10-15 13:20:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 410. [2018-10-15 13:20:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 13:20:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-10-15 13:20:58,245 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 193 [2018-10-15 13:20:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:58,246 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-10-15 13:20:58,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:20:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-10-15 13:20:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 13:20:58,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:58,247 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 3, 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] [2018-10-15 13:20:58,247 INFO L424 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:58,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash -494074889, now seen corresponding path program 236 times [2018-10-15 13:20:58,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 0 proven. 2015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:59,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:59,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:20:59,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:20:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:20:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=2809, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:20:59,235 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 61 states. [2018-10-15 13:21:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:01,997 INFO L93 Difference]: Finished difference Result 903 states and 931 transitions. [2018-10-15 13:21:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:21:01,998 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 193 [2018-10-15 13:21:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:01,999 INFO L225 Difference]: With dead ends: 903 [2018-10-15 13:21:01,999 INFO L226 Difference]: Without dead ends: 897 [2018-10-15 13:21:02,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4373 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4815, Invalid=16065, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:21:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-15 13:21:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 416. [2018-10-15 13:21:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:02,004 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 193 [2018-10-15 13:21:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:02,004 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:02,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:21:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:02,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:02,005 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:02,005 INFO L424 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:02,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1633459681, now seen corresponding path program 237 times [2018-10-15 13:21:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 0 proven. 1579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:21:02,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:21:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:21:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:21:02,577 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 45 states. [2018-10-15 13:21:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:03,651 INFO L93 Difference]: Finished difference Result 765 states and 793 transitions. [2018-10-15 13:21:03,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:21:03,651 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 196 [2018-10-15 13:21:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:03,652 INFO L225 Difference]: With dead ends: 765 [2018-10-15 13:21:03,652 INFO L226 Difference]: Without dead ends: 759 [2018-10-15 13:21:03,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2164, Invalid=5492, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:21:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-15 13:21:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 416. [2018-10-15 13:21:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:03,656 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:03,657 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:03,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:21:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:03,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:03,657 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:03,658 INFO L424 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:03,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash 289230799, now seen corresponding path program 238 times [2018-10-15 13:21:03,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:04,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:04,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:21:04,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:21:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:21:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1698, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:21:04,274 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 47 states. [2018-10-15 13:21:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:05,489 INFO L93 Difference]: Finished difference Result 1035 states and 1063 transitions. [2018-10-15 13:21:05,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:21:05,490 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 196 [2018-10-15 13:21:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:05,491 INFO L225 Difference]: With dead ends: 1035 [2018-10-15 13:21:05,491 INFO L226 Difference]: Without dead ends: 1029 [2018-10-15 13:21:05,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2256, Invalid=6674, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:21:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-10-15 13:21:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 416. [2018-10-15 13:21:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:05,495 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:05,495 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:05,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:21:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:05,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:05,496 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:05,496 INFO L424 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:05,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 484589885, now seen corresponding path program 239 times [2018-10-15 13:21:05,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 0 proven. 1115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:06,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:06,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:21:06,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:21:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:21:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:21:06,136 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 49 states. [2018-10-15 13:21:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:07,453 INFO L93 Difference]: Finished difference Result 1233 states and 1261 transitions. [2018-10-15 13:21:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:21:07,454 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 196 [2018-10-15 13:21:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:07,455 INFO L225 Difference]: With dead ends: 1233 [2018-10-15 13:21:07,455 INFO L226 Difference]: Without dead ends: 1227 [2018-10-15 13:21:07,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2412, Invalid=7890, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:21:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-10-15 13:21:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 416. [2018-10-15 13:21:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:07,460 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:07,460 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:07,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:21:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:07,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:07,461 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:07,461 INFO L424 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:07,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1299951061, now seen corresponding path program 240 times [2018-10-15 13:21:07,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 1018 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:08,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:08,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:21:08,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:21:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:21:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2052, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:21:08,146 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 51 states. [2018-10-15 13:21:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:09,663 INFO L93 Difference]: Finished difference Result 1359 states and 1387 transitions. [2018-10-15 13:21:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:21:09,663 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-10-15 13:21:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:09,664 INFO L225 Difference]: With dead ends: 1359 [2018-10-15 13:21:09,664 INFO L226 Difference]: Without dead ends: 1353 [2018-10-15 13:21:09,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2517 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2632, Invalid=9140, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 13:21:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2018-10-15 13:21:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 416. [2018-10-15 13:21:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:09,670 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:09,670 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:09,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:21:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:09,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:09,671 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 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] [2018-10-15 13:21:09,671 INFO L424 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:09,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1227595111, now seen corresponding path program 241 times [2018-10-15 13:21:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 0 proven. 1011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:10,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:10,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:21:10,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:21:10,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:21:10,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=2220, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:21:10,386 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 53 states. [2018-10-15 13:21:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:12,033 INFO L93 Difference]: Finished difference Result 1413 states and 1441 transitions. [2018-10-15 13:21:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:21:12,033 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 196 [2018-10-15 13:21:12,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:12,034 INFO L225 Difference]: With dead ends: 1413 [2018-10-15 13:21:12,035 INFO L226 Difference]: Without dead ends: 1407 [2018-10-15 13:21:12,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2916, Invalid=10424, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 13:21:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2018-10-15 13:21:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 416. [2018-10-15 13:21:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:12,040 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:12,040 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:12,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:21:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:12,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:12,041 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 10, 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] [2018-10-15 13:21:12,041 INFO L424 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:12,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash -218410361, now seen corresponding path program 242 times [2018-10-15 13:21:12,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 0 proven. 1094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:12,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:21:12,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:21:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:21:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2382, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:21:12,813 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 55 states. [2018-10-15 13:21:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:14,642 INFO L93 Difference]: Finished difference Result 1408 states and 1436 transitions. [2018-10-15 13:21:14,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 13:21:14,642 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 196 [2018-10-15 13:21:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:14,644 INFO L225 Difference]: With dead ends: 1408 [2018-10-15 13:21:14,644 INFO L226 Difference]: Without dead ends: 1402 [2018-10-15 13:21:14,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3264, Invalid=11742, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:21:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-15 13:21:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 416. [2018-10-15 13:21:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:14,649 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:14,649 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:14,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:21:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:14,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:14,650 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 8, 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] [2018-10-15 13:21:14,650 INFO L424 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:14,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1030094347, now seen corresponding path program 243 times [2018-10-15 13:21:14,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1267 backedges. 0 proven. 1267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:15,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:15,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:21:15,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:21:15,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:21:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=2538, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:21:15,482 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 57 states. [2018-10-15 13:21:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:17,567 INFO L93 Difference]: Finished difference Result 1354 states and 1382 transitions. [2018-10-15 13:21:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 13:21:17,567 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 196 [2018-10-15 13:21:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:17,568 INFO L225 Difference]: With dead ends: 1354 [2018-10-15 13:21:17,568 INFO L226 Difference]: Without dead ends: 1348 [2018-10-15 13:21:17,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3534 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3676, Invalid=13094, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 13:21:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-10-15 13:21:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 416. [2018-10-15 13:21:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:17,573 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:17,573 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:17,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:21:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:17,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:17,575 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 6, 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] [2018-10-15 13:21:17,575 INFO L424 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:17,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1103712483, now seen corresponding path program 244 times [2018-10-15 13:21:17,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 1530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:18,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:18,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:21:18,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:21:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:21:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=2688, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:21:18,519 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 59 states. [2018-10-15 13:21:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:20,901 INFO L93 Difference]: Finished difference Result 1228 states and 1256 transitions. [2018-10-15 13:21:20,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:21:20,902 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 196 [2018-10-15 13:21:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:20,903 INFO L225 Difference]: With dead ends: 1228 [2018-10-15 13:21:20,903 INFO L226 Difference]: Without dead ends: 1222 [2018-10-15 13:21:20,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3912 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4152, Invalid=14480, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:21:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2018-10-15 13:21:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 416. [2018-10-15 13:21:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:20,908 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:20,908 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:20,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:21:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:21:20,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:20,909 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 4, 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] [2018-10-15 13:21:20,909 INFO L424 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:20,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash -82174127, now seen corresponding path program 245 times [2018-10-15 13:21:20,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 0 proven. 1883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:21,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:21,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:21:21,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:21:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:21:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=2832, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:21:21,884 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 61 states. [2018-10-15 13:21:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:24,538 INFO L93 Difference]: Finished difference Result 1030 states and 1058 transitions. [2018-10-15 13:21:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 13:21:24,539 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 196 [2018-10-15 13:21:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:24,540 INFO L225 Difference]: With dead ends: 1030 [2018-10-15 13:21:24,540 INFO L226 Difference]: Without dead ends: 1024 [2018-10-15 13:21:24,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4317 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4692, Invalid=15900, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 13:21:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2018-10-15 13:21:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 416. [2018-10-15 13:21:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 13:21:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 444 transitions. [2018-10-15 13:21:24,545 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 444 transitions. Word has length 196 [2018-10-15 13:21:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:24,545 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 444 transitions. [2018-10-15 13:21:24,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:21:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 444 transitions. [2018-10-15 13:21:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:24,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:24,546 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:24,546 INFO L424 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:24,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1764608805, now seen corresponding path program 20 times [2018-10-15 13:21:24,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 0 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:25,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:25,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:21:25,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:21:25,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:21:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:21:25,118 INFO L87 Difference]: Start difference. First operand 416 states and 444 transitions. Second operand 45 states. [2018-10-15 13:21:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:26,299 INFO L93 Difference]: Finished difference Result 610 states and 638 transitions. [2018-10-15 13:21:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:21:26,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 199 [2018-10-15 13:21:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:26,300 INFO L225 Difference]: With dead ends: 610 [2018-10-15 13:21:26,300 INFO L226 Difference]: Without dead ends: 604 [2018-10-15 13:21:26,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:21:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-15 13:21:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 428. [2018-10-15 13:21:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:26,304 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:26,305 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:26,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:21:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:26,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:26,306 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:26,306 INFO L424 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:26,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1502622035, now seen corresponding path program 246 times [2018-10-15 13:21:26,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 0 proven. 1437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:26,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:26,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:21:26,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:21:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:21:26,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:21:26,913 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 47 states. [2018-10-15 13:21:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:28,086 INFO L93 Difference]: Finished difference Result 1075 states and 1103 transitions. [2018-10-15 13:21:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:21:28,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-10-15 13:21:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:28,087 INFO L225 Difference]: With dead ends: 1075 [2018-10-15 13:21:28,087 INFO L226 Difference]: Without dead ends: 1069 [2018-10-15 13:21:28,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2288, Invalid=6454, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:21:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-15 13:21:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 428. [2018-10-15 13:21:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:28,093 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:28,093 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:28,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:21:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:28,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:28,094 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:28,094 INFO L424 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:28,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1906796289, now seen corresponding path program 247 times [2018-10-15 13:21:28,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 0 proven. 1214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:28,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:21:28,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:21:28,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:21:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1869, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:21:28,770 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 49 states. [2018-10-15 13:21:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:30,120 INFO L93 Difference]: Finished difference Result 1291 states and 1319 transitions. [2018-10-15 13:21:30,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:21:30,121 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 199 [2018-10-15 13:21:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:30,122 INFO L225 Difference]: With dead ends: 1291 [2018-10-15 13:21:30,122 INFO L226 Difference]: Without dead ends: 1285 [2018-10-15 13:21:30,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2423, Invalid=7677, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:21:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-10-15 13:21:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 428. [2018-10-15 13:21:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:30,127 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:30,127 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:30,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:21:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:30,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:30,128 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:30,128 INFO L424 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:30,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:30,128 INFO L82 PathProgramCache]: Analyzing trace with hash -498093103, now seen corresponding path program 248 times [2018-10-15 13:21:30,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:21:30,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:21:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:21:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2048, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:21:30,810 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 51 states. [2018-10-15 13:21:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:32,284 INFO L93 Difference]: Finished difference Result 1435 states and 1463 transitions. [2018-10-15 13:21:32,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:21:32,285 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 199 [2018-10-15 13:21:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:32,286 INFO L225 Difference]: With dead ends: 1435 [2018-10-15 13:21:32,286 INFO L226 Difference]: Without dead ends: 1429 [2018-10-15 13:21:32,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2622, Invalid=8934, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:21:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2018-10-15 13:21:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 428. [2018-10-15 13:21:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:32,292 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:32,292 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:32,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:21:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:32,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:32,293 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:32,293 INFO L424 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:32,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1184907043, now seen corresponding path program 249 times [2018-10-15 13:21:32,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 0 proven. 1038 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:33,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:21:33,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:21:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:21:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=2221, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:21:33,067 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 53 states. [2018-10-15 13:21:34,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:34,694 INFO L93 Difference]: Finished difference Result 1507 states and 1535 transitions. [2018-10-15 13:21:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:21:34,695 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 199 [2018-10-15 13:21:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:34,696 INFO L225 Difference]: With dead ends: 1507 [2018-10-15 13:21:34,696 INFO L226 Difference]: Without dead ends: 1501 [2018-10-15 13:21:34,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2814 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2885, Invalid=10225, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:21:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2018-10-15 13:21:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 428. [2018-10-15 13:21:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:34,701 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:34,701 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:34,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:21:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:34,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:34,702 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:34,702 INFO L424 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:34,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 35478261, now seen corresponding path program 250 times [2018-10-15 13:21:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:35,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:35,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:21:35,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:21:35,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:21:35,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=2388, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:21:35,480 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 55 states. [2018-10-15 13:21:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:37,308 INFO L93 Difference]: Finished difference Result 1511 states and 1539 transitions. [2018-10-15 13:21:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 13:21:37,308 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 199 [2018-10-15 13:21:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:37,310 INFO L225 Difference]: With dead ends: 1511 [2018-10-15 13:21:37,310 INFO L226 Difference]: Without dead ends: 1505 [2018-10-15 13:21:37,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3212, Invalid=11550, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:21:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2018-10-15 13:21:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 428. [2018-10-15 13:21:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:37,315 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:37,315 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:37,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:21:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:37,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:37,316 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:37,316 INFO L424 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:37,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 270673735, now seen corresponding path program 251 times [2018-10-15 13:21:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 0 proven. 1222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:38,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:38,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:21:38,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:21:38,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:21:38,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=643, Invalid=2549, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:21:38,160 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 57 states. [2018-10-15 13:21:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:40,217 INFO L93 Difference]: Finished difference Result 1475 states and 1503 transitions. [2018-10-15 13:21:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:21:40,217 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 199 [2018-10-15 13:21:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:40,218 INFO L225 Difference]: With dead ends: 1475 [2018-10-15 13:21:40,219 INFO L226 Difference]: Without dead ends: 1469 [2018-10-15 13:21:40,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3492 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3603, Invalid=12909, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:21:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-15 13:21:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 428. [2018-10-15 13:21:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:40,224 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:40,224 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:40,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:21:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:40,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:40,225 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:40,225 INFO L424 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:40,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1299069927, now seen corresponding path program 252 times [2018-10-15 13:21:40,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 0 proven. 1449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:41,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:41,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:21:41,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:21:41,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:21:41,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=718, Invalid=2704, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:21:41,105 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 59 states. [2018-10-15 13:21:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:43,392 INFO L93 Difference]: Finished difference Result 1367 states and 1395 transitions. [2018-10-15 13:21:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 13:21:43,392 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 199 [2018-10-15 13:21:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:43,393 INFO L225 Difference]: With dead ends: 1367 [2018-10-15 13:21:43,393 INFO L226 Difference]: Without dead ends: 1361 [2018-10-15 13:21:43,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3864 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4058, Invalid=14302, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 13:21:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-10-15 13:21:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 428. [2018-10-15 13:21:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:43,399 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:43,399 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:43,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:21:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:43,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:43,400 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:43,400 INFO L424 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:43,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2083040917, now seen corresponding path program 253 times [2018-10-15 13:21:43,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1766 backedges. 0 proven. 1766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:44,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:44,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:21:44,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:21:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:21:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=2853, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:21:44,366 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 61 states. [2018-10-15 13:21:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:47,002 INFO L93 Difference]: Finished difference Result 1187 states and 1215 transitions. [2018-10-15 13:21:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 13:21:47,002 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 199 [2018-10-15 13:21:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:47,003 INFO L225 Difference]: With dead ends: 1187 [2018-10-15 13:21:47,004 INFO L226 Difference]: Without dead ends: 1181 [2018-10-15 13:21:47,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4263 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4577, Invalid=15729, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:21:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-10-15 13:21:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 428. [2018-10-15 13:21:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 13:21:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 456 transitions. [2018-10-15 13:21:47,009 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 456 transitions. Word has length 199 [2018-10-15 13:21:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:47,009 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 456 transitions. [2018-10-15 13:21:47,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:21:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 456 transitions. [2018-10-15 13:21:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 13:21:47,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:47,010 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 3, 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] [2018-10-15 13:21:47,010 INFO L424 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 149286717, now seen corresponding path program 254 times [2018-10-15 13:21:47,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2173 backedges. 0 proven. 2173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:48,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:48,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:21:48,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:21:48,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:21:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=2996, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:21:48,035 INFO L87 Difference]: Start difference. First operand 428 states and 456 transitions. Second operand 63 states. [2018-10-15 13:21:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:50,901 INFO L93 Difference]: Finished difference Result 944 states and 973 transitions. [2018-10-15 13:21:50,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 13:21:50,902 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 199 [2018-10-15 13:21:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:50,903 INFO L225 Difference]: With dead ends: 944 [2018-10-15 13:21:50,903 INFO L226 Difference]: Without dead ends: 938 [2018-10-15 13:21:50,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4689 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5160, Invalid=17190, Unknown=0, NotChecked=0, Total=22350 [2018-10-15 13:21:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-15 13:21:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 434. [2018-10-15 13:21:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:21:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 13:21:50,908 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 199 [2018-10-15 13:21:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:50,908 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 13:21:50,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:21:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 13:21:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:21:50,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:50,909 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:50,909 INFO L424 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:50,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash -419978021, now seen corresponding path program 255 times [2018-10-15 13:21:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 1587 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:51,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:51,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:21:51,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:21:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:21:51,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1668, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:21:51,504 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 47 states. [2018-10-15 13:21:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:52,697 INFO L93 Difference]: Finished difference Result 950 states and 979 transitions. [2018-10-15 13:21:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:21:52,698 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 202 [2018-10-15 13:21:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:52,699 INFO L225 Difference]: With dead ends: 950 [2018-10-15 13:21:52,699 INFO L226 Difference]: Without dead ends: 944 [2018-10-15 13:21:52,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2328, Invalid=6228, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:21:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-10-15 13:21:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 434. [2018-10-15 13:21:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:21:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 13:21:52,703 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 13:21:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:52,704 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 13:21:52,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:21:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 13:21:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:21:52,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:52,704 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:52,705 INFO L424 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:52,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1764206903, now seen corresponding path program 256 times [2018-10-15 13:21:52,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 0 proven. 1328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:53,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:53,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:21:53,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:21:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:21:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=1858, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:21:53,351 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 49 states. [2018-10-15 13:21:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:54,602 INFO L93 Difference]: Finished difference Result 1202 states and 1231 transitions. [2018-10-15 13:21:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:21:54,602 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 202 [2018-10-15 13:21:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:54,603 INFO L225 Difference]: With dead ends: 1202 [2018-10-15 13:21:54,603 INFO L226 Difference]: Without dead ends: 1196 [2018-10-15 13:21:54,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2442, Invalid=7458, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 13:21:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-10-15 13:21:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 434. [2018-10-15 13:21:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:21:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 13:21:54,608 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 13:21:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:54,609 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 13:21:54,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:21:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 13:21:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:21:54,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:54,609 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:54,609 INFO L424 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:54,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1568847817, now seen corresponding path program 257 times [2018-10-15 13:21:54,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:55,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:55,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:21:55,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:21:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:21:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2042, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:21:55,301 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 51 states. [2018-10-15 13:21:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:56,748 INFO L93 Difference]: Finished difference Result 1382 states and 1411 transitions. [2018-10-15 13:21:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:21:56,749 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 202 [2018-10-15 13:21:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:56,750 INFO L225 Difference]: With dead ends: 1382 [2018-10-15 13:21:56,750 INFO L226 Difference]: Without dead ends: 1376 [2018-10-15 13:21:56,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2399 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2620, Invalid=8722, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:21:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-10-15 13:21:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 434. [2018-10-15 13:21:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:21:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 13:21:56,755 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 13:21:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:56,755 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 13:21:56,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:21:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 13:21:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:21:56,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:56,756 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:56,756 INFO L424 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:56,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash 941578533, now seen corresponding path program 258 times [2018-10-15 13:21:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:57,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:57,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:21:57,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:21:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:21:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=2220, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:21:57,510 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 53 states. [2018-10-15 13:21:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:59,044 INFO L93 Difference]: Finished difference Result 1490 states and 1519 transitions. [2018-10-15 13:21:59,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 13:21:59,044 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 202 [2018-10-15 13:21:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:59,045 INFO L225 Difference]: With dead ends: 1490 [2018-10-15 13:21:59,046 INFO L226 Difference]: Without dead ends: 1484 [2018-10-15 13:21:59,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2862, Invalid=10020, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 13:21:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-10-15 13:21:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 434. [2018-10-15 13:21:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:21:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 13:21:59,051 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 13:21:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:59,051 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 13:21:59,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:21:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 13:21:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:21:59,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:59,052 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 12, 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] [2018-10-15 13:21:59,052 INFO L424 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:59,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1013934483, now seen corresponding path program 259 times [2018-10-15 13:21:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 0 proven. 1091 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:59,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:59,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:21:59,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:21:59,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:21:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=2392, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:21:59,831 INFO L87 Difference]: Start difference. First operand 434 states and 463 transitions. Second operand 55 states. [2018-10-15 13:22:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:22:01,616 INFO L93 Difference]: Finished difference Result 1526 states and 1555 transitions. [2018-10-15 13:22:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 13:22:01,617 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 202 [2018-10-15 13:22:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:22:01,618 INFO L225 Difference]: With dead ends: 1526 [2018-10-15 13:22:01,618 INFO L226 Difference]: Without dead ends: 1520 [2018-10-15 13:22:01,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3112 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3168, Invalid=11352, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:22:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-10-15 13:22:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 434. [2018-10-15 13:22:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 13:22:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 463 transitions. [2018-10-15 13:22:01,624 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 463 transitions. Word has length 202 [2018-10-15 13:22:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:22:01,624 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 463 transitions. [2018-10-15 13:22:01,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:22:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 463 transitions. [2018-10-15 13:22:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:22:01,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:22:01,625 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 10, 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] [2018-10-15 13:22:01,625 INFO L424 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:22:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:22:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2023119233, now seen corresponding path program 260 times [2018-10-15 13:22:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:22:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat