java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX --icfgtransformation.map.elimination.monniaux.number.of.cells 1 -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:49:44,192 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:49:44,194 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:49:44,205 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:49:44,205 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:49:44,206 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:49:44,208 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:49:44,209 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:49:44,211 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:49:44,212 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:49:44,213 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:49:44,213 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:49:44,214 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:49:44,215 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:49:44,216 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:49:44,217 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:49:44,218 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:49:44,220 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:49:44,221 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:49:44,223 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:49:44,224 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:49:44,225 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:49:44,228 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:49:44,228 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:49:44,228 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:49:44,229 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:49:44,229 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:49:44,230 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:49:44,230 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:49:44,231 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:49:44,232 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:49:44,233 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:49:44,234 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:49:44,234 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:49:44,235 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:49:44,235 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:49:44,235 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:49:44,236 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:49:44,237 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: Map elimination Monniaux: number of cells -> 1 [2019-05-23 09:49:44,265 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:49:44,277 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:49:44,280 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:49:44,281 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:49:44,282 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:49:44,282 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-05-23 09:49:44,283 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-05-23 09:49:44,312 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:49:44,314 INFO L146 ILogger]: Walking toolchain with 5 elements. [2019-05-23 09:49:44,314 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:49:44,314 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:49:44,315 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:49:44,330 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,339 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,344 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:49:44,345 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:49:44,345 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:49:44,347 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:49:44,347 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:49:44,348 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:49:44,348 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:49:44,358 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,358 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,359 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,359 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,362 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,366 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,367 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,368 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:49:44,368 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:49:44,368 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:49:44,368 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:49:44,369 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (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:4096 -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:4096 -smt2 -in -t:12000 [2019-05-23 09:49:44,434 INFO L146 ILogger]: Found specification of procedure proc [2019-05-23 09:49:44,434 INFO L146 ILogger]: Found implementation of procedure proc [2019-05-23 09:49:44,623 INFO L146 ILogger]: Using library mode [2019-05-23 09:49:44,624 INFO L146 ILogger]: Removed 1 assume(true) statements. [2019-05-23 09:49:44,625 INFO L146 ILogger]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44 BoogieIcfgContainer [2019-05-23 09:49:44,625 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:49:44,626 INFO L146 ILogger]: ------------------------IcfgTransformer---------------------------- [2019-05-23 09:49:44,629 INFO L146 ILogger]: Initializing IcfgTransformer... [2019-05-23 09:49:44,630 INFO L146 ILogger]: IcfgTransformer initialized [2019-05-23 09:49:44,634 INFO L146 ILogger]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,679 INFO L146 ILogger]: L17-1 [2019-05-23 09:49:44,680 INFO L146 ILogger]: In Formula: (and (= v_proc_i_3 (+ v_proc_i_4 4)) (< (+ v_proc_i_4 4) (select v_proc_a_1 v_proc_j_1)) (< v_proc_j_1 6) (<= v_proc_i_4 1000) (= (select v_proc_a_1 5) 1000) (< 4 v_proc_j_1)) InVars {proc_a=v_proc_a_1, proc_j=v_proc_j_1, proc_i=v_proc_i_4} OutVars{proc_a=v_proc_a_1, proc_j=v_proc_j_1, proc_i=v_proc_i_3} AuxVars[] AssignedVars[proc_i] [2019-05-23 09:49:44,682 INFO L146 ILogger]: Out Formula: (and v_proc_a_idx_0_term_assigned_1 (or (not v_proc_a_idx_0_term_assigned_1) (= v_proc_a_idx_0_term_1 5) (= v_proc_a_idx_0_term_1 v_proc_j_1)) (= v_proc_i_3 (+ v_proc_i_4 4)) (= v_v_proc_a_1_aux_2 1000) (< v_proc_j_1 6) (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not (= v_proc_a_idx_0_term_1 v_proc_j_1)) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (= v_v_proc_a_1_aux_2 v_proc_a_val_0_in_1) (not (= v_proc_a_idx_0_term_1 5))) (<= v_proc_i_4 1000) (< 4 v_proc_j_1)) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_3} AuxVars[v_v_proc_a_1_aux_2, v_v_proc_a_1_aux_1] AssignedVars[proc_i] [2019-05-23 09:49:44,682 INFO L146 ILogger]: L17-1 [2019-05-23 09:49:44,691 INFO L146 ILogger]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 09:49:44 BasicIcfg [2019-05-23 09:49:44,691 INFO L146 ILogger]: ------------------------ END IcfgTransformer---------------------------- [2019-05-23 09:49:44,692 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:49:44,692 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:49:44,696 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:49:44,697 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/3) ... [2019-05-23 09:49:44,698 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77515dac and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:49:44, skipping insertion in model container [2019-05-23 09:49:44,698 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44" (2/3) ... [2019-05-23 09:49:44,698 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77515dac and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:49:44, skipping insertion in model container [2019-05-23 09:49:44,699 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 09:49:44" (3/3) ... [2019-05-23 09:49:44,702 INFO L146 ILogger]: Analyzing ICFG LargeConstant-ForwardSuccess.bplME [2019-05-23 09:49:44,711 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:49:44,722 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:49:44,734 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:49:44,755 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:49:44,756 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:49:44,756 INFO L146 ILogger]: Hoare is false [2019-05-23 09:49:44,756 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:49:44,756 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:49:44,757 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:49:44,757 INFO L146 ILogger]: Difference is false [2019-05-23 09:49:44,757 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:49:44,757 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:49:44,768 INFO L146 ILogger]: Start isEmpty. Operand 4 states. [2019-05-23 09:49:44,776 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 3 [2019-05-23 09:49:44,777 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:44,777 INFO L146 ILogger]: trace histogram [1, 1] [2019-05-23 09:49:44,779 INFO L146 ILogger]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:44,785 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:44,785 INFO L146 ILogger]: Analyzing trace with hash 1218, now seen corresponding path program 1 times [2019-05-23 09:49:44,830 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:44,852 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:44,854 INFO L146 ILogger]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:49:44,857 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:44,934 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:44,937 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:49:44,937 INFO L146 ILogger]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-23 09:49:44,941 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:49:44,951 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:49:44,951 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:49:44,953 INFO L146 ILogger]: Start difference. First operand 4 states. Second operand 3 states. [2019-05-23 09:49:45,010 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,011 INFO L146 ILogger]: Finished difference Result 6 states and 6 transitions. [2019-05-23 09:49:45,011 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:49:45,013 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-23 09:49:45,013 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,022 INFO L146 ILogger]: With dead ends: 6 [2019-05-23 09:49:45,023 INFO L146 ILogger]: Without dead ends: 4 [2019-05-23 09:49:45,024 INFO L146 ILogger]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:49:45,041 INFO L146 ILogger]: Start minimizeSevpa. Operand 4 states. [2019-05-23 09:49:45,052 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-05-23 09:49:45,053 INFO L146 ILogger]: Start removeUnreachable. Operand 4 states. [2019-05-23 09:49:45,054 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-23 09:49:45,055 INFO L146 ILogger]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-05-23 09:49:45,055 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,056 INFO L146 ILogger]: Abstraction has 4 states and 4 transitions. [2019-05-23 09:49:45,056 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:49:45,056 INFO L146 ILogger]: Start isEmpty. Operand 4 states and 4 transitions. [2019-05-23 09:49:45,056 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 4 [2019-05-23 09:49:45,056 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,057 INFO L146 ILogger]: trace histogram [1, 1, 1] [2019-05-23 09:49:45,057 INFO L146 ILogger]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,057 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,058 INFO L146 ILogger]: Analyzing trace with hash 37798, now seen corresponding path program 1 times [2019-05-23 09:49:45,059 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,070 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,072 INFO L146 ILogger]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,072 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,131 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,132 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,132 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-05-23 09:49:45,134 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:49:45,134 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:49:45,134 INFO L146 ILogger]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:49:45,135 INFO L146 ILogger]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-05-23 09:49:45,162 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,163 INFO L146 ILogger]: Finished difference Result 5 states and 5 transitions. [2019-05-23 09:49:45,163 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:49:45,164 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 3 [2019-05-23 09:49:45,164 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,164 INFO L146 ILogger]: With dead ends: 5 [2019-05-23 09:49:45,164 INFO L146 ILogger]: Without dead ends: 5 [2019-05-23 09:49:45,166 INFO L146 ILogger]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:49:45,166 INFO L146 ILogger]: Start minimizeSevpa. Operand 5 states. [2019-05-23 09:49:45,167 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-23 09:49:45,167 INFO L146 ILogger]: Start removeUnreachable. Operand 5 states. [2019-05-23 09:49:45,167 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-23 09:49:45,168 INFO L146 ILogger]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-23 09:49:45,168 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,168 INFO L146 ILogger]: Abstraction has 5 states and 5 transitions. [2019-05-23 09:49:45,168 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:49:45,169 INFO L146 ILogger]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-23 09:49:45,169 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 5 [2019-05-23 09:49:45,169 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,169 INFO L146 ILogger]: trace histogram [2, 1, 1] [2019-05-23 09:49:45,170 INFO L146 ILogger]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,170 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,170 INFO L146 ILogger]: Analyzing trace with hash 1171778, now seen corresponding path program 2 times [2019-05-23 09:49:45,171 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,186 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,188 INFO L146 ILogger]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,189 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,368 INFO L146 ILogger]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,368 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,369 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 09:49:45,369 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:49:45,370 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:49:45,370 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:49:45,371 INFO L146 ILogger]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-05-23 09:49:45,403 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,403 INFO L146 ILogger]: Finished difference Result 6 states and 6 transitions. [2019-05-23 09:49:45,404 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:49:45,404 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 4 [2019-05-23 09:49:45,405 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,405 INFO L146 ILogger]: With dead ends: 6 [2019-05-23 09:49:45,405 INFO L146 ILogger]: Without dead ends: 6 [2019-05-23 09:49:45,406 INFO L146 ILogger]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:49:45,406 INFO L146 ILogger]: Start minimizeSevpa. Operand 6 states. [2019-05-23 09:49:45,408 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-05-23 09:49:45,408 INFO L146 ILogger]: Start removeUnreachable. Operand 6 states. [2019-05-23 09:49:45,409 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-05-23 09:49:45,409 INFO L146 ILogger]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-05-23 09:49:45,409 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,410 INFO L146 ILogger]: Abstraction has 6 states and 6 transitions. [2019-05-23 09:49:45,410 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:49:45,410 INFO L146 ILogger]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-23 09:49:45,410 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 6 [2019-05-23 09:49:45,410 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,410 INFO L146 ILogger]: trace histogram [3, 1, 1] [2019-05-23 09:49:45,411 INFO L146 ILogger]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,411 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,411 INFO L146 ILogger]: Analyzing trace with hash 36325158, now seen corresponding path program 3 times [2019-05-23 09:49:45,412 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,429 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,431 INFO L146 ILogger]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,432 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,502 INFO L146 ILogger]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,502 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,503 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 09:49:45,503 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:49:45,503 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:49:45,504 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:49:45,504 INFO L146 ILogger]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-05-23 09:49:45,551 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,551 INFO L146 ILogger]: Finished difference Result 7 states and 7 transitions. [2019-05-23 09:49:45,551 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:49:45,551 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 5 [2019-05-23 09:49:45,552 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,552 INFO L146 ILogger]: With dead ends: 7 [2019-05-23 09:49:45,552 INFO L146 ILogger]: Without dead ends: 7 [2019-05-23 09:49:45,553 INFO L146 ILogger]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:49:45,553 INFO L146 ILogger]: Start minimizeSevpa. Operand 7 states. [2019-05-23 09:49:45,554 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-23 09:49:45,554 INFO L146 ILogger]: Start removeUnreachable. Operand 7 states. [2019-05-23 09:49:45,555 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-23 09:49:45,555 INFO L146 ILogger]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-05-23 09:49:45,556 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,556 INFO L146 ILogger]: Abstraction has 7 states and 7 transitions. [2019-05-23 09:49:45,556 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:49:45,556 INFO L146 ILogger]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-23 09:49:45,557 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 7 [2019-05-23 09:49:45,557 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,557 INFO L146 ILogger]: trace histogram [4, 1, 1] [2019-05-23 09:49:45,557 INFO L146 ILogger]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,558 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,558 INFO L146 ILogger]: Analyzing trace with hash 1126079938, now seen corresponding path program 4 times [2019-05-23 09:49:45,559 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,593 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,598 INFO L146 ILogger]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,599 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,769 INFO L146 ILogger]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,770 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,770 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:49:45,770 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:49:45,771 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:49:45,772 INFO L146 ILogger]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:49:45,772 INFO L146 ILogger]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-05-23 09:49:45,885 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,885 INFO L146 ILogger]: Finished difference Result 8 states and 8 transitions. [2019-05-23 09:49:45,886 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:49:45,886 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 6 [2019-05-23 09:49:45,886 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,886 INFO L146 ILogger]: With dead ends: 8 [2019-05-23 09:49:45,887 INFO L146 ILogger]: Without dead ends: 8 [2019-05-23 09:49:45,887 INFO L146 ILogger]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:49:45,887 INFO L146 ILogger]: Start minimizeSevpa. Operand 8 states. [2019-05-23 09:49:45,888 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-05-23 09:49:45,889 INFO L146 ILogger]: Start removeUnreachable. Operand 8 states. [2019-05-23 09:49:45,889 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-05-23 09:49:45,889 INFO L146 ILogger]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-05-23 09:49:45,889 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,890 INFO L146 ILogger]: Abstraction has 8 states and 8 transitions. [2019-05-23 09:49:45,890 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:49:45,890 INFO L146 ILogger]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-23 09:49:45,890 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 8 [2019-05-23 09:49:45,890 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,891 INFO L146 ILogger]: trace histogram [5, 1, 1] [2019-05-23 09:49:45,891 INFO L146 ILogger]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,891 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,891 INFO L146 ILogger]: Analyzing trace with hash 548739750, now seen corresponding path program 5 times [2019-05-23 09:49:45,892 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,913 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,915 INFO L146 ILogger]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,916 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,075 INFO L146 ILogger]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,076 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,076 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:49:46,076 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:49:46,077 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:49:46,077 INFO L146 ILogger]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:46,077 INFO L146 ILogger]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-05-23 09:49:46,107 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,107 INFO L146 ILogger]: Finished difference Result 9 states and 9 transitions. [2019-05-23 09:49:46,108 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:49:46,108 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 7 [2019-05-23 09:49:46,109 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,110 INFO L146 ILogger]: With dead ends: 9 [2019-05-23 09:49:46,110 INFO L146 ILogger]: Without dead ends: 9 [2019-05-23 09:49:46,110 INFO L146 ILogger]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:46,110 INFO L146 ILogger]: Start minimizeSevpa. Operand 9 states. [2019-05-23 09:49:46,111 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-05-23 09:49:46,112 INFO L146 ILogger]: Start removeUnreachable. Operand 9 states. [2019-05-23 09:49:46,112 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-23 09:49:46,112 INFO L146 ILogger]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-05-23 09:49:46,112 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,112 INFO L146 ILogger]: Abstraction has 9 states and 9 transitions. [2019-05-23 09:49:46,113 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:49:46,113 INFO L146 ILogger]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-23 09:49:46,113 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 9 [2019-05-23 09:49:46,113 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,113 INFO L146 ILogger]: trace histogram [6, 1, 1] [2019-05-23 09:49:46,113 INFO L146 ILogger]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,114 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,114 INFO L146 ILogger]: Analyzing trace with hash -168936894, now seen corresponding path program 6 times [2019-05-23 09:49:46,115 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,137 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,139 INFO L146 ILogger]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,140 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,325 INFO L146 ILogger]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,325 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,325 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:49:46,325 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:49:46,326 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:49:46,326 INFO L146 ILogger]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:49:46,326 INFO L146 ILogger]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-05-23 09:49:46,355 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,355 INFO L146 ILogger]: Finished difference Result 10 states and 10 transitions. [2019-05-23 09:49:46,356 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:49:46,356 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 8 [2019-05-23 09:49:46,356 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,356 INFO L146 ILogger]: With dead ends: 10 [2019-05-23 09:49:46,356 INFO L146 ILogger]: Without dead ends: 10 [2019-05-23 09:49:46,357 INFO L146 ILogger]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:49:46,357 INFO L146 ILogger]: Start minimizeSevpa. Operand 10 states. [2019-05-23 09:49:46,359 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-05-23 09:49:46,359 INFO L146 ILogger]: Start removeUnreachable. Operand 10 states. [2019-05-23 09:49:46,360 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-05-23 09:49:46,360 INFO L146 ILogger]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-05-23 09:49:46,360 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,360 INFO L146 ILogger]: Abstraction has 10 states and 10 transitions. [2019-05-23 09:49:46,360 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:49:46,361 INFO L146 ILogger]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-23 09:49:46,362 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 10 [2019-05-23 09:49:46,362 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,362 INFO L146 ILogger]: trace histogram [7, 1, 1] [2019-05-23 09:49:46,363 INFO L146 ILogger]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,363 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,363 INFO L146 ILogger]: Analyzing trace with hash -942076378, now seen corresponding path program 7 times [2019-05-23 09:49:46,364 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,390 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,397 INFO L146 ILogger]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,399 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,493 INFO L146 ILogger]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,494 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,494 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:49:46,494 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:49:46,494 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:49:46,495 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:49:46,495 INFO L146 ILogger]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-05-23 09:49:46,522 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,522 INFO L146 ILogger]: Finished difference Result 11 states and 11 transitions. [2019-05-23 09:49:46,523 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:49:46,523 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 9 [2019-05-23 09:49:46,523 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,524 INFO L146 ILogger]: With dead ends: 11 [2019-05-23 09:49:46,524 INFO L146 ILogger]: Without dead ends: 11 [2019-05-23 09:49:46,524 INFO L146 ILogger]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:49:46,525 INFO L146 ILogger]: Start minimizeSevpa. Operand 11 states. [2019-05-23 09:49:46,526 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-05-23 09:49:46,527 INFO L146 ILogger]: Start removeUnreachable. Operand 11 states. [2019-05-23 09:49:46,527 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-05-23 09:49:46,528 INFO L146 ILogger]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-05-23 09:49:46,528 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,528 INFO L146 ILogger]: Abstraction has 11 states and 11 transitions. [2019-05-23 09:49:46,528 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:49:46,528 INFO L146 ILogger]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-23 09:49:46,529 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 11 [2019-05-23 09:49:46,529 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,529 INFO L146 ILogger]: trace histogram [8, 1, 1] [2019-05-23 09:49:46,529 INFO L146 ILogger]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,530 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,530 INFO L146 ILogger]: Analyzing trace with hash 860403394, now seen corresponding path program 8 times [2019-05-23 09:49:46,531 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,552 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,555 INFO L146 ILogger]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,556 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,946 INFO L146 ILogger]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,947 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,947 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:49:46,948 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:49:46,948 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:49:46,948 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:49:46,949 INFO L146 ILogger]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-05-23 09:49:46,968 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,968 INFO L146 ILogger]: Finished difference Result 12 states and 12 transitions. [2019-05-23 09:49:46,968 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:49:46,968 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 10 [2019-05-23 09:49:46,968 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,970 INFO L146 ILogger]: With dead ends: 12 [2019-05-23 09:49:46,970 INFO L146 ILogger]: Without dead ends: 12 [2019-05-23 09:49:46,971 INFO L146 ILogger]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:49:46,971 INFO L146 ILogger]: Start minimizeSevpa. Operand 12 states. [2019-05-23 09:49:46,973 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-05-23 09:49:46,973 INFO L146 ILogger]: Start removeUnreachable. Operand 12 states. [2019-05-23 09:49:46,974 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-05-23 09:49:46,974 INFO L146 ILogger]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-05-23 09:49:46,974 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,974 INFO L146 ILogger]: Abstraction has 12 states and 12 transitions. [2019-05-23 09:49:46,974 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:49:46,974 INFO L146 ILogger]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-23 09:49:46,975 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 12 [2019-05-23 09:49:46,975 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,975 INFO L146 ILogger]: trace histogram [9, 1, 1] [2019-05-23 09:49:46,975 INFO L146 ILogger]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,975 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,976 INFO L146 ILogger]: Analyzing trace with hash 902701478, now seen corresponding path program 9 times [2019-05-23 09:49:46,976 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,012 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,018 INFO L146 ILogger]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,019 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,213 INFO L146 ILogger]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,213 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,214 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:49:47,214 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:49:47,215 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:49:47,215 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:49:47,216 INFO L146 ILogger]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-05-23 09:49:47,241 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,241 INFO L146 ILogger]: Finished difference Result 13 states and 13 transitions. [2019-05-23 09:49:47,241 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:49:47,242 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 11 [2019-05-23 09:49:47,242 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,242 INFO L146 ILogger]: With dead ends: 13 [2019-05-23 09:49:47,242 INFO L146 ILogger]: Without dead ends: 13 [2019-05-23 09:49:47,243 INFO L146 ILogger]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:49:47,243 INFO L146 ILogger]: Start minimizeSevpa. Operand 13 states. [2019-05-23 09:49:47,244 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-05-23 09:49:47,245 INFO L146 ILogger]: Start removeUnreachable. Operand 13 states. [2019-05-23 09:49:47,245 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-05-23 09:49:47,245 INFO L146 ILogger]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-05-23 09:49:47,245 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,246 INFO L146 ILogger]: Abstraction has 13 states and 13 transitions. [2019-05-23 09:49:47,246 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:49:47,246 INFO L146 ILogger]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-23 09:49:47,246 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 13 [2019-05-23 09:49:47,247 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,247 INFO L146 ILogger]: trace histogram [10, 1, 1] [2019-05-23 09:49:47,247 INFO L146 ILogger]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,247 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,248 INFO L146 ILogger]: Analyzing trace with hash -2081025214, now seen corresponding path program 10 times [2019-05-23 09:49:47,248 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,269 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,271 INFO L146 ILogger]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,272 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,408 INFO L146 ILogger]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,408 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,409 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:49:47,409 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:49:47,409 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:49:47,410 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:49:47,410 INFO L146 ILogger]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-05-23 09:49:47,453 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,454 INFO L146 ILogger]: Finished difference Result 14 states and 14 transitions. [2019-05-23 09:49:47,454 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:49:47,454 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 12 [2019-05-23 09:49:47,454 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,455 INFO L146 ILogger]: With dead ends: 14 [2019-05-23 09:49:47,455 INFO L146 ILogger]: Without dead ends: 14 [2019-05-23 09:49:47,455 INFO L146 ILogger]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:49:47,455 INFO L146 ILogger]: Start minimizeSevpa. Operand 14 states. [2019-05-23 09:49:47,457 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-05-23 09:49:47,457 INFO L146 ILogger]: Start removeUnreachable. Operand 14 states. [2019-05-23 09:49:47,457 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-05-23 09:49:47,457 INFO L146 ILogger]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-05-23 09:49:47,458 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,458 INFO L146 ILogger]: Abstraction has 14 states and 14 transitions. [2019-05-23 09:49:47,458 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:49:47,458 INFO L146 ILogger]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-23 09:49:47,458 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 09:49:47,458 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,459 INFO L146 ILogger]: trace histogram [11, 1, 1] [2019-05-23 09:49:47,459 INFO L146 ILogger]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,459 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,459 INFO L146 ILogger]: Analyzing trace with hash -87272154, now seen corresponding path program 11 times [2019-05-23 09:49:47,460 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,479 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,481 INFO L146 ILogger]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,482 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,783 INFO L146 ILogger]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,783 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,784 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:49:47,784 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:49:47,785 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:49:47,785 INFO L146 ILogger]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:47,785 INFO L146 ILogger]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-05-23 09:49:47,849 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,849 INFO L146 ILogger]: Finished difference Result 15 states and 15 transitions. [2019-05-23 09:49:47,850 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:49:47,850 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 13 [2019-05-23 09:49:47,850 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,850 INFO L146 ILogger]: With dead ends: 15 [2019-05-23 09:49:47,851 INFO L146 ILogger]: Without dead ends: 15 [2019-05-23 09:49:47,851 INFO L146 ILogger]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:47,851 INFO L146 ILogger]: Start minimizeSevpa. Operand 15 states. [2019-05-23 09:49:47,853 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-05-23 09:49:47,853 INFO L146 ILogger]: Start removeUnreachable. Operand 15 states. [2019-05-23 09:49:47,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-23 09:49:47,854 INFO L146 ILogger]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-05-23 09:49:47,854 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,854 INFO L146 ILogger]: Abstraction has 15 states and 15 transitions. [2019-05-23 09:49:47,854 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:49:47,854 INFO L146 ILogger]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-23 09:49:47,855 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 09:49:47,855 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,855 INFO L146 ILogger]: trace histogram [12, 1, 1] [2019-05-23 09:49:47,855 INFO L146 ILogger]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,856 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,856 INFO L146 ILogger]: Analyzing trace with hash 1589530562, now seen corresponding path program 12 times [2019-05-23 09:49:47,857 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,875 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,878 INFO L146 ILogger]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,879 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,029 INFO L146 ILogger]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,029 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,029 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:49:48,030 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:49:48,030 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:49:48,030 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:49:48,030 INFO L146 ILogger]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-05-23 09:49:48,052 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,052 INFO L146 ILogger]: Finished difference Result 16 states and 16 transitions. [2019-05-23 09:49:48,053 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:49:48,053 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 14 [2019-05-23 09:49:48,053 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,054 INFO L146 ILogger]: With dead ends: 16 [2019-05-23 09:49:48,054 INFO L146 ILogger]: Without dead ends: 16 [2019-05-23 09:49:48,055 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:49:48,055 INFO L146 ILogger]: Start minimizeSevpa. Operand 16 states. [2019-05-23 09:49:48,057 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-05-23 09:49:48,057 INFO L146 ILogger]: Start removeUnreachable. Operand 16 states. [2019-05-23 09:49:48,057 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-05-23 09:49:48,057 INFO L146 ILogger]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-05-23 09:49:48,058 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,058 INFO L146 ILogger]: Abstraction has 16 states and 16 transitions. [2019-05-23 09:49:48,058 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:49:48,058 INFO L146 ILogger]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-23 09:49:48,058 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 16 [2019-05-23 09:49:48,058 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,059 INFO L146 ILogger]: trace histogram [13, 1, 1] [2019-05-23 09:49:48,059 INFO L146 ILogger]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,059 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,059 INFO L146 ILogger]: Analyzing trace with hash 2030807206, now seen corresponding path program 13 times [2019-05-23 09:49:48,060 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,079 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,081 INFO L146 ILogger]: Trace formula consists of 161 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,082 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,300 INFO L146 ILogger]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,300 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,300 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:49:48,300 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:49:48,301 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:49:48,301 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:49:48,302 INFO L146 ILogger]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-05-23 09:49:48,326 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,326 INFO L146 ILogger]: Finished difference Result 17 states and 17 transitions. [2019-05-23 09:49:48,327 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:49:48,327 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 15 [2019-05-23 09:49:48,327 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,327 INFO L146 ILogger]: With dead ends: 17 [2019-05-23 09:49:48,328 INFO L146 ILogger]: Without dead ends: 17 [2019-05-23 09:49:48,328 INFO L146 ILogger]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:49:48,329 INFO L146 ILogger]: Start minimizeSevpa. Operand 17 states. [2019-05-23 09:49:48,331 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-05-23 09:49:48,331 INFO L146 ILogger]: Start removeUnreachable. Operand 17 states. [2019-05-23 09:49:48,332 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-05-23 09:49:48,332 INFO L146 ILogger]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-05-23 09:49:48,332 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,332 INFO L146 ILogger]: Abstraction has 17 states and 17 transitions. [2019-05-23 09:49:48,332 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:49:48,332 INFO L146 ILogger]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-23 09:49:48,333 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 17 [2019-05-23 09:49:48,333 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,333 INFO L146 ILogger]: trace histogram [14, 1, 1] [2019-05-23 09:49:48,333 INFO L146 ILogger]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,333 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,333 INFO L146 ILogger]: Analyzing trace with hash -1469486014, now seen corresponding path program 14 times [2019-05-23 09:49:48,334 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,352 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,355 INFO L146 ILogger]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,356 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,541 INFO L146 ILogger]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,542 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,542 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:49:48,543 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:49:48,543 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:49:48,544 INFO L146 ILogger]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:49:48,544 INFO L146 ILogger]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-05-23 09:49:48,568 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,568 INFO L146 ILogger]: Finished difference Result 18 states and 18 transitions. [2019-05-23 09:49:48,568 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:49:48,569 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 16 [2019-05-23 09:49:48,569 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,569 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 09:49:48,570 INFO L146 ILogger]: Without dead ends: 18 [2019-05-23 09:49:48,571 INFO L146 ILogger]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:49:48,571 INFO L146 ILogger]: Start minimizeSevpa. Operand 18 states. [2019-05-23 09:49:48,573 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-05-23 09:49:48,573 INFO L146 ILogger]: Start removeUnreachable. Operand 18 states. [2019-05-23 09:49:48,573 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-05-23 09:49:48,574 INFO L146 ILogger]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-05-23 09:49:48,574 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,574 INFO L146 ILogger]: Abstraction has 18 states and 18 transitions. [2019-05-23 09:49:48,574 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:49:48,574 INFO L146 ILogger]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-23 09:49:48,575 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 18 [2019-05-23 09:49:48,575 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,575 INFO L146 ILogger]: trace histogram [15, 1, 1] [2019-05-23 09:49:48,575 INFO L146 ILogger]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,575 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,576 INFO L146 ILogger]: Analyzing trace with hash 1690573862, now seen corresponding path program 15 times [2019-05-23 09:49:48,576 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,596 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,598 INFO L146 ILogger]: Trace formula consists of 185 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,600 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,764 INFO L146 ILogger]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,765 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,765 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:49:48,766 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:49:48,766 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:49:48,767 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:49:48,767 INFO L146 ILogger]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-05-23 09:49:48,950 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,950 INFO L146 ILogger]: Finished difference Result 19 states and 19 transitions. [2019-05-23 09:49:48,951 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:49:48,951 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 17 [2019-05-23 09:49:48,951 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,951 INFO L146 ILogger]: With dead ends: 19 [2019-05-23 09:49:48,951 INFO L146 ILogger]: Without dead ends: 19 [2019-05-23 09:49:48,952 INFO L146 ILogger]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:49:48,952 INFO L146 ILogger]: Start minimizeSevpa. Operand 19 states. [2019-05-23 09:49:48,954 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-05-23 09:49:48,954 INFO L146 ILogger]: Start removeUnreachable. Operand 19 states. [2019-05-23 09:49:48,954 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-05-23 09:49:48,955 INFO L146 ILogger]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-05-23 09:49:48,955 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,955 INFO L146 ILogger]: Abstraction has 19 states and 19 transitions. [2019-05-23 09:49:48,955 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:49:48,955 INFO L146 ILogger]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-23 09:49:48,956 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 19 [2019-05-23 09:49:48,956 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,956 INFO L146 ILogger]: trace histogram [16, 1, 1] [2019-05-23 09:49:48,956 INFO L146 ILogger]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,956 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,956 INFO L146 ILogger]: Analyzing trace with hash 868182210, now seen corresponding path program 16 times [2019-05-23 09:49:48,957 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,978 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,980 INFO L146 ILogger]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,982 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:49,645 INFO L146 ILogger]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:49,645 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:49,645 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:49:49,645 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:49:49,646 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:49:49,646 INFO L146 ILogger]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:49:49,646 INFO L146 ILogger]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-05-23 09:49:49,682 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:49,682 INFO L146 ILogger]: Finished difference Result 20 states and 20 transitions. [2019-05-23 09:49:49,682 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:49:49,682 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 18 [2019-05-23 09:49:49,683 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:49,683 INFO L146 ILogger]: With dead ends: 20 [2019-05-23 09:49:49,683 INFO L146 ILogger]: Without dead ends: 20 [2019-05-23 09:49:49,684 INFO L146 ILogger]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:49:49,685 INFO L146 ILogger]: Start minimizeSevpa. Operand 20 states. [2019-05-23 09:49:49,687 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-05-23 09:49:49,687 INFO L146 ILogger]: Start removeUnreachable. Operand 20 states. [2019-05-23 09:49:49,687 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-05-23 09:49:49,688 INFO L146 ILogger]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-05-23 09:49:49,688 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:49,688 INFO L146 ILogger]: Abstraction has 20 states and 20 transitions. [2019-05-23 09:49:49,688 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:49:49,688 INFO L146 ILogger]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-23 09:49:49,689 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 20 [2019-05-23 09:49:49,689 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:49,689 INFO L146 ILogger]: trace histogram [17, 1, 1] [2019-05-23 09:49:49,689 INFO L146 ILogger]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:49,689 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:49,689 INFO L146 ILogger]: Analyzing trace with hash 1143844774, now seen corresponding path program 17 times [2019-05-23 09:49:49,690 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:49,707 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:49,709 INFO L146 ILogger]: Trace formula consists of 209 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:49:49,710 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:49,974 INFO L146 ILogger]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:49,975 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:49,975 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:49:49,975 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:49:49,975 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:49:49,976 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:49,976 INFO L146 ILogger]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-05-23 09:49:50,025 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:50,025 INFO L146 ILogger]: Finished difference Result 21 states and 21 transitions. [2019-05-23 09:49:50,026 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:49:50,026 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 19 [2019-05-23 09:49:50,026 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:50,027 INFO L146 ILogger]: With dead ends: 21 [2019-05-23 09:49:50,027 INFO L146 ILogger]: Without dead ends: 21 [2019-05-23 09:49:50,028 INFO L146 ILogger]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:50,028 INFO L146 ILogger]: Start minimizeSevpa. Operand 21 states. [2019-05-23 09:49:50,030 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-05-23 09:49:50,030 INFO L146 ILogger]: Start removeUnreachable. Operand 21 states. [2019-05-23 09:49:50,030 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-23 09:49:50,030 INFO L146 ILogger]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-05-23 09:49:50,030 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:50,031 INFO L146 ILogger]: Abstraction has 21 states and 21 transitions. [2019-05-23 09:49:50,031 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:49:50,031 INFO L146 ILogger]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-23 09:49:50,031 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 21 [2019-05-23 09:49:50,031 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:50,031 INFO L146 ILogger]: trace histogram [18, 1, 1] [2019-05-23 09:49:50,032 INFO L146 ILogger]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:50,032 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:50,032 INFO L146 ILogger]: Analyzing trace with hash 1099449666, now seen corresponding path program 18 times [2019-05-23 09:49:50,032 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:50,049 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:50,050 INFO L146 ILogger]: Trace formula consists of 221 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:49:50,052 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,575 INFO L146 ILogger]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,575 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,576 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:49:50,576 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:49:50,577 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:49:50,577 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:49:50,577 INFO L146 ILogger]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-05-23 09:49:50,622 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:50,623 INFO L146 ILogger]: Finished difference Result 22 states and 22 transitions. [2019-05-23 09:49:50,623 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:49:50,623 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 20 [2019-05-23 09:49:50,624 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:50,624 INFO L146 ILogger]: With dead ends: 22 [2019-05-23 09:49:50,624 INFO L146 ILogger]: Without dead ends: 22 [2019-05-23 09:49:50,625 INFO L146 ILogger]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:49:50,625 INFO L146 ILogger]: Start minimizeSevpa. Operand 22 states. [2019-05-23 09:49:50,628 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-05-23 09:49:50,628 INFO L146 ILogger]: Start removeUnreachable. Operand 22 states. [2019-05-23 09:49:50,628 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-05-23 09:49:50,628 INFO L146 ILogger]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-05-23 09:49:50,629 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:50,629 INFO L146 ILogger]: Abstraction has 22 states and 22 transitions. [2019-05-23 09:49:50,629 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:49:50,629 INFO L146 ILogger]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-23 09:49:50,629 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 09:49:50,629 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:50,629 INFO L146 ILogger]: trace histogram [19, 1, 1] [2019-05-23 09:49:50,630 INFO L146 ILogger]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:50,630 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:50,630 INFO L146 ILogger]: Analyzing trace with hash -276798682, now seen corresponding path program 19 times [2019-05-23 09:49:50,631 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:50,646 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:50,647 INFO L146 ILogger]: Trace formula consists of 233 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:49:50,649 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,908 INFO L146 ILogger]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,909 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,909 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:49:50,909 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:49:50,910 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:49:50,910 INFO L146 ILogger]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:49:50,910 INFO L146 ILogger]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-05-23 09:49:50,943 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:50,944 INFO L146 ILogger]: Finished difference Result 23 states and 23 transitions. [2019-05-23 09:49:50,944 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:49:50,944 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 21 [2019-05-23 09:49:50,944 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:50,945 INFO L146 ILogger]: With dead ends: 23 [2019-05-23 09:49:50,945 INFO L146 ILogger]: Without dead ends: 23 [2019-05-23 09:49:50,945 INFO L146 ILogger]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:49:50,946 INFO L146 ILogger]: Start minimizeSevpa. Operand 23 states. [2019-05-23 09:49:50,947 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-05-23 09:49:50,947 INFO L146 ILogger]: Start removeUnreachable. Operand 23 states. [2019-05-23 09:49:50,948 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-23 09:49:50,948 INFO L146 ILogger]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-05-23 09:49:50,948 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:50,948 INFO L146 ILogger]: Abstraction has 23 states and 23 transitions. [2019-05-23 09:49:50,948 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:49:50,948 INFO L146 ILogger]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-23 09:49:50,949 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 23 [2019-05-23 09:49:50,949 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:50,949 INFO L146 ILogger]: trace histogram [20, 1, 1] [2019-05-23 09:49:50,949 INFO L146 ILogger]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:50,950 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:50,950 INFO L146 ILogger]: Analyzing trace with hash 9175490, now seen corresponding path program 20 times [2019-05-23 09:49:50,950 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:50,966 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:50,968 INFO L146 ILogger]: Trace formula consists of 245 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:49:50,969 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:51,254 INFO L146 ILogger]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:51,254 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:51,254 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:49:51,254 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:49:51,255 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:49:51,255 INFO L146 ILogger]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:49:51,255 INFO L146 ILogger]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-05-23 09:49:51,292 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:51,293 INFO L146 ILogger]: Finished difference Result 24 states and 24 transitions. [2019-05-23 09:49:51,293 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:49:51,293 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 22 [2019-05-23 09:49:51,294 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:51,294 INFO L146 ILogger]: With dead ends: 24 [2019-05-23 09:49:51,294 INFO L146 ILogger]: Without dead ends: 24 [2019-05-23 09:49:51,295 INFO L146 ILogger]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:49:51,295 INFO L146 ILogger]: Start minimizeSevpa. Operand 24 states. [2019-05-23 09:49:51,297 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-05-23 09:49:51,298 INFO L146 ILogger]: Start removeUnreachable. Operand 24 states. [2019-05-23 09:49:51,298 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-05-23 09:49:51,298 INFO L146 ILogger]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-05-23 09:49:51,299 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:51,299 INFO L146 ILogger]: Abstraction has 24 states and 24 transitions. [2019-05-23 09:49:51,299 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:49:51,299 INFO L146 ILogger]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-23 09:49:51,299 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 24 [2019-05-23 09:49:51,299 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:51,300 INFO L146 ILogger]: trace histogram [21, 1, 1] [2019-05-23 09:49:51,300 INFO L146 ILogger]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:51,300 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:51,300 INFO L146 ILogger]: Analyzing trace with hash 284440230, now seen corresponding path program 21 times [2019-05-23 09:49:51,301 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:51,316 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:51,318 INFO L146 ILogger]: Trace formula consists of 257 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:49:51,320 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:52,606 INFO L146 ILogger]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:52,607 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:52,607 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:49:52,607 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:49:52,607 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:49:52,608 INFO L146 ILogger]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:49:52,608 INFO L146 ILogger]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-05-23 09:49:52,677 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:52,677 INFO L146 ILogger]: Finished difference Result 25 states and 25 transitions. [2019-05-23 09:49:52,680 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:49:52,680 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 23 [2019-05-23 09:49:52,680 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:52,680 INFO L146 ILogger]: With dead ends: 25 [2019-05-23 09:49:52,680 INFO L146 ILogger]: Without dead ends: 25 [2019-05-23 09:49:52,681 INFO L146 ILogger]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:49:52,681 INFO L146 ILogger]: Start minimizeSevpa. Operand 25 states. [2019-05-23 09:49:52,682 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-05-23 09:49:52,683 INFO L146 ILogger]: Start removeUnreachable. Operand 25 states. [2019-05-23 09:49:52,683 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-05-23 09:49:52,683 INFO L146 ILogger]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-05-23 09:49:52,683 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:52,683 INFO L146 ILogger]: Abstraction has 25 states and 25 transitions. [2019-05-23 09:49:52,683 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:49:52,683 INFO L146 ILogger]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-23 09:49:52,684 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 25 [2019-05-23 09:49:52,684 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:52,684 INFO L146 ILogger]: trace histogram [22, 1, 1] [2019-05-23 09:49:52,685 INFO L146 ILogger]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:52,685 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:52,685 INFO L146 ILogger]: Analyzing trace with hash 227712578, now seen corresponding path program 22 times [2019-05-23 09:49:52,686 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:52,701 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:52,702 INFO L146 ILogger]: Trace formula consists of 269 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:49:52,704 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:53,066 INFO L146 ILogger]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:53,067 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:53,067 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:49:53,067 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:49:53,067 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:49:53,068 INFO L146 ILogger]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:49:53,068 INFO L146 ILogger]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-05-23 09:49:53,099 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:53,099 INFO L146 ILogger]: Finished difference Result 26 states and 26 transitions. [2019-05-23 09:49:53,100 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:49:53,100 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 24 [2019-05-23 09:49:53,100 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:53,100 INFO L146 ILogger]: With dead ends: 26 [2019-05-23 09:49:53,101 INFO L146 ILogger]: Without dead ends: 26 [2019-05-23 09:49:53,101 INFO L146 ILogger]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:49:53,102 INFO L146 ILogger]: Start minimizeSevpa. Operand 26 states. [2019-05-23 09:49:53,104 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-05-23 09:49:53,104 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 09:49:53,104 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-05-23 09:49:53,104 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-05-23 09:49:53,105 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:53,105 INFO L146 ILogger]: Abstraction has 26 states and 26 transitions. [2019-05-23 09:49:53,105 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:49:53,105 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-23 09:49:53,105 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 26 [2019-05-23 09:49:53,106 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:53,106 INFO L146 ILogger]: trace histogram [23, 1, 1] [2019-05-23 09:49:53,106 INFO L146 ILogger]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:53,106 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:53,106 INFO L146 ILogger]: Analyzing trace with hash -1530844634, now seen corresponding path program 23 times [2019-05-23 09:49:53,107 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:53,122 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:53,124 INFO L146 ILogger]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 09:49:53,125 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:53,598 INFO L146 ILogger]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:53,598 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:53,599 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:49:53,599 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:49:53,599 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:49:53,600 INFO L146 ILogger]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:53,600 INFO L146 ILogger]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-05-23 09:49:53,635 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:53,635 INFO L146 ILogger]: Finished difference Result 27 states and 27 transitions. [2019-05-23 09:49:53,636 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:49:53,636 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 25 [2019-05-23 09:49:53,636 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:53,637 INFO L146 ILogger]: With dead ends: 27 [2019-05-23 09:49:53,637 INFO L146 ILogger]: Without dead ends: 27 [2019-05-23 09:49:53,638 INFO L146 ILogger]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:53,638 INFO L146 ILogger]: Start minimizeSevpa. Operand 27 states. [2019-05-23 09:49:53,640 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-05-23 09:49:53,640 INFO L146 ILogger]: Start removeUnreachable. Operand 27 states. [2019-05-23 09:49:53,641 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-23 09:49:53,641 INFO L146 ILogger]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-05-23 09:49:53,641 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:53,641 INFO L146 ILogger]: Abstraction has 27 states and 27 transitions. [2019-05-23 09:49:53,641 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:49:53,642 INFO L146 ILogger]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-23 09:49:53,642 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 09:49:53,642 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:53,642 INFO L146 ILogger]: trace histogram [24, 1, 1] [2019-05-23 09:49:53,643 INFO L146 ILogger]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:53,643 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:53,643 INFO L146 ILogger]: Analyzing trace with hash -211543358, now seen corresponding path program 24 times [2019-05-23 09:49:53,644 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:53,660 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:53,663 INFO L146 ILogger]: Trace formula consists of 293 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:49:53,664 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:54,444 INFO L146 ILogger]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:54,444 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:54,444 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:49:54,445 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:49:54,445 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:49:54,446 INFO L146 ILogger]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:49:54,446 INFO L146 ILogger]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-05-23 09:49:54,525 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:54,525 INFO L146 ILogger]: Finished difference Result 28 states and 28 transitions. [2019-05-23 09:49:54,525 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:49:54,526 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 26 [2019-05-23 09:49:54,526 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:54,526 INFO L146 ILogger]: With dead ends: 28 [2019-05-23 09:49:54,526 INFO L146 ILogger]: Without dead ends: 28 [2019-05-23 09:49:54,526 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:49:54,527 INFO L146 ILogger]: Start minimizeSevpa. Operand 28 states. [2019-05-23 09:49:54,528 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-05-23 09:49:54,528 INFO L146 ILogger]: Start removeUnreachable. Operand 28 states. [2019-05-23 09:49:54,529 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-23 09:49:54,529 INFO L146 ILogger]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-05-23 09:49:54,529 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:54,529 INFO L146 ILogger]: Abstraction has 28 states and 28 transitions. [2019-05-23 09:49:54,529 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:49:54,529 INFO L146 ILogger]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-23 09:49:54,530 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 28 [2019-05-23 09:49:54,530 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:54,530 INFO L146 ILogger]: trace histogram [25, 1, 1] [2019-05-23 09:49:54,530 INFO L146 ILogger]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:54,531 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:54,531 INFO L146 ILogger]: Analyzing trace with hash 2032090534, now seen corresponding path program 25 times [2019-05-23 09:49:54,531 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:54,547 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:54,549 INFO L146 ILogger]: Trace formula consists of 305 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:49:54,550 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:55,120 INFO L146 ILogger]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:55,120 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:55,120 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:49:55,121 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:49:55,121 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:49:55,122 INFO L146 ILogger]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:49:55,122 INFO L146 ILogger]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-05-23 09:49:55,157 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,158 INFO L146 ILogger]: Finished difference Result 29 states and 29 transitions. [2019-05-23 09:49:55,159 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:49:55,159 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 27 [2019-05-23 09:49:55,159 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,160 INFO L146 ILogger]: With dead ends: 29 [2019-05-23 09:49:55,160 INFO L146 ILogger]: Without dead ends: 29 [2019-05-23 09:49:55,161 INFO L146 ILogger]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:49:55,161 INFO L146 ILogger]: Start minimizeSevpa. Operand 29 states. [2019-05-23 09:49:55,163 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-05-23 09:49:55,163 INFO L146 ILogger]: Start removeUnreachable. Operand 29 states. [2019-05-23 09:49:55,163 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-05-23 09:49:55,163 INFO L146 ILogger]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-05-23 09:49:55,163 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,163 INFO L146 ILogger]: Abstraction has 29 states and 29 transitions. [2019-05-23 09:49:55,164 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:49:55,166 INFO L146 ILogger]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-23 09:49:55,166 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 29 [2019-05-23 09:49:55,167 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,167 INFO L146 ILogger]: trace histogram [26, 1, 1] [2019-05-23 09:49:55,167 INFO L146 ILogger]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,167 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,167 INFO L146 ILogger]: Analyzing trace with hash -1429702846, now seen corresponding path program 26 times [2019-05-23 09:49:55,168 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,187 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,189 INFO L146 ILogger]: Trace formula consists of 317 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:49:55,196 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:55,944 INFO L146 ILogger]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:55,944 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:55,945 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:49:55,945 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:49:55,945 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:49:55,946 INFO L146 ILogger]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:49:55,946 INFO L146 ILogger]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-05-23 09:49:55,975 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,975 INFO L146 ILogger]: Finished difference Result 30 states and 30 transitions. [2019-05-23 09:49:55,975 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:49:55,975 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 28 [2019-05-23 09:49:55,976 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,976 INFO L146 ILogger]: With dead ends: 30 [2019-05-23 09:49:55,976 INFO L146 ILogger]: Without dead ends: 30 [2019-05-23 09:49:55,977 INFO L146 ILogger]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:49:55,977 INFO L146 ILogger]: Start minimizeSevpa. Operand 30 states. [2019-05-23 09:49:55,979 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-05-23 09:49:55,979 INFO L146 ILogger]: Start removeUnreachable. Operand 30 states. [2019-05-23 09:49:55,980 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-05-23 09:49:55,980 INFO L146 ILogger]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-05-23 09:49:55,980 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,980 INFO L146 ILogger]: Abstraction has 30 states and 30 transitions. [2019-05-23 09:49:55,980 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:49:55,980 INFO L146 ILogger]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-23 09:49:55,981 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 30 [2019-05-23 09:49:55,981 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,981 INFO L146 ILogger]: trace histogram [27, 1, 1] [2019-05-23 09:49:55,981 INFO L146 ILogger]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,982 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,982 INFO L146 ILogger]: Analyzing trace with hash -1371115226, now seen corresponding path program 27 times [2019-05-23 09:49:55,982 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,998 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,999 INFO L146 ILogger]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 09:49:56,001 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:56,412 INFO L146 ILogger]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:56,412 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:56,412 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:49:56,412 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:49:56,413 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:49:56,413 INFO L146 ILogger]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:49:56,413 INFO L146 ILogger]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-05-23 09:49:56,621 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:56,621 INFO L146 ILogger]: Finished difference Result 31 states and 31 transitions. [2019-05-23 09:49:56,621 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:49:56,621 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 29 [2019-05-23 09:49:56,622 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:56,622 INFO L146 ILogger]: With dead ends: 31 [2019-05-23 09:49:56,622 INFO L146 ILogger]: Without dead ends: 31 [2019-05-23 09:49:56,623 INFO L146 ILogger]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:49:56,623 INFO L146 ILogger]: Start minimizeSevpa. Operand 31 states. [2019-05-23 09:49:56,625 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-05-23 09:49:56,625 INFO L146 ILogger]: Start removeUnreachable. Operand 31 states. [2019-05-23 09:49:56,626 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-05-23 09:49:56,626 INFO L146 ILogger]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-05-23 09:49:56,626 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:56,626 INFO L146 ILogger]: Abstraction has 31 states and 31 transitions. [2019-05-23 09:49:56,626 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:49:56,627 INFO L146 ILogger]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-23 09:49:56,627 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 31 [2019-05-23 09:49:56,627 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:56,627 INFO L146 ILogger]: trace histogram [28, 1, 1] [2019-05-23 09:49:56,627 INFO L146 ILogger]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:56,628 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:56,628 INFO L146 ILogger]: Analyzing trace with hash 445100994, now seen corresponding path program 28 times [2019-05-23 09:49:56,628 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:56,643 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:56,645 INFO L146 ILogger]: Trace formula consists of 341 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:49:56,646 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:57,068 INFO L146 ILogger]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:57,068 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:57,069 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:49:57,069 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:49:57,069 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:49:57,070 INFO L146 ILogger]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:49:57,070 INFO L146 ILogger]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-05-23 09:49:57,188 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:57,188 INFO L146 ILogger]: Finished difference Result 32 states and 32 transitions. [2019-05-23 09:49:57,189 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:49:57,189 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 30 [2019-05-23 09:49:57,189 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:57,190 INFO L146 ILogger]: With dead ends: 32 [2019-05-23 09:49:57,190 INFO L146 ILogger]: Without dead ends: 32 [2019-05-23 09:49:57,191 INFO L146 ILogger]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:49:57,191 INFO L146 ILogger]: Start minimizeSevpa. Operand 32 states. [2019-05-23 09:49:57,194 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-05-23 09:49:57,194 INFO L146 ILogger]: Start removeUnreachable. Operand 32 states. [2019-05-23 09:49:57,203 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-05-23 09:49:57,204 INFO L146 ILogger]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-05-23 09:49:57,204 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:57,204 INFO L146 ILogger]: Abstraction has 32 states and 32 transitions. [2019-05-23 09:49:57,204 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:49:57,204 INFO L146 ILogger]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-23 09:49:57,204 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 32 [2019-05-23 09:49:57,205 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:57,205 INFO L146 ILogger]: trace histogram [29, 1, 1] [2019-05-23 09:49:57,205 INFO L146 ILogger]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:57,205 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:57,205 INFO L146 ILogger]: Analyzing trace with hash 913228966, now seen corresponding path program 29 times [2019-05-23 09:49:57,206 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:57,225 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:57,227 INFO L146 ILogger]: Trace formula consists of 353 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:49:57,228 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:57,601 INFO L146 ILogger]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:57,601 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:57,601 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:49:57,602 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:49:57,602 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:49:57,602 INFO L146 ILogger]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:49:57,602 INFO L146 ILogger]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-05-23 09:49:57,735 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:57,735 INFO L146 ILogger]: Finished difference Result 33 states and 33 transitions. [2019-05-23 09:49:57,736 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:49:57,736 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 31 [2019-05-23 09:49:57,736 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:57,736 INFO L146 ILogger]: With dead ends: 33 [2019-05-23 09:49:57,736 INFO L146 ILogger]: Without dead ends: 33 [2019-05-23 09:49:57,737 INFO L146 ILogger]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:49:57,737 INFO L146 ILogger]: Start minimizeSevpa. Operand 33 states. [2019-05-23 09:49:57,738 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-05-23 09:49:57,738 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 09:49:57,739 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-23 09:49:57,739 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-05-23 09:49:57,739 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:57,739 INFO L146 ILogger]: Abstraction has 33 states and 33 transitions. [2019-05-23 09:49:57,739 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:49:57,739 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-23 09:49:57,740 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 33 [2019-05-23 09:49:57,740 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:57,740 INFO L146 ILogger]: trace histogram [30, 1, 1] [2019-05-23 09:49:57,741 INFO L146 ILogger]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:57,741 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:57,741 INFO L146 ILogger]: Analyzing trace with hash -1754673086, now seen corresponding path program 30 times [2019-05-23 09:49:57,742 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:57,760 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:57,762 INFO L146 ILogger]: Trace formula consists of 365 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:49:57,763 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:58,159 INFO L146 ILogger]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:58,160 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:58,160 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:49:58,160 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:49:58,160 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:49:58,161 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:49:58,161 INFO L146 ILogger]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-05-23 09:49:58,202 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:58,203 INFO L146 ILogger]: Finished difference Result 34 states and 34 transitions. [2019-05-23 09:49:58,203 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:49:58,203 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 32 [2019-05-23 09:49:58,203 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:58,204 INFO L146 ILogger]: With dead ends: 34 [2019-05-23 09:49:58,204 INFO L146 ILogger]: Without dead ends: 34 [2019-05-23 09:49:58,205 INFO L146 ILogger]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:49:58,205 INFO L146 ILogger]: Start minimizeSevpa. Operand 34 states. [2019-05-23 09:49:58,207 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-05-23 09:49:58,207 INFO L146 ILogger]: Start removeUnreachable. Operand 34 states. [2019-05-23 09:49:58,207 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-05-23 09:49:58,207 INFO L146 ILogger]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-05-23 09:49:58,208 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:58,208 INFO L146 ILogger]: Abstraction has 34 states and 34 transitions. [2019-05-23 09:49:58,208 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:49:58,208 INFO L146 ILogger]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-23 09:49:58,208 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 34 [2019-05-23 09:49:58,209 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:58,209 INFO L146 ILogger]: trace histogram [31, 1, 1] [2019-05-23 09:49:58,209 INFO L146 ILogger]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:58,209 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:58,209 INFO L146 ILogger]: Analyzing trace with hash 1439709222, now seen corresponding path program 31 times [2019-05-23 09:49:58,210 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:58,227 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:58,229 INFO L146 ILogger]: Trace formula consists of 377 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:49:58,230 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:58,744 INFO L146 ILogger]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:58,745 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:58,745 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:49:58,745 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:49:58,745 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:49:58,746 INFO L146 ILogger]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:49:58,746 INFO L146 ILogger]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-05-23 09:49:58,795 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:58,795 INFO L146 ILogger]: Finished difference Result 35 states and 35 transitions. [2019-05-23 09:49:58,795 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:49:58,796 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 33 [2019-05-23 09:49:58,796 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:58,796 INFO L146 ILogger]: With dead ends: 35 [2019-05-23 09:49:58,797 INFO L146 ILogger]: Without dead ends: 35 [2019-05-23 09:49:58,798 INFO L146 ILogger]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:49:58,798 INFO L146 ILogger]: Start minimizeSevpa. Operand 35 states. [2019-05-23 09:49:58,800 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-05-23 09:49:58,800 INFO L146 ILogger]: Start removeUnreachable. Operand 35 states. [2019-05-23 09:49:58,800 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-05-23 09:49:58,800 INFO L146 ILogger]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-05-23 09:49:58,801 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:58,801 INFO L146 ILogger]: Abstraction has 35 states and 35 transitions. [2019-05-23 09:49:58,801 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:49:58,801 INFO L146 ILogger]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-23 09:49:58,801 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 35 [2019-05-23 09:49:58,801 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:58,801 INFO L146 ILogger]: trace histogram [32, 1, 1] [2019-05-23 09:49:58,802 INFO L146 ILogger]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:58,802 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:58,802 INFO L146 ILogger]: Analyzing trace with hash 1681312962, now seen corresponding path program 32 times [2019-05-23 09:49:58,803 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:58,820 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:58,822 INFO L146 ILogger]: Trace formula consists of 389 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:49:58,823 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:59,758 INFO L146 ILogger]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:59,759 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:59,759 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:49:59,759 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:49:59,759 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:49:59,760 INFO L146 ILogger]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:49:59,760 INFO L146 ILogger]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-05-23 09:49:59,805 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:59,805 INFO L146 ILogger]: Finished difference Result 36 states and 36 transitions. [2019-05-23 09:49:59,806 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:49:59,806 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 34 [2019-05-23 09:49:59,806 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:59,806 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 09:49:59,807 INFO L146 ILogger]: Without dead ends: 36 [2019-05-23 09:49:59,808 INFO L146 ILogger]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:49:59,808 INFO L146 ILogger]: Start minimizeSevpa. Operand 36 states. [2019-05-23 09:49:59,813 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-05-23 09:49:59,813 INFO L146 ILogger]: Start removeUnreachable. Operand 36 states. [2019-05-23 09:49:59,813 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-05-23 09:49:59,814 INFO L146 ILogger]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-05-23 09:49:59,814 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:59,814 INFO L146 ILogger]: Abstraction has 36 states and 36 transitions. [2019-05-23 09:49:59,814 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:49:59,814 INFO L146 ILogger]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-23 09:49:59,815 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 36 [2019-05-23 09:49:59,815 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:59,815 INFO L146 ILogger]: trace histogram [33, 1, 1] [2019-05-23 09:49:59,815 INFO L146 ILogger]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:59,815 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:59,816 INFO L146 ILogger]: Analyzing trace with hash 581094310, now seen corresponding path program 33 times [2019-05-23 09:49:59,816 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:59,839 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:59,842 INFO L146 ILogger]: Trace formula consists of 401 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:49:59,843 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:00,542 INFO L146 ILogger]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:00,543 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:00,543 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:50:00,543 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:50:00,543 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:50:00,544 INFO L146 ILogger]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:50:00,544 INFO L146 ILogger]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-05-23 09:50:00,580 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:00,581 INFO L146 ILogger]: Finished difference Result 37 states and 37 transitions. [2019-05-23 09:50:00,581 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:50:00,581 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 35 [2019-05-23 09:50:00,581 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:00,582 INFO L146 ILogger]: With dead ends: 37 [2019-05-23 09:50:00,582 INFO L146 ILogger]: Without dead ends: 37 [2019-05-23 09:50:00,583 INFO L146 ILogger]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:50:00,583 INFO L146 ILogger]: Start minimizeSevpa. Operand 37 states. [2019-05-23 09:50:00,584 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-05-23 09:50:00,584 INFO L146 ILogger]: Start removeUnreachable. Operand 37 states. [2019-05-23 09:50:00,584 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-23 09:50:00,585 INFO L146 ILogger]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-05-23 09:50:00,585 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:00,585 INFO L146 ILogger]: Abstraction has 37 states and 37 transitions. [2019-05-23 09:50:00,585 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:50:00,585 INFO L146 ILogger]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-23 09:50:00,585 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 37 [2019-05-23 09:50:00,586 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:00,586 INFO L146 ILogger]: trace histogram [34, 1, 1] [2019-05-23 09:50:00,586 INFO L146 ILogger]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:00,586 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:00,586 INFO L146 ILogger]: Analyzing trace with hash 834054466, now seen corresponding path program 34 times [2019-05-23 09:50:00,587 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:00,604 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:00,606 INFO L146 ILogger]: Trace formula consists of 413 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:50:00,607 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:01,085 INFO L146 ILogger]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:01,085 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:01,085 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:50:01,085 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:50:01,086 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:50:01,086 INFO L146 ILogger]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:50:01,086 INFO L146 ILogger]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-05-23 09:50:01,126 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:01,126 INFO L146 ILogger]: Finished difference Result 38 states and 38 transitions. [2019-05-23 09:50:01,126 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:50:01,126 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 36 [2019-05-23 09:50:01,127 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:01,127 INFO L146 ILogger]: With dead ends: 38 [2019-05-23 09:50:01,127 INFO L146 ILogger]: Without dead ends: 38 [2019-05-23 09:50:01,128 INFO L146 ILogger]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:50:01,128 INFO L146 ILogger]: Start minimizeSevpa. Operand 38 states. [2019-05-23 09:50:01,130 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-05-23 09:50:01,130 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 09:50:01,130 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-05-23 09:50:01,130 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-05-23 09:50:01,131 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:01,131 INFO L146 ILogger]: Abstraction has 38 states and 38 transitions. [2019-05-23 09:50:01,131 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:50:01,131 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-23 09:50:01,131 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:50:01,131 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:01,131 INFO L146 ILogger]: trace histogram [35, 1, 1] [2019-05-23 09:50:01,131 INFO L146 ILogger]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:01,132 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:01,132 INFO L146 ILogger]: Analyzing trace with hash 85884710, now seen corresponding path program 35 times [2019-05-23 09:50:01,132 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:01,151 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:01,153 INFO L146 ILogger]: Trace formula consists of 425 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 09:50:01,154 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:02,144 INFO L146 ILogger]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:02,144 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:02,144 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:50:02,145 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:50:02,145 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:50:02,146 INFO L146 ILogger]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:50:02,146 INFO L146 ILogger]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-05-23 09:50:02,210 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:02,211 INFO L146 ILogger]: Finished difference Result 39 states and 39 transitions. [2019-05-23 09:50:02,211 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:50:02,211 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 37 [2019-05-23 09:50:02,211 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:02,212 INFO L146 ILogger]: With dead ends: 39 [2019-05-23 09:50:02,212 INFO L146 ILogger]: Without dead ends: 39 [2019-05-23 09:50:02,213 INFO L146 ILogger]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:50:02,214 INFO L146 ILogger]: Start minimizeSevpa. Operand 39 states. [2019-05-23 09:50:02,215 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-05-23 09:50:02,215 INFO L146 ILogger]: Start removeUnreachable. Operand 39 states. [2019-05-23 09:50:02,216 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-23 09:50:02,216 INFO L146 ILogger]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-05-23 09:50:02,216 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:02,216 INFO L146 ILogger]: Abstraction has 39 states and 39 transitions. [2019-05-23 09:50:02,216 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:50:02,216 INFO L146 ILogger]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-23 09:50:02,217 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 39 [2019-05-23 09:50:02,217 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:02,217 INFO L146 ILogger]: trace histogram [36, 1, 1] [2019-05-23 09:50:02,217 INFO L146 ILogger]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:02,217 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:02,217 INFO L146 ILogger]: Analyzing trace with hash -1632541246, now seen corresponding path program 36 times [2019-05-23 09:50:02,218 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:02,236 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:02,239 INFO L146 ILogger]: Trace formula consists of 437 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:50:02,240 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:04,280 INFO L146 ILogger]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:04,281 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:04,281 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:50:04,281 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:50:04,282 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:50:04,283 INFO L146 ILogger]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:50:04,283 INFO L146 ILogger]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-05-23 09:50:04,330 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:04,330 INFO L146 ILogger]: Finished difference Result 40 states and 40 transitions. [2019-05-23 09:50:04,331 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:50:04,331 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 38 [2019-05-23 09:50:04,331 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:04,332 INFO L146 ILogger]: With dead ends: 40 [2019-05-23 09:50:04,332 INFO L146 ILogger]: Without dead ends: 40 [2019-05-23 09:50:04,333 INFO L146 ILogger]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:50:04,333 INFO L146 ILogger]: Start minimizeSevpa. Operand 40 states. [2019-05-23 09:50:04,335 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-05-23 09:50:04,335 INFO L146 ILogger]: Start removeUnreachable. Operand 40 states. [2019-05-23 09:50:04,335 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-05-23 09:50:04,336 INFO L146 ILogger]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-05-23 09:50:04,336 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:04,336 INFO L146 ILogger]: Abstraction has 40 states and 40 transitions. [2019-05-23 09:50:04,336 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:50:04,336 INFO L146 ILogger]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-23 09:50:04,337 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 40 [2019-05-23 09:50:04,337 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:04,337 INFO L146 ILogger]: trace histogram [37, 1, 1] [2019-05-23 09:50:04,337 INFO L146 ILogger]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:04,342 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:04,342 INFO L146 ILogger]: Analyzing trace with hash 930828966, now seen corresponding path program 37 times [2019-05-23 09:50:04,343 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:04,372 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:04,375 INFO L146 ILogger]: Trace formula consists of 449 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:50:04,376 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:05,075 INFO L146 ILogger]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:05,075 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:05,075 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:50:05,076 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:50:05,076 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:50:05,077 INFO L146 ILogger]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:50:05,077 INFO L146 ILogger]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-05-23 09:50:05,135 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:05,135 INFO L146 ILogger]: Finished difference Result 41 states and 41 transitions. [2019-05-23 09:50:05,136 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:50:05,136 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 39 [2019-05-23 09:50:05,136 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:05,137 INFO L146 ILogger]: With dead ends: 41 [2019-05-23 09:50:05,137 INFO L146 ILogger]: Without dead ends: 41 [2019-05-23 09:50:05,138 INFO L146 ILogger]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:50:05,138 INFO L146 ILogger]: Start minimizeSevpa. Operand 41 states. [2019-05-23 09:50:05,139 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-05-23 09:50:05,139 INFO L146 ILogger]: Start removeUnreachable. Operand 41 states. [2019-05-23 09:50:05,139 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-05-23 09:50:05,139 INFO L146 ILogger]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-05-23 09:50:05,139 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:05,139 INFO L146 ILogger]: Abstraction has 41 states and 41 transitions. [2019-05-23 09:50:05,140 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:50:05,140 INFO L146 ILogger]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-23 09:50:05,140 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 41 [2019-05-23 09:50:05,140 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:05,140 INFO L146 ILogger]: trace histogram [38, 1, 1] [2019-05-23 09:50:05,140 INFO L146 ILogger]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:05,140 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:05,140 INFO L146 ILogger]: Analyzing trace with hash -1209073086, now seen corresponding path program 38 times [2019-05-23 09:50:05,141 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:05,159 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:05,161 INFO L146 ILogger]: Trace formula consists of 461 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:50:05,162 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:05,918 INFO L146 ILogger]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:05,918 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:05,918 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:50:05,918 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:50:05,919 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:50:05,919 INFO L146 ILogger]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:50:05,919 INFO L146 ILogger]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-05-23 09:50:05,968 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:05,968 INFO L146 ILogger]: Finished difference Result 42 states and 42 transitions. [2019-05-23 09:50:05,969 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:50:05,969 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 40 [2019-05-23 09:50:05,969 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:05,969 INFO L146 ILogger]: With dead ends: 42 [2019-05-23 09:50:05,970 INFO L146 ILogger]: Without dead ends: 42 [2019-05-23 09:50:05,970 INFO L146 ILogger]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:50:05,971 INFO L146 ILogger]: Start minimizeSevpa. Operand 42 states. [2019-05-23 09:50:05,972 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-05-23 09:50:05,972 INFO L146 ILogger]: Start removeUnreachable. Operand 42 states. [2019-05-23 09:50:05,972 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-05-23 09:50:05,972 INFO L146 ILogger]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-05-23 09:50:05,972 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:05,973 INFO L146 ILogger]: Abstraction has 42 states and 42 transitions. [2019-05-23 09:50:05,973 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:50:05,973 INFO L146 ILogger]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-23 09:50:05,973 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 42 [2019-05-23 09:50:05,973 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:05,973 INFO L146 ILogger]: trace histogram [39, 1, 1] [2019-05-23 09:50:05,973 INFO L146 ILogger]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:05,973 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:05,974 INFO L146 ILogger]: Analyzing trace with hash 1173440038, now seen corresponding path program 39 times [2019-05-23 09:50:05,974 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:05,994 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:05,996 INFO L146 ILogger]: Trace formula consists of 473 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 09:50:05,998 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:06,814 INFO L146 ILogger]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:06,815 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:06,815 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:50:06,815 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:50:06,815 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:50:06,816 INFO L146 ILogger]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:50:06,816 INFO L146 ILogger]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-05-23 09:50:06,866 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:06,866 INFO L146 ILogger]: Finished difference Result 43 states and 43 transitions. [2019-05-23 09:50:06,866 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:50:06,866 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 41 [2019-05-23 09:50:06,867 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:06,867 INFO L146 ILogger]: With dead ends: 43 [2019-05-23 09:50:06,867 INFO L146 ILogger]: Without dead ends: 43 [2019-05-23 09:50:06,868 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:50:06,868 INFO L146 ILogger]: Start minimizeSevpa. Operand 43 states. [2019-05-23 09:50:06,869 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-05-23 09:50:06,870 INFO L146 ILogger]: Start removeUnreachable. Operand 43 states. [2019-05-23 09:50:06,870 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-23 09:50:06,870 INFO L146 ILogger]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-05-23 09:50:06,871 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:06,871 INFO L146 ILogger]: Abstraction has 43 states and 43 transitions. [2019-05-23 09:50:06,871 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:50:06,871 INFO L146 ILogger]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-23 09:50:06,871 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 43 [2019-05-23 09:50:06,871 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:06,871 INFO L146 ILogger]: trace histogram [40, 1, 1] [2019-05-23 09:50:06,872 INFO L146 ILogger]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:06,872 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:06,872 INFO L146 ILogger]: Analyzing trace with hash 2016902850, now seen corresponding path program 40 times [2019-05-23 09:50:06,872 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:06,891 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:06,894 INFO L146 ILogger]: Trace formula consists of 485 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:50:06,895 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:07,535 INFO L146 ILogger]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:07,535 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:07,536 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:50:07,536 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:50:07,537 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:50:07,537 INFO L146 ILogger]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:50:07,537 INFO L146 ILogger]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-05-23 09:50:07,605 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:07,606 INFO L146 ILogger]: Finished difference Result 44 states and 44 transitions. [2019-05-23 09:50:07,606 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:50:07,606 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 42 [2019-05-23 09:50:07,606 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:07,607 INFO L146 ILogger]: With dead ends: 44 [2019-05-23 09:50:07,607 INFO L146 ILogger]: Without dead ends: 44 [2019-05-23 09:50:07,608 INFO L146 ILogger]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:50:07,608 INFO L146 ILogger]: Start minimizeSevpa. Operand 44 states. [2019-05-23 09:50:07,609 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-05-23 09:50:07,609 INFO L146 ILogger]: Start removeUnreachable. Operand 44 states. [2019-05-23 09:50:07,610 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-05-23 09:50:07,610 INFO L146 ILogger]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-05-23 09:50:07,610 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:07,610 INFO L146 ILogger]: Abstraction has 44 states and 44 transitions. [2019-05-23 09:50:07,610 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:50:07,610 INFO L146 ILogger]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-23 09:50:07,611 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 44 [2019-05-23 09:50:07,611 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:07,611 INFO L146 ILogger]: trace histogram [41, 1, 1] [2019-05-23 09:50:07,611 INFO L146 ILogger]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:07,611 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:07,611 INFO L146 ILogger]: Analyzing trace with hash -1900521050, now seen corresponding path program 41 times [2019-05-23 09:50:07,612 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:07,630 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:07,632 INFO L146 ILogger]: Trace formula consists of 497 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 09:50:07,634 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:08,504 INFO L146 ILogger]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:08,504 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:08,504 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:50:08,505 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:50:08,505 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:50:08,506 INFO L146 ILogger]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:08,506 INFO L146 ILogger]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-05-23 09:50:08,565 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:08,565 INFO L146 ILogger]: Finished difference Result 45 states and 45 transitions. [2019-05-23 09:50:08,565 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:50:08,566 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 43 [2019-05-23 09:50:08,566 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:08,566 INFO L146 ILogger]: With dead ends: 45 [2019-05-23 09:50:08,566 INFO L146 ILogger]: Without dead ends: 45 [2019-05-23 09:50:08,567 INFO L146 ILogger]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:08,568 INFO L146 ILogger]: Start minimizeSevpa. Operand 45 states. [2019-05-23 09:50:08,569 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-05-23 09:50:08,569 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 09:50:08,569 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-23 09:50:08,569 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-05-23 09:50:08,569 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:08,570 INFO L146 ILogger]: Abstraction has 45 states and 45 transitions. [2019-05-23 09:50:08,570 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:50:08,570 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-23 09:50:08,570 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 45 [2019-05-23 09:50:08,570 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:08,570 INFO L146 ILogger]: trace histogram [42, 1, 1] [2019-05-23 09:50:08,570 INFO L146 ILogger]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:08,570 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:08,570 INFO L146 ILogger]: Analyzing trace with hash 1213389634, now seen corresponding path program 42 times [2019-05-23 09:50:08,571 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:08,590 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:08,592 INFO L146 ILogger]: Trace formula consists of 509 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:50:08,594 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:09,293 INFO L146 ILogger]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:09,294 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:09,294 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:50:09,294 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:50:09,294 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:50:09,295 INFO L146 ILogger]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:50:09,295 INFO L146 ILogger]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-05-23 09:50:09,353 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:09,353 INFO L146 ILogger]: Finished difference Result 46 states and 46 transitions. [2019-05-23 09:50:09,353 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:50:09,354 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 44 [2019-05-23 09:50:09,354 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:09,354 INFO L146 ILogger]: With dead ends: 46 [2019-05-23 09:50:09,354 INFO L146 ILogger]: Without dead ends: 46 [2019-05-23 09:50:09,356 INFO L146 ILogger]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:50:09,356 INFO L146 ILogger]: Start minimizeSevpa. Operand 46 states. [2019-05-23 09:50:09,357 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-05-23 09:50:09,357 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 09:50:09,358 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-05-23 09:50:09,358 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-05-23 09:50:09,358 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:09,358 INFO L146 ILogger]: Abstraction has 46 states and 46 transitions. [2019-05-23 09:50:09,358 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:50:09,358 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-23 09:50:09,359 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 46 [2019-05-23 09:50:09,359 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:09,359 INFO L146 ILogger]: trace histogram [43, 1, 1] [2019-05-23 09:50:09,359 INFO L146 ILogger]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:09,359 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:09,359 INFO L146 ILogger]: Analyzing trace with hash -1039626970, now seen corresponding path program 43 times [2019-05-23 09:50:09,360 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:09,379 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:09,381 INFO L146 ILogger]: Trace formula consists of 521 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:50:09,383 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:10,124 INFO L146 ILogger]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:10,124 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:10,124 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:50:10,124 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:50:10,125 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:50:10,125 INFO L146 ILogger]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:50:10,125 INFO L146 ILogger]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-05-23 09:50:10,184 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:10,185 INFO L146 ILogger]: Finished difference Result 47 states and 47 transitions. [2019-05-23 09:50:10,185 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:50:10,185 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 45 [2019-05-23 09:50:10,185 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:10,186 INFO L146 ILogger]: With dead ends: 47 [2019-05-23 09:50:10,186 INFO L146 ILogger]: Without dead ends: 47 [2019-05-23 09:50:10,187 INFO L146 ILogger]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:50:10,187 INFO L146 ILogger]: Start minimizeSevpa. Operand 47 states. [2019-05-23 09:50:10,188 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-05-23 09:50:10,188 INFO L146 ILogger]: Start removeUnreachable. Operand 47 states. [2019-05-23 09:50:10,189 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-05-23 09:50:10,189 INFO L146 ILogger]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-05-23 09:50:10,189 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:10,189 INFO L146 ILogger]: Abstraction has 47 states and 47 transitions. [2019-05-23 09:50:10,189 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:50:10,190 INFO L146 ILogger]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-23 09:50:10,190 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 47 [2019-05-23 09:50:10,190 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:10,190 INFO L146 ILogger]: trace histogram [44, 1, 1] [2019-05-23 09:50:10,190 INFO L146 ILogger]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:10,190 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:10,191 INFO L146 ILogger]: Analyzing trace with hash 2131302338, now seen corresponding path program 44 times [2019-05-23 09:50:10,191 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:10,216 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:10,218 INFO L146 ILogger]: Trace formula consists of 533 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:50:10,219 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:10,913 INFO L146 ILogger]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:10,914 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:10,914 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:50:10,914 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:50:10,914 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:50:10,915 INFO L146 ILogger]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:50:10,915 INFO L146 ILogger]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-05-23 09:50:10,982 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:10,982 INFO L146 ILogger]: Finished difference Result 48 states and 48 transitions. [2019-05-23 09:50:10,983 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:50:10,983 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 46 [2019-05-23 09:50:10,983 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:10,983 INFO L146 ILogger]: With dead ends: 48 [2019-05-23 09:50:10,984 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 09:50:10,984 INFO L146 ILogger]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:50:10,984 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 09:50:10,986 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-05-23 09:50:10,986 INFO L146 ILogger]: Start removeUnreachable. Operand 48 states. [2019-05-23 09:50:10,986 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-05-23 09:50:10,986 INFO L146 ILogger]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-05-23 09:50:10,986 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:10,986 INFO L146 ILogger]: Abstraction has 48 states and 48 transitions. [2019-05-23 09:50:10,987 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:50:10,987 INFO L146 ILogger]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-23 09:50:10,987 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 48 [2019-05-23 09:50:10,987 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:10,987 INFO L146 ILogger]: trace histogram [45, 1, 1] [2019-05-23 09:50:10,987 INFO L146 ILogger]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:10,988 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:10,988 INFO L146 ILogger]: Analyzing trace with hash 1645863078, now seen corresponding path program 45 times [2019-05-23 09:50:10,988 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:11,007 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:11,010 INFO L146 ILogger]: Trace formula consists of 545 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 09:50:11,012 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:11,857 INFO L146 ILogger]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:11,857 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:11,858 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:50:11,858 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:50:11,858 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:50:11,858 INFO L146 ILogger]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:50:11,858 INFO L146 ILogger]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-05-23 09:50:12,239 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:12,239 INFO L146 ILogger]: Finished difference Result 49 states and 49 transitions. [2019-05-23 09:50:12,240 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:50:12,240 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 47 [2019-05-23 09:50:12,240 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:12,240 INFO L146 ILogger]: With dead ends: 49 [2019-05-23 09:50:12,241 INFO L146 ILogger]: Without dead ends: 49 [2019-05-23 09:50:12,241 INFO L146 ILogger]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:50:12,241 INFO L146 ILogger]: Start minimizeSevpa. Operand 49 states. [2019-05-23 09:50:12,242 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-05-23 09:50:12,242 INFO L146 ILogger]: Start removeUnreachable. Operand 49 states. [2019-05-23 09:50:12,245 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-05-23 09:50:12,245 INFO L146 ILogger]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-05-23 09:50:12,245 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:12,245 INFO L146 ILogger]: Abstraction has 49 states and 49 transitions. [2019-05-23 09:50:12,245 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:50:12,245 INFO L146 ILogger]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-23 09:50:12,246 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 49 [2019-05-23 09:50:12,246 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:12,246 INFO L146 ILogger]: trace histogram [46, 1, 1] [2019-05-23 09:50:12,246 INFO L146 ILogger]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:12,246 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:12,247 INFO L146 ILogger]: Analyzing trace with hash -517852094, now seen corresponding path program 46 times [2019-05-23 09:50:12,247 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:12,267 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:12,270 INFO L146 ILogger]: Trace formula consists of 557 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:50:12,271 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:13,194 INFO L146 ILogger]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:13,194 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:13,194 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:50:13,194 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:50:13,195 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:50:13,195 INFO L146 ILogger]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:50:13,195 INFO L146 ILogger]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-05-23 09:50:13,248 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:13,248 INFO L146 ILogger]: Finished difference Result 50 states and 50 transitions. [2019-05-23 09:50:13,249 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:50:13,249 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 48 [2019-05-23 09:50:13,249 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:13,250 INFO L146 ILogger]: With dead ends: 50 [2019-05-23 09:50:13,250 INFO L146 ILogger]: Without dead ends: 50 [2019-05-23 09:50:13,250 INFO L146 ILogger]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:50:13,251 INFO L146 ILogger]: Start minimizeSevpa. Operand 50 states. [2019-05-23 09:50:13,251 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-05-23 09:50:13,252 INFO L146 ILogger]: Start removeUnreachable. Operand 50 states. [2019-05-23 09:50:13,252 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-05-23 09:50:13,252 INFO L146 ILogger]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-05-23 09:50:13,252 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:13,252 INFO L146 ILogger]: Abstraction has 50 states and 50 transitions. [2019-05-23 09:50:13,253 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:50:13,253 INFO L146 ILogger]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-23 09:50:13,253 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:50:13,253 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:13,253 INFO L146 ILogger]: trace histogram [47, 1, 1] [2019-05-23 09:50:13,254 INFO L146 ILogger]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:13,254 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:13,254 INFO L146 ILogger]: Analyzing trace with hash 1126454310, now seen corresponding path program 47 times [2019-05-23 09:50:13,255 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:13,276 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:13,280 INFO L146 ILogger]: Trace formula consists of 569 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 09:50:13,281 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:14,238 INFO L146 ILogger]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:14,238 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:14,238 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:50:14,238 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:50:14,239 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:50:14,239 INFO L146 ILogger]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:14,239 INFO L146 ILogger]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-05-23 09:50:14,298 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:14,298 INFO L146 ILogger]: Finished difference Result 51 states and 51 transitions. [2019-05-23 09:50:14,298 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:50:14,298 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 49 [2019-05-23 09:50:14,299 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:14,299 INFO L146 ILogger]: With dead ends: 51 [2019-05-23 09:50:14,299 INFO L146 ILogger]: Without dead ends: 51 [2019-05-23 09:50:14,300 INFO L146 ILogger]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:14,300 INFO L146 ILogger]: Start minimizeSevpa. Operand 51 states. [2019-05-23 09:50:14,302 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-05-23 09:50:14,302 INFO L146 ILogger]: Start removeUnreachable. Operand 51 states. [2019-05-23 09:50:14,302 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-23 09:50:14,302 INFO L146 ILogger]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-05-23 09:50:14,303 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:14,303 INFO L146 ILogger]: Abstraction has 51 states and 51 transitions. [2019-05-23 09:50:14,303 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:50:14,303 INFO L146 ILogger]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-23 09:50:14,303 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 09:50:14,303 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:14,303 INFO L146 ILogger]: trace histogram [48, 1, 1] [2019-05-23 09:50:14,304 INFO L146 ILogger]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:14,304 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:14,304 INFO L146 ILogger]: Analyzing trace with hash 560345282, now seen corresponding path program 48 times [2019-05-23 09:50:14,304 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:14,324 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:14,327 INFO L146 ILogger]: Trace formula consists of 581 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:50:14,328 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:15,175 INFO L146 ILogger]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:15,175 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:15,175 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:50:15,176 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:50:15,176 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:50:15,176 INFO L146 ILogger]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:50:15,177 INFO L146 ILogger]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-05-23 09:50:15,250 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:15,250 INFO L146 ILogger]: Finished difference Result 52 states and 52 transitions. [2019-05-23 09:50:15,250 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:50:15,251 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 50 [2019-05-23 09:50:15,251 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:15,251 INFO L146 ILogger]: With dead ends: 52 [2019-05-23 09:50:15,252 INFO L146 ILogger]: Without dead ends: 52 [2019-05-23 09:50:15,252 INFO L146 ILogger]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:50:15,253 INFO L146 ILogger]: Start minimizeSevpa. Operand 52 states. [2019-05-23 09:50:15,254 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-05-23 09:50:15,254 INFO L146 ILogger]: Start removeUnreachable. Operand 52 states. [2019-05-23 09:50:15,255 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-05-23 09:50:15,255 INFO L146 ILogger]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-05-23 09:50:15,255 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:15,255 INFO L146 ILogger]: Abstraction has 52 states and 52 transitions. [2019-05-23 09:50:15,255 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:50:15,256 INFO L146 ILogger]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-23 09:50:15,256 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 52 [2019-05-23 09:50:15,256 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:15,256 INFO L146 ILogger]: trace histogram [49, 1, 1] [2019-05-23 09:50:15,256 INFO L146 ILogger]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:15,257 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:15,257 INFO L146 ILogger]: Analyzing trace with hash 190834598, now seen corresponding path program 49 times [2019-05-23 09:50:15,257 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:15,277 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:15,280 INFO L146 ILogger]: Trace formula consists of 593 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:50:15,282 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:16,288 INFO L146 ILogger]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:16,288 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:16,288 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:50:16,288 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:50:16,289 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:50:16,289 INFO L146 ILogger]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:50:16,289 INFO L146 ILogger]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-05-23 09:50:16,348 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:16,348 INFO L146 ILogger]: Finished difference Result 53 states and 53 transitions. [2019-05-23 09:50:16,349 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:50:16,349 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 51 [2019-05-23 09:50:16,349 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:16,349 INFO L146 ILogger]: With dead ends: 53 [2019-05-23 09:50:16,349 INFO L146 ILogger]: Without dead ends: 53 [2019-05-23 09:50:16,350 INFO L146 ILogger]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:50:16,351 INFO L146 ILogger]: Start minimizeSevpa. Operand 53 states. [2019-05-23 09:50:16,352 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-05-23 09:50:16,352 INFO L146 ILogger]: Start removeUnreachable. Operand 53 states. [2019-05-23 09:50:16,353 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-23 09:50:16,353 INFO L146 ILogger]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-05-23 09:50:16,353 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:16,353 INFO L146 ILogger]: Abstraction has 53 states and 53 transitions. [2019-05-23 09:50:16,353 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:50:16,353 INFO L146 ILogger]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-23 09:50:16,354 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 53 [2019-05-23 09:50:16,354 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:16,354 INFO L146 ILogger]: trace histogram [50, 1, 1] [2019-05-23 09:50:16,354 INFO L146 ILogger]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:16,354 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:16,354 INFO L146 ILogger]: Analyzing trace with hash 1620905282, now seen corresponding path program 50 times [2019-05-23 09:50:16,355 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:16,378 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:16,381 INFO L146 ILogger]: Trace formula consists of 605 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:50:16,382 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:17,345 INFO L146 ILogger]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:17,345 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:17,345 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:50:17,346 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:50:17,346 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:50:17,347 INFO L146 ILogger]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:50:17,347 INFO L146 ILogger]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-05-23 09:50:17,418 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:17,418 INFO L146 ILogger]: Finished difference Result 54 states and 54 transitions. [2019-05-23 09:50:17,419 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:50:17,419 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 52 [2019-05-23 09:50:17,419 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:17,420 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 09:50:17,420 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 09:50:17,421 INFO L146 ILogger]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:50:17,421 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 09:50:17,422 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-05-23 09:50:17,422 INFO L146 ILogger]: Start removeUnreachable. Operand 54 states. [2019-05-23 09:50:17,422 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-05-23 09:50:17,422 INFO L146 ILogger]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-05-23 09:50:17,422 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:17,423 INFO L146 ILogger]: Abstraction has 54 states and 54 transitions. [2019-05-23 09:50:17,423 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:50:17,423 INFO L146 ILogger]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-23 09:50:17,423 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 54 [2019-05-23 09:50:17,423 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:17,423 INFO L146 ILogger]: trace histogram [51, 1, 1] [2019-05-23 09:50:17,423 INFO L146 ILogger]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:17,424 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:17,424 INFO L146 ILogger]: Analyzing trace with hash -1291543770, now seen corresponding path program 51 times [2019-05-23 09:50:17,424 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:17,440 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:17,444 INFO L146 ILogger]: Trace formula consists of 617 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 09:50:17,445 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:18,497 INFO L146 ILogger]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:18,497 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:18,498 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:50:18,498 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:50:18,498 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:50:18,498 INFO L146 ILogger]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:50:18,499 INFO L146 ILogger]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-05-23 09:50:18,591 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:18,592 INFO L146 ILogger]: Finished difference Result 55 states and 55 transitions. [2019-05-23 09:50:18,592 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:50:18,592 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 53 [2019-05-23 09:50:18,592 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:18,593 INFO L146 ILogger]: With dead ends: 55 [2019-05-23 09:50:18,593 INFO L146 ILogger]: Without dead ends: 55 [2019-05-23 09:50:18,593 INFO L146 ILogger]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:50:18,594 INFO L146 ILogger]: Start minimizeSevpa. Operand 55 states. [2019-05-23 09:50:18,595 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-05-23 09:50:18,595 INFO L146 ILogger]: Start removeUnreachable. Operand 55 states. [2019-05-23 09:50:18,596 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-05-23 09:50:18,596 INFO L146 ILogger]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-05-23 09:50:18,596 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:18,596 INFO L146 ILogger]: Abstraction has 55 states and 55 transitions. [2019-05-23 09:50:18,596 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:50:18,596 INFO L146 ILogger]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-23 09:50:18,596 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 55 [2019-05-23 09:50:18,596 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:18,596 INFO L146 ILogger]: trace histogram [52, 1, 1] [2019-05-23 09:50:18,597 INFO L146 ILogger]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:18,597 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:18,597 INFO L146 ILogger]: Analyzing trace with hash -1383151166, now seen corresponding path program 52 times [2019-05-23 09:50:18,597 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:18,615 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:18,619 INFO L146 ILogger]: Trace formula consists of 629 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:50:18,620 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:19,641 INFO L146 ILogger]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:19,641 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:19,641 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:50:19,642 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:50:19,642 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:50:19,642 INFO L146 ILogger]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:50:19,642 INFO L146 ILogger]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-05-23 09:50:19,713 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:19,714 INFO L146 ILogger]: Finished difference Result 56 states and 56 transitions. [2019-05-23 09:50:19,714 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:50:19,714 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 54 [2019-05-23 09:50:19,714 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:19,715 INFO L146 ILogger]: With dead ends: 56 [2019-05-23 09:50:19,715 INFO L146 ILogger]: Without dead ends: 56 [2019-05-23 09:50:19,716 INFO L146 ILogger]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:50:19,717 INFO L146 ILogger]: Start minimizeSevpa. Operand 56 states. [2019-05-23 09:50:19,718 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-05-23 09:50:19,718 INFO L146 ILogger]: Start removeUnreachable. Operand 56 states. [2019-05-23 09:50:19,718 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-05-23 09:50:19,718 INFO L146 ILogger]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-05-23 09:50:19,719 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:19,719 INFO L146 ILogger]: Abstraction has 56 states and 56 transitions. [2019-05-23 09:50:19,719 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:50:19,719 INFO L146 ILogger]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-23 09:50:19,719 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 56 [2019-05-23 09:50:19,719 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:19,719 INFO L146 ILogger]: trace histogram [53, 1, 1] [2019-05-23 09:50:19,720 INFO L146 ILogger]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:19,720 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:19,720 INFO L146 ILogger]: Analyzing trace with hash 71986854, now seen corresponding path program 53 times [2019-05-23 09:50:19,720 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:19,749 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:19,753 INFO L146 ILogger]: Trace formula consists of 641 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 09:50:19,755 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:20,805 INFO L146 ILogger]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:20,806 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:20,806 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:50:20,806 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:50:20,806 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:50:20,806 INFO L146 ILogger]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:50:20,807 INFO L146 ILogger]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-05-23 09:50:20,879 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:20,880 INFO L146 ILogger]: Finished difference Result 57 states and 57 transitions. [2019-05-23 09:50:20,880 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:50:20,880 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 55 [2019-05-23 09:50:20,880 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:20,881 INFO L146 ILogger]: With dead ends: 57 [2019-05-23 09:50:20,881 INFO L146 ILogger]: Without dead ends: 57 [2019-05-23 09:50:20,881 INFO L146 ILogger]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:50:20,882 INFO L146 ILogger]: Start minimizeSevpa. Operand 57 states. [2019-05-23 09:50:20,883 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-05-23 09:50:20,883 INFO L146 ILogger]: Start removeUnreachable. Operand 57 states. [2019-05-23 09:50:20,883 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-23 09:50:20,883 INFO L146 ILogger]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-05-23 09:50:20,883 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:20,884 INFO L146 ILogger]: Abstraction has 57 states and 57 transitions. [2019-05-23 09:50:20,884 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:50:20,884 INFO L146 ILogger]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-23 09:50:20,884 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 57 [2019-05-23 09:50:20,884 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:20,884 INFO L146 ILogger]: trace histogram [54, 1, 1] [2019-05-23 09:50:20,885 INFO L146 ILogger]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:20,885 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:20,885 INFO L146 ILogger]: Analyzing trace with hash -2063374782, now seen corresponding path program 54 times [2019-05-23 09:50:20,886 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:20,902 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:20,905 INFO L146 ILogger]: Trace formula consists of 653 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:50:20,906 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:21,981 INFO L146 ILogger]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:21,981 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:21,981 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:50:21,982 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:50:21,982 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:50:21,982 INFO L146 ILogger]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:50:21,982 INFO L146 ILogger]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-05-23 09:50:22,060 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:22,060 INFO L146 ILogger]: Finished difference Result 58 states and 58 transitions. [2019-05-23 09:50:22,060 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:50:22,060 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 56 [2019-05-23 09:50:22,061 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:22,061 INFO L146 ILogger]: With dead ends: 58 [2019-05-23 09:50:22,061 INFO L146 ILogger]: Without dead ends: 58 [2019-05-23 09:50:22,062 INFO L146 ILogger]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:50:22,062 INFO L146 ILogger]: Start minimizeSevpa. Operand 58 states. [2019-05-23 09:50:22,063 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-05-23 09:50:22,063 INFO L146 ILogger]: Start removeUnreachable. Operand 58 states. [2019-05-23 09:50:22,064 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-05-23 09:50:22,064 INFO L146 ILogger]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-05-23 09:50:22,064 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:22,064 INFO L146 ILogger]: Abstraction has 58 states and 58 transitions. [2019-05-23 09:50:22,064 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:50:22,064 INFO L146 ILogger]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-23 09:50:22,065 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:50:22,065 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:22,065 INFO L146 ILogger]: trace histogram [55, 1, 1] [2019-05-23 09:50:22,065 INFO L146 ILogger]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:22,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:22,066 INFO L146 ILogger]: Analyzing trace with hash 459891238, now seen corresponding path program 55 times [2019-05-23 09:50:22,066 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:22,084 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:22,087 INFO L146 ILogger]: Trace formula consists of 665 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:50:22,088 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:23,203 INFO L146 ILogger]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:23,203 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:23,204 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:50:23,204 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:50:23,204 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:50:23,204 INFO L146 ILogger]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:50:23,204 INFO L146 ILogger]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-05-23 09:50:23,277 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:23,277 INFO L146 ILogger]: Finished difference Result 59 states and 59 transitions. [2019-05-23 09:50:23,278 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:50:23,278 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 57 [2019-05-23 09:50:23,278 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:23,278 INFO L146 ILogger]: With dead ends: 59 [2019-05-23 09:50:23,279 INFO L146 ILogger]: Without dead ends: 59 [2019-05-23 09:50:23,279 INFO L146 ILogger]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:50:23,279 INFO L146 ILogger]: Start minimizeSevpa. Operand 59 states. [2019-05-23 09:50:23,280 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-05-23 09:50:23,281 INFO L146 ILogger]: Start removeUnreachable. Operand 59 states. [2019-05-23 09:50:23,281 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-05-23 09:50:23,281 INFO L146 ILogger]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-05-23 09:50:23,281 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:23,281 INFO L146 ILogger]: Abstraction has 59 states and 59 transitions. [2019-05-23 09:50:23,282 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:50:23,282 INFO L146 ILogger]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-23 09:50:23,282 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 59 [2019-05-23 09:50:23,282 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:23,282 INFO L146 ILogger]: trace histogram [56, 1, 1] [2019-05-23 09:50:23,282 INFO L146 ILogger]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:23,282 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:23,282 INFO L146 ILogger]: Analyzing trace with hash 1371726530, now seen corresponding path program 56 times [2019-05-23 09:50:23,283 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:23,301 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:23,304 INFO L146 ILogger]: Trace formula consists of 677 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:50:23,306 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:24,448 INFO L146 ILogger]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:24,449 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:24,449 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:50:24,449 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:50:24,450 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:50:24,450 INFO L146 ILogger]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:50:24,450 INFO L146 ILogger]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-05-23 09:50:24,517 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:24,517 INFO L146 ILogger]: Finished difference Result 60 states and 60 transitions. [2019-05-23 09:50:24,517 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:50:24,517 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 58 [2019-05-23 09:50:24,518 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:24,518 INFO L146 ILogger]: With dead ends: 60 [2019-05-23 09:50:24,518 INFO L146 ILogger]: Without dead ends: 60 [2019-05-23 09:50:24,519 INFO L146 ILogger]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:50:24,519 INFO L146 ILogger]: Start minimizeSevpa. Operand 60 states. [2019-05-23 09:50:24,521 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-05-23 09:50:24,521 INFO L146 ILogger]: Start removeUnreachable. Operand 60 states. [2019-05-23 09:50:24,521 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-05-23 09:50:24,522 INFO L146 ILogger]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-05-23 09:50:24,522 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:24,522 INFO L146 ILogger]: Abstraction has 60 states and 60 transitions. [2019-05-23 09:50:24,522 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:50:24,522 INFO L146 ILogger]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-23 09:50:24,523 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 60 [2019-05-23 09:50:24,523 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:24,523 INFO L146 ILogger]: trace histogram [57, 1, 1] [2019-05-23 09:50:24,523 INFO L146 ILogger]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:24,523 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:24,523 INFO L146 ILogger]: Analyzing trace with hash -426150490, now seen corresponding path program 57 times [2019-05-23 09:50:24,524 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:24,548 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:24,552 INFO L146 ILogger]: Trace formula consists of 689 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 09:50:24,553 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:25,938 INFO L146 ILogger]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:25,939 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:25,939 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:50:25,939 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:50:25,939 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:50:25,940 INFO L146 ILogger]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:50:25,940 INFO L146 ILogger]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-05-23 09:50:26,021 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:26,021 INFO L146 ILogger]: Finished difference Result 61 states and 61 transitions. [2019-05-23 09:50:26,022 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:50:26,022 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 59 [2019-05-23 09:50:26,022 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:26,022 INFO L146 ILogger]: With dead ends: 61 [2019-05-23 09:50:26,023 INFO L146 ILogger]: Without dead ends: 61 [2019-05-23 09:50:26,023 INFO L146 ILogger]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:50:26,024 INFO L146 ILogger]: Start minimizeSevpa. Operand 61 states. [2019-05-23 09:50:26,025 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-05-23 09:50:26,025 INFO L146 ILogger]: Start removeUnreachable. Operand 61 states. [2019-05-23 09:50:26,025 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-05-23 09:50:26,025 INFO L146 ILogger]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-05-23 09:50:26,026 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:26,026 INFO L146 ILogger]: Abstraction has 61 states and 61 transitions. [2019-05-23 09:50:26,026 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:50:26,026 INFO L146 ILogger]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-23 09:50:26,027 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 61 [2019-05-23 09:50:26,027 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:26,027 INFO L146 ILogger]: trace histogram [58, 1, 1] [2019-05-23 09:50:26,027 INFO L146 ILogger]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:26,027 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:26,028 INFO L146 ILogger]: Analyzing trace with hash -325763262, now seen corresponding path program 58 times [2019-05-23 09:50:26,028 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:26,054 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:26,058 INFO L146 ILogger]: Trace formula consists of 701 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:50:26,060 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:27,633 INFO L146 ILogger]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:27,633 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:27,633 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:50:27,633 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:50:27,634 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:50:27,634 INFO L146 ILogger]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:50:27,634 INFO L146 ILogger]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-05-23 09:50:27,715 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:27,716 INFO L146 ILogger]: Finished difference Result 62 states and 62 transitions. [2019-05-23 09:50:27,716 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:50:27,716 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 60 [2019-05-23 09:50:27,716 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:27,717 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 09:50:27,717 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 09:50:27,718 INFO L146 ILogger]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:50:27,718 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 09:50:27,719 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-05-23 09:50:27,720 INFO L146 ILogger]: Start removeUnreachable. Operand 62 states. [2019-05-23 09:50:27,720 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-05-23 09:50:27,720 INFO L146 ILogger]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-05-23 09:50:27,720 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:27,720 INFO L146 ILogger]: Abstraction has 62 states and 62 transitions. [2019-05-23 09:50:27,720 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:50:27,721 INFO L146 ILogger]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-23 09:50:27,721 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 09:50:27,721 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:27,721 INFO L146 ILogger]: trace histogram [59, 1, 1] [2019-05-23 09:50:27,721 INFO L146 ILogger]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:27,721 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:27,721 INFO L146 ILogger]: Analyzing trace with hash -1508726490, now seen corresponding path program 59 times [2019-05-23 09:50:27,722 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:27,748 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:27,751 INFO L146 ILogger]: Trace formula consists of 713 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 09:50:27,753 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:28,993 INFO L146 ILogger]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:28,993 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:28,993 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:50:28,994 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:50:28,994 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:50:28,994 INFO L146 ILogger]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:50:28,994 INFO L146 ILogger]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-05-23 09:50:29,072 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:29,073 INFO L146 ILogger]: Finished difference Result 63 states and 63 transitions. [2019-05-23 09:50:29,073 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:50:29,073 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 61 [2019-05-23 09:50:29,073 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:29,074 INFO L146 ILogger]: With dead ends: 63 [2019-05-23 09:50:29,074 INFO L146 ILogger]: Without dead ends: 63 [2019-05-23 09:50:29,074 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:50:29,075 INFO L146 ILogger]: Start minimizeSevpa. Operand 63 states. [2019-05-23 09:50:29,076 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-05-23 09:50:29,076 INFO L146 ILogger]: Start removeUnreachable. Operand 63 states. [2019-05-23 09:50:29,077 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-23 09:50:29,077 INFO L146 ILogger]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-05-23 09:50:29,077 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:29,077 INFO L146 ILogger]: Abstraction has 63 states and 63 transitions. [2019-05-23 09:50:29,077 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:50:29,077 INFO L146 ILogger]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-23 09:50:29,078 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 63 [2019-05-23 09:50:29,078 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:29,078 INFO L146 ILogger]: trace histogram [60, 1, 1] [2019-05-23 09:50:29,078 INFO L146 ILogger]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:29,078 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:29,078 INFO L146 ILogger]: Analyzing trace with hash 474119106, now seen corresponding path program 60 times [2019-05-23 09:50:29,079 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:29,102 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:29,105 INFO L146 ILogger]: Trace formula consists of 725 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:50:29,107 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:30,449 INFO L146 ILogger]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:30,450 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:30,450 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:50:30,450 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:50:30,450 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:50:30,450 INFO L146 ILogger]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:50:30,451 INFO L146 ILogger]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-05-23 09:50:30,527 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:30,527 INFO L146 ILogger]: Finished difference Result 64 states and 64 transitions. [2019-05-23 09:50:30,528 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:50:30,528 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 62 [2019-05-23 09:50:30,528 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:30,529 INFO L146 ILogger]: With dead ends: 64 [2019-05-23 09:50:30,529 INFO L146 ILogger]: Without dead ends: 64 [2019-05-23 09:50:30,529 INFO L146 ILogger]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:50:30,530 INFO L146 ILogger]: Start minimizeSevpa. Operand 64 states. [2019-05-23 09:50:30,531 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-05-23 09:50:30,531 INFO L146 ILogger]: Start removeUnreachable. Operand 64 states. [2019-05-23 09:50:30,531 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-05-23 09:50:30,532 INFO L146 ILogger]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-05-23 09:50:30,532 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:30,532 INFO L146 ILogger]: Abstraction has 64 states and 64 transitions. [2019-05-23 09:50:30,532 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:50:30,532 INFO L146 ILogger]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-23 09:50:30,532 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 64 [2019-05-23 09:50:30,533 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:30,533 INFO L146 ILogger]: trace histogram [61, 1, 1] [2019-05-23 09:50:30,533 INFO L146 ILogger]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:30,533 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:30,533 INFO L146 ILogger]: Analyzing trace with hash 1812790438, now seen corresponding path program 61 times [2019-05-23 09:50:30,534 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:30,561 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:30,564 INFO L146 ILogger]: Trace formula consists of 737 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:50:30,565 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:32,796 INFO L146 ILogger]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:32,796 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:32,797 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:50:32,797 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:50:32,797 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:50:32,798 INFO L146 ILogger]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:50:32,798 INFO L146 ILogger]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-05-23 09:50:32,876 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:32,876 INFO L146 ILogger]: Finished difference Result 65 states and 65 transitions. [2019-05-23 09:50:32,876 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:50:32,876 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 63 [2019-05-23 09:50:32,877 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:32,877 INFO L146 ILogger]: With dead ends: 65 [2019-05-23 09:50:32,877 INFO L146 ILogger]: Without dead ends: 65 [2019-05-23 09:50:32,878 INFO L146 ILogger]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:50:32,878 INFO L146 ILogger]: Start minimizeSevpa. Operand 65 states. [2019-05-23 09:50:32,879 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-05-23 09:50:32,879 INFO L146 ILogger]: Start removeUnreachable. Operand 65 states. [2019-05-23 09:50:32,880 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-05-23 09:50:32,880 INFO L146 ILogger]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-05-23 09:50:32,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:32,880 INFO L146 ILogger]: Abstraction has 65 states and 65 transitions. [2019-05-23 09:50:32,880 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:50:32,880 INFO L146 ILogger]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-23 09:50:32,881 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 65 [2019-05-23 09:50:32,881 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:32,881 INFO L146 ILogger]: trace histogram [62, 1, 1] [2019-05-23 09:50:32,881 INFO L146 ILogger]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:32,881 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:32,882 INFO L146 ILogger]: Analyzing trace with hash 361928770, now seen corresponding path program 62 times [2019-05-23 09:50:32,882 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:32,901 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:32,904 INFO L146 ILogger]: Trace formula consists of 749 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:50:32,906 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:34,241 INFO L146 ILogger]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:34,241 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:34,241 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:50:34,241 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:50:34,242 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:50:34,242 INFO L146 ILogger]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:50:34,242 INFO L146 ILogger]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-05-23 09:50:34,335 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:34,335 INFO L146 ILogger]: Finished difference Result 66 states and 66 transitions. [2019-05-23 09:50:34,335 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:50:34,336 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 64 [2019-05-23 09:50:34,336 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:34,336 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 09:50:34,336 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 09:50:34,337 INFO L146 ILogger]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:50:34,337 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 09:50:34,339 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-05-23 09:50:34,339 INFO L146 ILogger]: Start removeUnreachable. Operand 66 states. [2019-05-23 09:50:34,339 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-05-23 09:50:34,340 INFO L146 ILogger]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-05-23 09:50:34,340 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:34,340 INFO L146 ILogger]: Abstraction has 66 states and 66 transitions. [2019-05-23 09:50:34,340 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:50:34,340 INFO L146 ILogger]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-23 09:50:34,340 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 66 [2019-05-23 09:50:34,341 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:34,341 INFO L146 ILogger]: trace histogram [63, 1, 1] [2019-05-23 09:50:34,341 INFO L146 ILogger]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:34,341 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:34,341 INFO L146 ILogger]: Analyzing trace with hash -1665109978, now seen corresponding path program 63 times [2019-05-23 09:50:34,342 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:34,364 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:34,367 INFO L146 ILogger]: Trace formula consists of 761 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 09:50:34,369 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:35,873 INFO L146 ILogger]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:35,873 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:35,873 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:50:35,873 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:50:35,874 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:50:35,874 INFO L146 ILogger]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:50:35,874 INFO L146 ILogger]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-05-23 09:50:35,956 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:35,957 INFO L146 ILogger]: Finished difference Result 67 states and 67 transitions. [2019-05-23 09:50:35,957 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:50:35,957 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 65 [2019-05-23 09:50:35,957 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:35,958 INFO L146 ILogger]: With dead ends: 67 [2019-05-23 09:50:35,958 INFO L146 ILogger]: Without dead ends: 67 [2019-05-23 09:50:35,958 INFO L146 ILogger]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:50:35,959 INFO L146 ILogger]: Start minimizeSevpa. Operand 67 states. [2019-05-23 09:50:35,960 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-05-23 09:50:35,960 INFO L146 ILogger]: Start removeUnreachable. Operand 67 states. [2019-05-23 09:50:35,961 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-05-23 09:50:35,961 INFO L146 ILogger]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-05-23 09:50:35,961 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:35,961 INFO L146 ILogger]: Abstraction has 67 states and 67 transitions. [2019-05-23 09:50:35,961 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:50:35,962 INFO L146 ILogger]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-23 09:50:35,962 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 67 [2019-05-23 09:50:35,962 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:35,962 INFO L146 ILogger]: trace histogram [64, 1, 1] [2019-05-23 09:50:35,962 INFO L146 ILogger]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:35,962 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:35,963 INFO L146 ILogger]: Analyzing trace with hash -78801726, now seen corresponding path program 64 times [2019-05-23 09:50:35,963 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:35,994 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:35,999 INFO L146 ILogger]: Trace formula consists of 773 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:50:36,000 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:37,509 INFO L146 ILogger]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:37,510 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:37,510 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:50:37,510 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:50:37,511 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:50:37,511 INFO L146 ILogger]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:50:37,511 INFO L146 ILogger]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-05-23 09:50:37,596 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:37,596 INFO L146 ILogger]: Finished difference Result 68 states and 68 transitions. [2019-05-23 09:50:37,596 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:50:37,596 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 66 [2019-05-23 09:50:37,597 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:37,597 INFO L146 ILogger]: With dead ends: 68 [2019-05-23 09:50:37,597 INFO L146 ILogger]: Without dead ends: 68 [2019-05-23 09:50:37,598 INFO L146 ILogger]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:50:37,598 INFO L146 ILogger]: Start minimizeSevpa. Operand 68 states. [2019-05-23 09:50:37,600 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-05-23 09:50:37,600 INFO L146 ILogger]: Start removeUnreachable. Operand 68 states. [2019-05-23 09:50:37,600 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-05-23 09:50:37,601 INFO L146 ILogger]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-05-23 09:50:37,601 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:37,601 INFO L146 ILogger]: Abstraction has 68 states and 68 transitions. [2019-05-23 09:50:37,601 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:50:37,601 INFO L146 ILogger]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-23 09:50:37,601 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 68 [2019-05-23 09:50:37,602 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:37,602 INFO L146 ILogger]: trace histogram [65, 1, 1] [2019-05-23 09:50:37,602 INFO L146 ILogger]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:37,602 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:37,602 INFO L146 ILogger]: Analyzing trace with hash 1852113830, now seen corresponding path program 65 times [2019-05-23 09:50:37,603 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:37,627 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:37,630 INFO L146 ILogger]: Trace formula consists of 785 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 09:50:37,631 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:39,120 INFO L146 ILogger]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:39,121 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:39,121 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:50:39,121 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:50:39,121 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:50:39,122 INFO L146 ILogger]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:50:39,122 INFO L146 ILogger]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-05-23 09:50:39,212 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:39,212 INFO L146 ILogger]: Finished difference Result 69 states and 69 transitions. [2019-05-23 09:50:39,212 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:50:39,212 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 67 [2019-05-23 09:50:39,213 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:39,213 INFO L146 ILogger]: With dead ends: 69 [2019-05-23 09:50:39,213 INFO L146 ILogger]: Without dead ends: 69 [2019-05-23 09:50:39,214 INFO L146 ILogger]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:50:39,214 INFO L146 ILogger]: Start minimizeSevpa. Operand 69 states. [2019-05-23 09:50:39,215 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-05-23 09:50:39,215 INFO L146 ILogger]: Start removeUnreachable. Operand 69 states. [2019-05-23 09:50:39,216 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-23 09:50:39,216 INFO L146 ILogger]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-05-23 09:50:39,216 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:39,217 INFO L146 ILogger]: Abstraction has 69 states and 69 transitions. [2019-05-23 09:50:39,217 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:50:39,217 INFO L146 ILogger]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-23 09:50:39,217 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 69 [2019-05-23 09:50:39,217 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:39,217 INFO L146 ILogger]: trace histogram [66, 1, 1] [2019-05-23 09:50:39,218 INFO L146 ILogger]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:39,218 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:39,218 INFO L146 ILogger]: Analyzing trace with hash 1580953922, now seen corresponding path program 66 times [2019-05-23 09:50:39,218 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:39,247 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:39,251 INFO L146 ILogger]: Trace formula consists of 797 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:50:39,252 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:40,759 INFO L146 ILogger]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:40,759 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:40,759 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:50:40,759 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:50:40,760 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:50:40,760 INFO L146 ILogger]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:50:40,760 INFO L146 ILogger]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-05-23 09:50:40,853 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:40,854 INFO L146 ILogger]: Finished difference Result 70 states and 70 transitions. [2019-05-23 09:50:40,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:50:40,854 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 68 [2019-05-23 09:50:40,854 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:40,855 INFO L146 ILogger]: With dead ends: 70 [2019-05-23 09:50:40,855 INFO L146 ILogger]: Without dead ends: 70 [2019-05-23 09:50:40,855 INFO L146 ILogger]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:50:40,855 INFO L146 ILogger]: Start minimizeSevpa. Operand 70 states. [2019-05-23 09:50:40,856 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-05-23 09:50:40,856 INFO L146 ILogger]: Start removeUnreachable. Operand 70 states. [2019-05-23 09:50:40,856 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-05-23 09:50:40,856 INFO L146 ILogger]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-05-23 09:50:40,857 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:40,857 INFO L146 ILogger]: Abstraction has 70 states and 70 transitions. [2019-05-23 09:50:40,857 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:50:40,857 INFO L146 ILogger]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-23 09:50:40,857 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 70 [2019-05-23 09:50:40,857 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:40,857 INFO L146 ILogger]: trace histogram [67, 1, 1] [2019-05-23 09:50:40,857 INFO L146 ILogger]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:40,858 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:40,858 INFO L146 ILogger]: Analyzing trace with hash 1764931366, now seen corresponding path program 67 times [2019-05-23 09:50:40,858 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:40,884 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:40,887 INFO L146 ILogger]: Trace formula consists of 809 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:50:40,888 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:42,440 INFO L146 ILogger]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:42,440 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:42,440 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:50:42,440 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:50:42,441 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:50:42,441 INFO L146 ILogger]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:50:42,441 INFO L146 ILogger]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-05-23 09:50:42,524 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:42,524 INFO L146 ILogger]: Finished difference Result 71 states and 71 transitions. [2019-05-23 09:50:42,524 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:50:42,525 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 69 [2019-05-23 09:50:42,525 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:42,525 INFO L146 ILogger]: With dead ends: 71 [2019-05-23 09:50:42,525 INFO L146 ILogger]: Without dead ends: 71 [2019-05-23 09:50:42,526 INFO L146 ILogger]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:50:42,526 INFO L146 ILogger]: Start minimizeSevpa. Operand 71 states. [2019-05-23 09:50:42,527 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-05-23 09:50:42,528 INFO L146 ILogger]: Start removeUnreachable. Operand 71 states. [2019-05-23 09:50:42,528 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-05-23 09:50:42,528 INFO L146 ILogger]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-05-23 09:50:42,529 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:42,529 INFO L146 ILogger]: Abstraction has 71 states and 71 transitions. [2019-05-23 09:50:42,529 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:50:42,529 INFO L146 ILogger]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-23 09:50:42,529 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 71 [2019-05-23 09:50:42,529 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:42,530 INFO L146 ILogger]: trace histogram [68, 1, 1] [2019-05-23 09:50:42,530 INFO L146 ILogger]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:42,530 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:42,530 INFO L146 ILogger]: Analyzing trace with hash -1121702462, now seen corresponding path program 68 times [2019-05-23 09:50:42,531 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:42,563 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:42,567 INFO L146 ILogger]: Trace formula consists of 821 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:50:42,568 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:44,146 INFO L146 ILogger]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:44,146 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:44,146 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:50:44,146 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:50:44,147 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:50:44,147 INFO L146 ILogger]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:50:44,147 INFO L146 ILogger]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-05-23 09:50:44,236 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:44,236 INFO L146 ILogger]: Finished difference Result 72 states and 72 transitions. [2019-05-23 09:50:44,236 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:50:44,237 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 70 [2019-05-23 09:50:44,237 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:44,237 INFO L146 ILogger]: With dead ends: 72 [2019-05-23 09:50:44,238 INFO L146 ILogger]: Without dead ends: 72 [2019-05-23 09:50:44,238 INFO L146 ILogger]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:50:44,238 INFO L146 ILogger]: Start minimizeSevpa. Operand 72 states. [2019-05-23 09:50:44,239 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-05-23 09:50:44,239 INFO L146 ILogger]: Start removeUnreachable. Operand 72 states. [2019-05-23 09:50:44,240 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-05-23 09:50:44,240 INFO L146 ILogger]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-05-23 09:50:44,240 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:44,240 INFO L146 ILogger]: Abstraction has 72 states and 72 transitions. [2019-05-23 09:50:44,240 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:50:44,240 INFO L146 ILogger]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-23 09:50:44,241 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 72 [2019-05-23 09:50:44,241 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:44,241 INFO L146 ILogger]: trace histogram [69, 1, 1] [2019-05-23 09:50:44,241 INFO L146 ILogger]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:44,241 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:44,241 INFO L146 ILogger]: Analyzing trace with hash -413037914, now seen corresponding path program 69 times [2019-05-23 09:50:44,242 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:44,263 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:44,267 INFO L146 ILogger]: Trace formula consists of 833 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 09:50:44,268 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:45,892 INFO L146 ILogger]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:45,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:45,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:50:45,893 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:50:45,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:50:45,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:50:45,894 INFO L146 ILogger]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-05-23 09:50:45,990 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:45,991 INFO L146 ILogger]: Finished difference Result 73 states and 73 transitions. [2019-05-23 09:50:45,991 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:50:45,991 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 71 [2019-05-23 09:50:45,991 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:45,992 INFO L146 ILogger]: With dead ends: 73 [2019-05-23 09:50:45,992 INFO L146 ILogger]: Without dead ends: 73 [2019-05-23 09:50:45,992 INFO L146 ILogger]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:50:45,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 73 states. [2019-05-23 09:50:45,994 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-05-23 09:50:45,994 INFO L146 ILogger]: Start removeUnreachable. Operand 73 states. [2019-05-23 09:50:45,994 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-23 09:50:45,994 INFO L146 ILogger]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-05-23 09:50:45,994 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:45,994 INFO L146 ILogger]: Abstraction has 73 states and 73 transitions. [2019-05-23 09:50:45,995 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:50:45,995 INFO L146 ILogger]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-23 09:50:45,995 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 73 [2019-05-23 09:50:45,995 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:45,995 INFO L146 ILogger]: trace histogram [70, 1, 1] [2019-05-23 09:50:45,995 INFO L146 ILogger]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:45,996 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:45,996 INFO L146 ILogger]: Analyzing trace with hash 80726594, now seen corresponding path program 70 times [2019-05-23 09:50:45,996 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:46,030 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:46,035 INFO L146 ILogger]: Trace formula consists of 845 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:50:46,037 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:47,901 INFO L146 ILogger]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:47,902 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:47,902 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:50:47,902 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:50:47,903 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:50:47,903 INFO L146 ILogger]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:50:47,903 INFO L146 ILogger]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-05-23 09:50:48,028 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:48,029 INFO L146 ILogger]: Finished difference Result 74 states and 74 transitions. [2019-05-23 09:50:48,029 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:50:48,029 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 72 [2019-05-23 09:50:48,030 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:48,030 INFO L146 ILogger]: With dead ends: 74 [2019-05-23 09:50:48,030 INFO L146 ILogger]: Without dead ends: 74 [2019-05-23 09:50:48,031 INFO L146 ILogger]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:50:48,031 INFO L146 ILogger]: Start minimizeSevpa. Operand 74 states. [2019-05-23 09:50:48,033 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-05-23 09:50:48,034 INFO L146 ILogger]: Start removeUnreachable. Operand 74 states. [2019-05-23 09:50:48,034 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-05-23 09:50:48,034 INFO L146 ILogger]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-05-23 09:50:48,034 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:48,035 INFO L146 ILogger]: Abstraction has 74 states and 74 transitions. [2019-05-23 09:50:48,035 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:50:48,035 INFO L146 ILogger]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-23 09:50:48,035 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 74 [2019-05-23 09:50:48,035 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:48,035 INFO L146 ILogger]: trace histogram [71, 1, 1] [2019-05-23 09:50:48,036 INFO L146 ILogger]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:48,036 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:48,036 INFO L146 ILogger]: Analyzing trace with hash -1792442842, now seen corresponding path program 71 times [2019-05-23 09:50:48,037 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:48,071 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:48,077 INFO L146 ILogger]: Trace formula consists of 857 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 09:50:48,078 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:49,801 INFO L146 ILogger]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:49,801 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:49,801 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:50:49,801 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:50:49,802 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:50:49,802 INFO L146 ILogger]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:50:49,803 INFO L146 ILogger]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-05-23 09:50:49,897 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:49,897 INFO L146 ILogger]: Finished difference Result 75 states and 75 transitions. [2019-05-23 09:50:49,898 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:50:49,898 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 73 [2019-05-23 09:50:49,898 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:49,899 INFO L146 ILogger]: With dead ends: 75 [2019-05-23 09:50:49,899 INFO L146 ILogger]: Without dead ends: 75 [2019-05-23 09:50:49,899 INFO L146 ILogger]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:50:49,900 INFO L146 ILogger]: Start minimizeSevpa. Operand 75 states. [2019-05-23 09:50:49,901 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-05-23 09:50:49,901 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 09:50:49,902 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-23 09:50:49,902 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-05-23 09:50:49,902 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:49,902 INFO L146 ILogger]: Abstraction has 75 states and 75 transitions. [2019-05-23 09:50:49,902 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:50:49,903 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-23 09:50:49,903 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 75 [2019-05-23 09:50:49,903 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:49,903 INFO L146 ILogger]: trace histogram [72, 1, 1] [2019-05-23 09:50:49,903 INFO L146 ILogger]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:49,904 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:49,904 INFO L146 ILogger]: Analyzing trace with hash 268846786, now seen corresponding path program 72 times [2019-05-23 09:50:49,904 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:49,940 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:49,945 INFO L146 ILogger]: Trace formula consists of 869 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:50:49,947 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:51,885 INFO L146 ILogger]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:51,885 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:51,885 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:50:51,885 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:50:51,886 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:50:51,886 INFO L146 ILogger]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:50:51,886 INFO L146 ILogger]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-05-23 09:50:51,977 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:51,977 INFO L146 ILogger]: Finished difference Result 76 states and 76 transitions. [2019-05-23 09:50:51,978 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:50:51,978 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 74 [2019-05-23 09:50:51,978 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:51,979 INFO L146 ILogger]: With dead ends: 76 [2019-05-23 09:50:51,979 INFO L146 ILogger]: Without dead ends: 76 [2019-05-23 09:50:51,979 INFO L146 ILogger]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:50:51,979 INFO L146 ILogger]: Start minimizeSevpa. Operand 76 states. [2019-05-23 09:50:51,981 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-05-23 09:50:51,981 INFO L146 ILogger]: Start removeUnreachable. Operand 76 states. [2019-05-23 09:50:51,981 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-05-23 09:50:51,981 INFO L146 ILogger]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-05-23 09:50:51,982 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:51,982 INFO L146 ILogger]: Abstraction has 76 states and 76 transitions. [2019-05-23 09:50:51,982 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:50:51,982 INFO L146 ILogger]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-23 09:50:51,982 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 76 [2019-05-23 09:50:51,982 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:51,983 INFO L146 ILogger]: trace histogram [73, 1, 1] [2019-05-23 09:50:51,983 INFO L146 ILogger]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:51,983 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:51,983 INFO L146 ILogger]: Analyzing trace with hash -255684186, now seen corresponding path program 73 times [2019-05-23 09:50:51,984 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:52,017 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:52,023 INFO L146 ILogger]: Trace formula consists of 881 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:50:52,024 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:53,850 INFO L146 ILogger]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:53,851 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:53,851 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:50:53,851 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:50:53,851 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:50:53,852 INFO L146 ILogger]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:50:53,852 INFO L146 ILogger]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-05-23 09:50:53,950 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:53,950 INFO L146 ILogger]: Finished difference Result 77 states and 77 transitions. [2019-05-23 09:50:53,951 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:50:53,951 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 75 [2019-05-23 09:50:53,951 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:53,951 INFO L146 ILogger]: With dead ends: 77 [2019-05-23 09:50:53,952 INFO L146 ILogger]: Without dead ends: 77 [2019-05-23 09:50:53,952 INFO L146 ILogger]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:50:53,952 INFO L146 ILogger]: Start minimizeSevpa. Operand 77 states. [2019-05-23 09:50:53,953 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-05-23 09:50:53,953 INFO L146 ILogger]: Start removeUnreachable. Operand 77 states. [2019-05-23 09:50:53,954 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-05-23 09:50:53,954 INFO L146 ILogger]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-05-23 09:50:53,954 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:53,954 INFO L146 ILogger]: Abstraction has 77 states and 77 transitions. [2019-05-23 09:50:53,954 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:50:53,954 INFO L146 ILogger]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-23 09:50:53,955 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 77 [2019-05-23 09:50:53,955 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:53,955 INFO L146 ILogger]: trace histogram [74, 1, 1] [2019-05-23 09:50:53,955 INFO L146 ILogger]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:53,955 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:53,956 INFO L146 ILogger]: Analyzing trace with hash 663724866, now seen corresponding path program 74 times [2019-05-23 09:50:53,956 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:53,995 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:54,000 INFO L146 ILogger]: Trace formula consists of 893 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:50:54,002 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:56,223 INFO L146 ILogger]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:56,223 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:56,223 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:50:56,224 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:50:56,224 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:50:56,224 INFO L146 ILogger]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:50:56,224 INFO L146 ILogger]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-05-23 09:50:56,320 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:56,320 INFO L146 ILogger]: Finished difference Result 78 states and 78 transitions. [2019-05-23 09:50:56,320 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:50:56,321 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 76 [2019-05-23 09:50:56,321 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:56,321 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:50:56,322 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 09:50:56,322 INFO L146 ILogger]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:50:56,322 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 09:50:56,324 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-05-23 09:50:56,324 INFO L146 ILogger]: Start removeUnreachable. Operand 78 states. [2019-05-23 09:50:56,324 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-05-23 09:50:56,324 INFO L146 ILogger]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-05-23 09:50:56,325 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:56,325 INFO L146 ILogger]: Abstraction has 78 states and 78 transitions. [2019-05-23 09:50:56,325 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:50:56,325 INFO L146 ILogger]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-23 09:50:56,325 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 09:50:56,325 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:56,326 INFO L146 ILogger]: trace histogram [75, 1, 1] [2019-05-23 09:50:56,326 INFO L146 ILogger]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:56,326 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:56,326 INFO L146 ILogger]: Analyzing trace with hash -899365594, now seen corresponding path program 75 times [2019-05-23 09:50:56,327 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:56,352 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:56,356 INFO L146 ILogger]: Trace formula consists of 905 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 09:50:56,357 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:58,245 INFO L146 ILogger]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:58,245 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:58,245 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:50:58,245 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:50:58,246 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:50:58,246 INFO L146 ILogger]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:50:58,246 INFO L146 ILogger]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-05-23 09:50:58,348 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:58,348 INFO L146 ILogger]: Finished difference Result 79 states and 79 transitions. [2019-05-23 09:50:58,349 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:50:58,349 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 77 [2019-05-23 09:50:58,349 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:58,350 INFO L146 ILogger]: With dead ends: 79 [2019-05-23 09:50:58,350 INFO L146 ILogger]: Without dead ends: 79 [2019-05-23 09:50:58,350 INFO L146 ILogger]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:50:58,351 INFO L146 ILogger]: Start minimizeSevpa. Operand 79 states. [2019-05-23 09:50:58,352 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-05-23 09:50:58,352 INFO L146 ILogger]: Start removeUnreachable. Operand 79 states. [2019-05-23 09:50:58,353 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-05-23 09:50:58,353 INFO L146 ILogger]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-05-23 09:50:58,353 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:58,353 INFO L146 ILogger]: Abstraction has 79 states and 79 transitions. [2019-05-23 09:50:58,353 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:50:58,353 INFO L146 ILogger]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-23 09:50:58,354 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 79 [2019-05-23 09:50:58,354 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:58,354 INFO L146 ILogger]: trace histogram [76, 1, 1] [2019-05-23 09:50:58,354 INFO L146 ILogger]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:58,354 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:58,354 INFO L146 ILogger]: Analyzing trace with hash -2110529598, now seen corresponding path program 76 times [2019-05-23 09:50:58,355 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:58,381 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:58,386 INFO L146 ILogger]: Trace formula consists of 917 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:50:58,387 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:00,349 INFO L146 ILogger]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:00,349 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:00,349 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:51:00,349 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:51:00,350 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:51:00,350 INFO L146 ILogger]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:51:00,350 INFO L146 ILogger]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-05-23 09:51:00,455 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:00,455 INFO L146 ILogger]: Finished difference Result 80 states and 80 transitions. [2019-05-23 09:51:00,456 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:51:00,456 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 78 [2019-05-23 09:51:00,456 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:00,457 INFO L146 ILogger]: With dead ends: 80 [2019-05-23 09:51:00,457 INFO L146 ILogger]: Without dead ends: 80 [2019-05-23 09:51:00,457 INFO L146 ILogger]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:51:00,458 INFO L146 ILogger]: Start minimizeSevpa. Operand 80 states. [2019-05-23 09:51:00,459 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-05-23 09:51:00,459 INFO L146 ILogger]: Start removeUnreachable. Operand 80 states. [2019-05-23 09:51:00,459 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-05-23 09:51:00,459 INFO L146 ILogger]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-05-23 09:51:00,459 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:00,460 INFO L146 ILogger]: Abstraction has 80 states and 80 transitions. [2019-05-23 09:51:00,460 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:51:00,460 INFO L146 ILogger]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-23 09:51:00,460 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 80 [2019-05-23 09:51:00,460 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:00,460 INFO L146 ILogger]: trace histogram [77, 1, 1] [2019-05-23 09:51:00,460 INFO L146 ILogger]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:00,461 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:00,461 INFO L146 ILogger]: Analyzing trace with hash -1001908058, now seen corresponding path program 77 times [2019-05-23 09:51:00,461 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:00,486 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:00,491 INFO L146 ILogger]: Trace formula consists of 929 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 09:51:00,492 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:02,488 INFO L146 ILogger]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:02,488 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:02,488 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:51:02,488 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:51:02,489 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:51:02,489 INFO L146 ILogger]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:51:02,489 INFO L146 ILogger]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2019-05-23 09:51:02,610 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:02,610 INFO L146 ILogger]: Finished difference Result 81 states and 81 transitions. [2019-05-23 09:51:02,610 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:51:02,611 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 79 [2019-05-23 09:51:02,611 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:02,611 INFO L146 ILogger]: With dead ends: 81 [2019-05-23 09:51:02,612 INFO L146 ILogger]: Without dead ends: 81 [2019-05-23 09:51:02,612 INFO L146 ILogger]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:51:02,613 INFO L146 ILogger]: Start minimizeSevpa. Operand 81 states. [2019-05-23 09:51:02,614 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-05-23 09:51:02,614 INFO L146 ILogger]: Start removeUnreachable. Operand 81 states. [2019-05-23 09:51:02,615 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-23 09:51:02,615 INFO L146 ILogger]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-05-23 09:51:02,615 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:02,615 INFO L146 ILogger]: Abstraction has 81 states and 81 transitions. [2019-05-23 09:51:02,615 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:51:02,615 INFO L146 ILogger]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-23 09:51:02,616 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 81 [2019-05-23 09:51:02,616 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:02,616 INFO L146 ILogger]: trace histogram [78, 1, 1] [2019-05-23 09:51:02,616 INFO L146 ILogger]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:02,617 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:02,617 INFO L146 ILogger]: Analyzing trace with hash -994378686, now seen corresponding path program 78 times [2019-05-23 09:51:02,617 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:02,647 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:02,651 INFO L146 ILogger]: Trace formula consists of 941 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:51:02,653 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:04,714 INFO L146 ILogger]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:04,715 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:04,715 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:51:04,715 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:51:04,716 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:51:04,716 INFO L146 ILogger]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:51:04,716 INFO L146 ILogger]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2019-05-23 09:51:05,180 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:05,180 INFO L146 ILogger]: Finished difference Result 82 states and 82 transitions. [2019-05-23 09:51:05,180 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:51:05,180 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 80 [2019-05-23 09:51:05,181 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:05,181 INFO L146 ILogger]: With dead ends: 82 [2019-05-23 09:51:05,181 INFO L146 ILogger]: Without dead ends: 82 [2019-05-23 09:51:05,181 INFO L146 ILogger]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:51:05,182 INFO L146 ILogger]: Start minimizeSevpa. Operand 82 states. [2019-05-23 09:51:05,182 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-05-23 09:51:05,183 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 09:51:05,183 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-05-23 09:51:05,183 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-05-23 09:51:05,183 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:05,183 INFO L146 ILogger]: Abstraction has 82 states and 82 transitions. [2019-05-23 09:51:05,183 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:51:05,183 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-23 09:51:05,184 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 82 [2019-05-23 09:51:05,184 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:05,184 INFO L146 ILogger]: trace histogram [79, 1, 1] [2019-05-23 09:51:05,184 INFO L146 ILogger]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:05,184 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:05,184 INFO L146 ILogger]: Analyzing trace with hash -760968154, now seen corresponding path program 79 times [2019-05-23 09:51:05,185 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:05,211 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:05,215 INFO L146 ILogger]: Trace formula consists of 953 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:51:05,216 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:07,335 INFO L146 ILogger]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:07,335 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:07,335 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:51:07,335 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:51:07,336 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:51:07,336 INFO L146 ILogger]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:51:07,336 INFO L146 ILogger]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2019-05-23 09:51:07,444 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:07,444 INFO L146 ILogger]: Finished difference Result 83 states and 83 transitions. [2019-05-23 09:51:07,444 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:51:07,445 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 81 [2019-05-23 09:51:07,445 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:07,446 INFO L146 ILogger]: With dead ends: 83 [2019-05-23 09:51:07,446 INFO L146 ILogger]: Without dead ends: 83 [2019-05-23 09:51:07,446 INFO L146 ILogger]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:51:07,447 INFO L146 ILogger]: Start minimizeSevpa. Operand 83 states. [2019-05-23 09:51:07,448 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-05-23 09:51:07,448 INFO L146 ILogger]: Start removeUnreachable. Operand 83 states. [2019-05-23 09:51:07,448 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-23 09:51:07,448 INFO L146 ILogger]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-05-23 09:51:07,449 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:07,449 INFO L146 ILogger]: Abstraction has 83 states and 83 transitions. [2019-05-23 09:51:07,449 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:51:07,449 INFO L146 ILogger]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-23 09:51:07,449 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 83 [2019-05-23 09:51:07,449 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:07,450 INFO L146 ILogger]: trace histogram [80, 1, 1] [2019-05-23 09:51:07,450 INFO L146 ILogger]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:07,450 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:07,450 INFO L146 ILogger]: Analyzing trace with hash -2115176254, now seen corresponding path program 80 times [2019-05-23 09:51:07,451 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:07,492 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:07,498 INFO L146 ILogger]: Trace formula consists of 965 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:51:07,499 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:09,719 INFO L146 ILogger]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:09,719 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:09,719 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:51:09,720 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:51:09,720 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:51:09,721 INFO L146 ILogger]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:51:09,721 INFO L146 ILogger]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2019-05-23 09:51:09,831 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:09,831 INFO L146 ILogger]: Finished difference Result 84 states and 84 transitions. [2019-05-23 09:51:09,831 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:51:09,831 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 82 [2019-05-23 09:51:09,832 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:09,832 INFO L146 ILogger]: With dead ends: 84 [2019-05-23 09:51:09,832 INFO L146 ILogger]: Without dead ends: 84 [2019-05-23 09:51:09,833 INFO L146 ILogger]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:51:09,833 INFO L146 ILogger]: Start minimizeSevpa. Operand 84 states. [2019-05-23 09:51:09,834 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-05-23 09:51:09,835 INFO L146 ILogger]: Start removeUnreachable. Operand 84 states. [2019-05-23 09:51:09,835 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-05-23 09:51:09,835 INFO L146 ILogger]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-05-23 09:51:09,836 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:09,836 INFO L146 ILogger]: Abstraction has 84 states and 84 transitions. [2019-05-23 09:51:09,836 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:51:09,836 INFO L146 ILogger]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-23 09:51:09,836 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 84 [2019-05-23 09:51:09,836 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:09,836 INFO L146 ILogger]: trace histogram [81, 1, 1] [2019-05-23 09:51:09,837 INFO L146 ILogger]: === Iteration 82 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:09,837 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:09,837 INFO L146 ILogger]: Analyzing trace with hash -1145954394, now seen corresponding path program 81 times [2019-05-23 09:51:09,837 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:09,874 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:09,880 INFO L146 ILogger]: Trace formula consists of 977 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 09:51:09,882 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:14,223 INFO L146 ILogger]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:14,223 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:14,223 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:51:14,224 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:51:14,224 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:51:14,224 INFO L146 ILogger]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:51:14,225 INFO L146 ILogger]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2019-05-23 09:51:14,331 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:14,331 INFO L146 ILogger]: Finished difference Result 85 states and 85 transitions. [2019-05-23 09:51:14,331 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:51:14,332 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 83 [2019-05-23 09:51:14,332 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:14,332 INFO L146 ILogger]: With dead ends: 85 [2019-05-23 09:51:14,332 INFO L146 ILogger]: Without dead ends: 85 [2019-05-23 09:51:14,333 INFO L146 ILogger]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:51:14,333 INFO L146 ILogger]: Start minimizeSevpa. Operand 85 states. [2019-05-23 09:51:14,335 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-05-23 09:51:14,335 INFO L146 ILogger]: Start removeUnreachable. Operand 85 states. [2019-05-23 09:51:14,335 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-05-23 09:51:14,335 INFO L146 ILogger]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-05-23 09:51:14,335 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:14,335 INFO L146 ILogger]: Abstraction has 85 states and 85 transitions. [2019-05-23 09:51:14,336 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:51:14,336 INFO L146 ILogger]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-23 09:51:14,336 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 85 [2019-05-23 09:51:14,336 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:14,336 INFO L146 ILogger]: trace histogram [82, 1, 1] [2019-05-23 09:51:14,336 INFO L146 ILogger]: === Iteration 83 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:14,336 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:14,336 INFO L146 ILogger]: Analyzing trace with hash -1164847806, now seen corresponding path program 82 times [2019-05-23 09:51:14,337 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:14,364 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:14,368 INFO L146 ILogger]: Trace formula consists of 989 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:51:14,369 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:16,647 INFO L146 ILogger]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:16,648 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:16,648 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:51:16,648 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:51:16,648 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:51:16,649 INFO L146 ILogger]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:51:16,649 INFO L146 ILogger]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2019-05-23 09:51:16,755 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:16,756 INFO L146 ILogger]: Finished difference Result 86 states and 86 transitions. [2019-05-23 09:51:16,756 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:51:16,756 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 84 [2019-05-23 09:51:16,756 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:16,757 INFO L146 ILogger]: With dead ends: 86 [2019-05-23 09:51:16,757 INFO L146 ILogger]: Without dead ends: 86 [2019-05-23 09:51:16,758 INFO L146 ILogger]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:51:16,758 INFO L146 ILogger]: Start minimizeSevpa. Operand 86 states. [2019-05-23 09:51:16,759 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-05-23 09:51:16,759 INFO L146 ILogger]: Start removeUnreachable. Operand 86 states. [2019-05-23 09:51:16,759 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-05-23 09:51:16,760 INFO L146 ILogger]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-05-23 09:51:16,760 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:16,760 INFO L146 ILogger]: Abstraction has 86 states and 86 transitions. [2019-05-23 09:51:16,760 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:51:16,761 INFO L146 ILogger]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-23 09:51:16,761 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:51:16,761 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:16,761 INFO L146 ILogger]: trace histogram [83, 1, 1] [2019-05-23 09:51:16,761 INFO L146 ILogger]: === Iteration 84 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:16,761 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:16,761 INFO L146 ILogger]: Analyzing trace with hash -1750543578, now seen corresponding path program 83 times [2019-05-23 09:51:16,762 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:16,800 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:16,807 INFO L146 ILogger]: Trace formula consists of 1001 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 09:51:16,808 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:19,406 INFO L146 ILogger]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:19,406 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:19,406 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:51:19,407 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:51:19,407 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:51:19,408 INFO L146 ILogger]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:51:19,408 INFO L146 ILogger]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2019-05-23 09:51:19,618 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:19,618 INFO L146 ILogger]: Finished difference Result 87 states and 87 transitions. [2019-05-23 09:51:19,619 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:51:19,619 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 85 [2019-05-23 09:51:19,619 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:19,620 INFO L146 ILogger]: With dead ends: 87 [2019-05-23 09:51:19,620 INFO L146 ILogger]: Without dead ends: 87 [2019-05-23 09:51:19,620 INFO L146 ILogger]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:51:19,621 INFO L146 ILogger]: Start minimizeSevpa. Operand 87 states. [2019-05-23 09:51:19,622 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-05-23 09:51:19,622 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 09:51:19,622 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-23 09:51:19,622 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-05-23 09:51:19,622 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:19,623 INFO L146 ILogger]: Abstraction has 87 states and 87 transitions. [2019-05-23 09:51:19,623 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:51:19,623 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-23 09:51:19,623 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 87 [2019-05-23 09:51:19,623 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:19,623 INFO L146 ILogger]: trace histogram [84, 1, 1] [2019-05-23 09:51:19,624 INFO L146 ILogger]: === Iteration 85 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:19,624 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:19,624 INFO L146 ILogger]: Analyzing trace with hash 1567723970, now seen corresponding path program 84 times [2019-05-23 09:51:19,624 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:19,656 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:19,662 INFO L146 ILogger]: Trace formula consists of 1013 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:51:19,663 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:22,005 INFO L146 ILogger]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:22,005 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:22,005 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:51:22,005 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:51:22,006 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:51:22,006 INFO L146 ILogger]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:51:22,006 INFO L146 ILogger]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2019-05-23 09:51:22,117 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:22,117 INFO L146 ILogger]: Finished difference Result 88 states and 88 transitions. [2019-05-23 09:51:22,118 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:51:22,118 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 86 [2019-05-23 09:51:22,118 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:22,119 INFO L146 ILogger]: With dead ends: 88 [2019-05-23 09:51:22,119 INFO L146 ILogger]: Without dead ends: 88 [2019-05-23 09:51:22,119 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:51:22,120 INFO L146 ILogger]: Start minimizeSevpa. Operand 88 states. [2019-05-23 09:51:22,121 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-05-23 09:51:22,121 INFO L146 ILogger]: Start removeUnreachable. Operand 88 states. [2019-05-23 09:51:22,122 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-05-23 09:51:22,122 INFO L146 ILogger]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-05-23 09:51:22,122 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:22,122 INFO L146 ILogger]: Abstraction has 88 states and 88 transitions. [2019-05-23 09:51:22,122 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:51:22,122 INFO L146 ILogger]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-23 09:51:22,123 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 88 [2019-05-23 09:51:22,123 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:22,123 INFO L146 ILogger]: trace histogram [85, 1, 1] [2019-05-23 09:51:22,123 INFO L146 ILogger]: === Iteration 86 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:22,123 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:22,123 INFO L146 ILogger]: Analyzing trace with hash 1354802854, now seen corresponding path program 85 times [2019-05-23 09:51:22,124 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:22,154 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:22,158 INFO L146 ILogger]: Trace formula consists of 1025 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:51:22,159 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:24,609 INFO L146 ILogger]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:24,610 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:24,610 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:51:24,610 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:51:24,611 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:51:24,611 INFO L146 ILogger]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:51:24,611 INFO L146 ILogger]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2019-05-23 09:51:24,788 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:24,788 INFO L146 ILogger]: Finished difference Result 89 states and 89 transitions. [2019-05-23 09:51:24,789 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:51:24,789 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 87 [2019-05-23 09:51:24,789 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:24,790 INFO L146 ILogger]: With dead ends: 89 [2019-05-23 09:51:24,790 INFO L146 ILogger]: Without dead ends: 89 [2019-05-23 09:51:24,790 INFO L146 ILogger]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:51:24,791 INFO L146 ILogger]: Start minimizeSevpa. Operand 89 states. [2019-05-23 09:51:24,792 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-05-23 09:51:24,792 INFO L146 ILogger]: Start removeUnreachable. Operand 89 states. [2019-05-23 09:51:24,792 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-05-23 09:51:24,793 INFO L146 ILogger]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-05-23 09:51:24,793 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:24,793 INFO L146 ILogger]: Abstraction has 89 states and 89 transitions. [2019-05-23 09:51:24,793 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:51:24,793 INFO L146 ILogger]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-23 09:51:24,794 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 89 [2019-05-23 09:51:24,794 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:24,794 INFO L146 ILogger]: trace histogram [86, 1, 1] [2019-05-23 09:51:24,794 INFO L146 ILogger]: === Iteration 87 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:24,794 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:24,794 INFO L146 ILogger]: Analyzing trace with hash -950784446, now seen corresponding path program 86 times [2019-05-23 09:51:24,795 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:24,837 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:24,844 INFO L146 ILogger]: Trace formula consists of 1037 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:51:24,846 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:27,340 INFO L146 ILogger]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:27,341 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:27,341 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:51:27,341 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:51:27,342 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:51:27,342 INFO L146 ILogger]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:51:27,342 INFO L146 ILogger]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2019-05-23 09:51:27,464 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:27,464 INFO L146 ILogger]: Finished difference Result 90 states and 90 transitions. [2019-05-23 09:51:27,465 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:51:27,465 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 88 [2019-05-23 09:51:27,465 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:27,466 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:51:27,466 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:51:27,466 INFO L146 ILogger]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:51:27,466 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:51:27,467 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-05-23 09:51:27,467 INFO L146 ILogger]: Start removeUnreachable. Operand 90 states. [2019-05-23 09:51:27,467 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-05-23 09:51:27,467 INFO L146 ILogger]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-05-23 09:51:27,468 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:27,468 INFO L146 ILogger]: Abstraction has 90 states and 90 transitions. [2019-05-23 09:51:27,468 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:51:27,468 INFO L146 ILogger]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-23 09:51:27,468 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 90 [2019-05-23 09:51:27,468 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:27,468 INFO L146 ILogger]: trace histogram [87, 1, 1] [2019-05-23 09:51:27,468 INFO L146 ILogger]: === Iteration 88 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:27,469 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:27,469 INFO L146 ILogger]: Analyzing trace with hash 590453286, now seen corresponding path program 87 times [2019-05-23 09:51:27,469 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:27,500 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:27,505 INFO L146 ILogger]: Trace formula consists of 1049 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 09:51:27,506 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:30,008 INFO L146 ILogger]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:30,008 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:30,008 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:51:30,009 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:51:30,009 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:51:30,010 INFO L146 ILogger]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:51:30,010 INFO L146 ILogger]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2019-05-23 09:51:30,226 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:30,226 INFO L146 ILogger]: Finished difference Result 91 states and 91 transitions. [2019-05-23 09:51:30,226 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:51:30,227 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 89 [2019-05-23 09:51:30,227 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:30,227 INFO L146 ILogger]: With dead ends: 91 [2019-05-23 09:51:30,227 INFO L146 ILogger]: Without dead ends: 91 [2019-05-23 09:51:30,228 INFO L146 ILogger]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:51:30,228 INFO L146 ILogger]: Start minimizeSevpa. Operand 91 states. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Start removeUnreachable. Operand 91 states. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-05-23 09:51:30,229 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Abstraction has 91 states and 91 transitions. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:51:30,229 INFO L146 ILogger]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-23 09:51:30,230 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 91 [2019-05-23 09:51:30,230 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:30,230 INFO L146 ILogger]: trace histogram [88, 1, 1] [2019-05-23 09:51:30,230 INFO L146 ILogger]: === Iteration 89 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:30,230 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:30,230 INFO L146 ILogger]: Analyzing trace with hash 1124182722, now seen corresponding path program 88 times [2019-05-23 09:51:30,231 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:30,272 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:30,276 INFO L146 ILogger]: Trace formula consists of 1061 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:51:30,277 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:32,847 INFO L146 ILogger]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:32,847 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:32,847 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:51:32,847 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:51:32,848 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:51:32,848 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:51:32,848 INFO L146 ILogger]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2019-05-23 09:51:32,971 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:32,971 INFO L146 ILogger]: Finished difference Result 92 states and 92 transitions. [2019-05-23 09:51:32,972 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:51:32,972 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 90 [2019-05-23 09:51:32,972 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:32,972 INFO L146 ILogger]: With dead ends: 92 [2019-05-23 09:51:32,972 INFO L146 ILogger]: Without dead ends: 92 [2019-05-23 09:51:32,973 INFO L146 ILogger]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:51:32,973 INFO L146 ILogger]: Start minimizeSevpa. Operand 92 states. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Start removeUnreachable. Operand 92 states. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-05-23 09:51:32,974 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Abstraction has 92 states and 92 transitions. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:51:32,974 INFO L146 ILogger]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-23 09:51:32,975 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 92 [2019-05-23 09:51:32,975 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:32,975 INFO L146 ILogger]: trace histogram [89, 1, 1] [2019-05-23 09:51:32,975 INFO L146 ILogger]: === Iteration 90 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:32,975 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:32,975 INFO L146 ILogger]: Analyzing trace with hash 489926054, now seen corresponding path program 89 times [2019-05-23 09:51:32,976 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:33,008 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:33,012 INFO L146 ILogger]: Trace formula consists of 1073 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 09:51:33,013 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:35,677 INFO L146 ILogger]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:35,678 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:35,678 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:51:35,678 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:51:35,679 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:51:35,679 INFO L146 ILogger]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:51:35,679 INFO L146 ILogger]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2019-05-23 09:51:36,527 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:36,527 INFO L146 ILogger]: Finished difference Result 93 states and 93 transitions. [2019-05-23 09:51:36,528 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:51:36,528 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 91 [2019-05-23 09:51:36,528 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:36,529 INFO L146 ILogger]: With dead ends: 93 [2019-05-23 09:51:36,529 INFO L146 ILogger]: Without dead ends: 93 [2019-05-23 09:51:36,530 INFO L146 ILogger]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:51:36,530 INFO L146 ILogger]: Start minimizeSevpa. Operand 93 states. [2019-05-23 09:51:36,532 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-05-23 09:51:36,532 INFO L146 ILogger]: Start removeUnreachable. Operand 93 states. [2019-05-23 09:51:36,532 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-23 09:51:36,532 INFO L146 ILogger]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-05-23 09:51:36,533 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:36,533 INFO L146 ILogger]: Abstraction has 93 states and 93 transitions. [2019-05-23 09:51:36,533 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:51:36,533 INFO L146 ILogger]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-23 09:51:36,534 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 09:51:36,534 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:36,534 INFO L146 ILogger]: trace histogram [90, 1, 1] [2019-05-23 09:51:36,534 INFO L146 ILogger]: === Iteration 91 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:36,535 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:36,535 INFO L146 ILogger]: Analyzing trace with hash -1992161470, now seen corresponding path program 90 times [2019-05-23 09:51:36,536 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:36,613 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:36,624 INFO L146 ILogger]: Trace formula consists of 1085 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:51:36,626 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:39,734 INFO L146 ILogger]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:39,735 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:39,735 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:51:39,735 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:51:39,735 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:51:39,736 INFO L146 ILogger]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:51:39,736 INFO L146 ILogger]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2019-05-23 09:51:39,931 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:39,931 INFO L146 ILogger]: Finished difference Result 94 states and 94 transitions. [2019-05-23 09:51:39,931 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:51:39,932 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 92 [2019-05-23 09:51:39,932 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:39,932 INFO L146 ILogger]: With dead ends: 94 [2019-05-23 09:51:39,932 INFO L146 ILogger]: Without dead ends: 94 [2019-05-23 09:51:39,933 INFO L146 ILogger]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:51:39,933 INFO L146 ILogger]: Start minimizeSevpa. Operand 94 states. [2019-05-23 09:51:39,935 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-05-23 09:51:39,935 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:51:39,935 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-05-23 09:51:39,935 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-05-23 09:51:39,935 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:39,936 INFO L146 ILogger]: Abstraction has 94 states and 94 transitions. [2019-05-23 09:51:39,936 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:51:39,936 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-23 09:51:39,936 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 09:51:39,936 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:39,936 INFO L146 ILogger]: trace histogram [91, 1, 1] [2019-05-23 09:51:39,936 INFO L146 ILogger]: === Iteration 92 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:39,936 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:39,937 INFO L146 ILogger]: Analyzing trace with hash -1627463386, now seen corresponding path program 91 times [2019-05-23 09:51:39,937 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:39,969 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:39,974 INFO L146 ILogger]: Trace formula consists of 1097 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:51:39,975 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:42,726 INFO L146 ILogger]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:42,726 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:42,727 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:51:42,727 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:51:42,727 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:51:42,728 INFO L146 ILogger]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:51:42,728 INFO L146 ILogger]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2019-05-23 09:51:42,861 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:42,862 INFO L146 ILogger]: Finished difference Result 95 states and 95 transitions. [2019-05-23 09:51:42,862 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:51:42,862 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 93 [2019-05-23 09:51:42,862 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:42,863 INFO L146 ILogger]: With dead ends: 95 [2019-05-23 09:51:42,863 INFO L146 ILogger]: Without dead ends: 95 [2019-05-23 09:51:42,864 INFO L146 ILogger]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:51:42,864 INFO L146 ILogger]: Start minimizeSevpa. Operand 95 states. [2019-05-23 09:51:42,865 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-05-23 09:51:42,866 INFO L146 ILogger]: Start removeUnreachable. Operand 95 states. [2019-05-23 09:51:42,866 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-05-23 09:51:42,866 INFO L146 ILogger]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-05-23 09:51:42,866 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:42,866 INFO L146 ILogger]: Abstraction has 95 states and 95 transitions. [2019-05-23 09:51:42,866 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:51:42,867 INFO L146 ILogger]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-23 09:51:42,867 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 95 [2019-05-23 09:51:42,867 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:42,867 INFO L146 ILogger]: trace histogram [92, 1, 1] [2019-05-23 09:51:42,867 INFO L146 ILogger]: === Iteration 93 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:42,867 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:42,867 INFO L146 ILogger]: Analyzing trace with hash 1088242626, now seen corresponding path program 92 times [2019-05-23 09:51:42,868 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:42,902 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:42,908 INFO L146 ILogger]: Trace formula consists of 1109 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:51:42,909 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:45,752 INFO L146 ILogger]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:45,752 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:45,752 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:51:45,753 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:51:45,753 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:51:45,754 INFO L146 ILogger]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:51:45,754 INFO L146 ILogger]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2019-05-23 09:51:45,874 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:45,875 INFO L146 ILogger]: Finished difference Result 96 states and 96 transitions. [2019-05-23 09:51:45,875 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:51:45,875 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 94 [2019-05-23 09:51:45,875 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:45,876 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 09:51:45,876 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 09:51:45,877 INFO L146 ILogger]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:51:45,877 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 09:51:45,879 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-05-23 09:51:45,879 INFO L146 ILogger]: Start removeUnreachable. Operand 96 states. [2019-05-23 09:51:45,879 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-05-23 09:51:45,879 INFO L146 ILogger]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-05-23 09:51:45,879 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:45,879 INFO L146 ILogger]: Abstraction has 96 states and 96 transitions. [2019-05-23 09:51:45,880 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:51:45,880 INFO L146 ILogger]: Start isEmpty. Operand 96 states and 96 transitions. [2019-05-23 09:51:45,880 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 96 [2019-05-23 09:51:45,880 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:45,880 INFO L146 ILogger]: trace histogram [93, 1, 1] [2019-05-23 09:51:45,880 INFO L146 ILogger]: === Iteration 94 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:45,881 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:45,881 INFO L146 ILogger]: Analyzing trace with hash -624216922, now seen corresponding path program 93 times [2019-05-23 09:51:45,881 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:45,916 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:45,922 INFO L146 ILogger]: Trace formula consists of 1121 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 09:51:45,924 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:48,868 INFO L146 ILogger]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:48,869 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:48,869 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:51:48,869 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:51:48,870 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:51:48,870 INFO L146 ILogger]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:51:48,870 INFO L146 ILogger]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2019-05-23 09:51:49,001 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:49,001 INFO L146 ILogger]: Finished difference Result 97 states and 97 transitions. [2019-05-23 09:51:49,002 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:51:49,002 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 95 [2019-05-23 09:51:49,002 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:49,003 INFO L146 ILogger]: With dead ends: 97 [2019-05-23 09:51:49,003 INFO L146 ILogger]: Without dead ends: 97 [2019-05-23 09:51:49,003 INFO L146 ILogger]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:51:49,004 INFO L146 ILogger]: Start minimizeSevpa. Operand 97 states. [2019-05-23 09:51:49,005 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-05-23 09:51:49,005 INFO L146 ILogger]: Start removeUnreachable. Operand 97 states. [2019-05-23 09:51:49,005 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-05-23 09:51:49,005 INFO L146 ILogger]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-05-23 09:51:49,005 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:49,006 INFO L146 ILogger]: Abstraction has 97 states and 97 transitions. [2019-05-23 09:51:49,006 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:51:49,006 INFO L146 ILogger]: Start isEmpty. Operand 97 states and 97 transitions. [2019-05-23 09:51:49,006 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 97 [2019-05-23 09:51:49,006 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:49,007 INFO L146 ILogger]: trace histogram [94, 1, 1] [2019-05-23 09:51:49,007 INFO L146 ILogger]: === Iteration 95 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:49,007 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:49,007 INFO L146 ILogger]: Analyzing trace with hash 2124111938, now seen corresponding path program 94 times [2019-05-23 09:51:49,008 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:49,053 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:49,059 INFO L146 ILogger]: Trace formula consists of 1133 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:51:49,060 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:52,573 INFO L146 ILogger]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:52,574 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:52,574 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:51:52,574 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:51:52,575 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:51:52,575 INFO L146 ILogger]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:51:52,575 INFO L146 ILogger]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2019-05-23 09:51:52,697 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:52,697 INFO L146 ILogger]: Finished difference Result 98 states and 98 transitions. [2019-05-23 09:51:52,697 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:51:52,697 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 96 [2019-05-23 09:51:52,698 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:52,698 INFO L146 ILogger]: With dead ends: 98 [2019-05-23 09:51:52,698 INFO L146 ILogger]: Without dead ends: 98 [2019-05-23 09:51:52,699 INFO L146 ILogger]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:51:52,699 INFO L146 ILogger]: Start minimizeSevpa. Operand 98 states. [2019-05-23 09:51:52,700 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-05-23 09:51:52,700 INFO L146 ILogger]: Start removeUnreachable. Operand 98 states. [2019-05-23 09:51:52,701 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-05-23 09:51:52,701 INFO L146 ILogger]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-05-23 09:51:52,701 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:52,701 INFO L146 ILogger]: Abstraction has 98 states and 98 transitions. [2019-05-23 09:51:52,701 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:51:52,701 INFO L146 ILogger]: Start isEmpty. Operand 98 states and 98 transitions. [2019-05-23 09:51:52,702 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:51:52,702 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:52,702 INFO L146 ILogger]: trace histogram [95, 1, 1] [2019-05-23 09:51:52,702 INFO L146 ILogger]: === Iteration 96 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:52,702 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:52,702 INFO L146 ILogger]: Analyzing trace with hash 1422960678, now seen corresponding path program 95 times [2019-05-23 09:51:52,703 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:52,738 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:52,742 INFO L146 ILogger]: Trace formula consists of 1145 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 09:51:52,744 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:55,793 INFO L146 ILogger]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:55,794 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:55,794 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:51:55,794 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:51:55,795 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:51:55,795 INFO L146 ILogger]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:51:55,795 INFO L146 ILogger]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2019-05-23 09:51:55,928 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:55,929 INFO L146 ILogger]: Finished difference Result 99 states and 99 transitions. [2019-05-23 09:51:55,929 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:51:55,929 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 97 [2019-05-23 09:51:55,930 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:55,930 INFO L146 ILogger]: With dead ends: 99 [2019-05-23 09:51:55,930 INFO L146 ILogger]: Without dead ends: 99 [2019-05-23 09:51:55,931 INFO L146 ILogger]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:51:55,931 INFO L146 ILogger]: Start minimizeSevpa. Operand 99 states. [2019-05-23 09:51:55,932 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-05-23 09:51:55,932 INFO L146 ILogger]: Start removeUnreachable. Operand 99 states. [2019-05-23 09:51:55,933 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-05-23 09:51:55,933 INFO L146 ILogger]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-05-23 09:51:55,933 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:55,933 INFO L146 ILogger]: Abstraction has 99 states and 99 transitions. [2019-05-23 09:51:55,933 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:51:55,933 INFO L146 ILogger]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-23 09:51:55,934 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 09:51:55,934 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:55,934 INFO L146 ILogger]: trace histogram [96, 1, 1] [2019-05-23 09:51:55,934 INFO L146 ILogger]: === Iteration 97 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:55,934 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:55,934 INFO L146 ILogger]: Analyzing trace with hash 1162108098, now seen corresponding path program 96 times [2019-05-23 09:51:55,935 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:55,975 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:55,980 INFO L146 ILogger]: Trace formula consists of 1157 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:51:55,981 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:59,064 INFO L146 ILogger]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:59,065 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:59,065 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:51:59,065 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:51:59,066 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:51:59,066 INFO L146 ILogger]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:51:59,066 INFO L146 ILogger]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2019-05-23 09:51:59,215 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:59,215 INFO L146 ILogger]: Finished difference Result 100 states and 100 transitions. [2019-05-23 09:51:59,216 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:51:59,216 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 98 [2019-05-23 09:51:59,216 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:59,216 INFO L146 ILogger]: With dead ends: 100 [2019-05-23 09:51:59,216 INFO L146 ILogger]: Without dead ends: 100 [2019-05-23 09:51:59,217 INFO L146 ILogger]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:51:59,217 INFO L146 ILogger]: Start minimizeSevpa. Operand 100 states. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Start removeUnreachable. Operand 100 states. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-05-23 09:51:59,218 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Abstraction has 100 states and 100 transitions. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:51:59,218 INFO L146 ILogger]: Start isEmpty. Operand 100 states and 100 transitions. [2019-05-23 09:51:59,219 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 100 [2019-05-23 09:51:59,219 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:59,219 INFO L146 ILogger]: trace histogram [97, 1, 1] [2019-05-23 09:51:59,219 INFO L146 ILogger]: === Iteration 98 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:59,219 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:59,219 INFO L146 ILogger]: Analyzing trace with hash 1665612710, now seen corresponding path program 97 times [2019-05-23 09:51:59,220 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:59,256 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:59,260 INFO L146 ILogger]: Trace formula consists of 1169 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:51:59,262 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:02,402 INFO L146 ILogger]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:02,402 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:02,402 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:52:02,403 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:52:02,403 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:52:02,403 INFO L146 ILogger]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:52:02,404 INFO L146 ILogger]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2019-05-23 09:52:02,529 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:02,530 INFO L146 ILogger]: Finished difference Result 101 states and 101 transitions. [2019-05-23 09:52:02,530 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:52:02,530 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 99 [2019-05-23 09:52:02,530 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:02,531 INFO L146 ILogger]: With dead ends: 101 [2019-05-23 09:52:02,531 INFO L146 ILogger]: Without dead ends: 101 [2019-05-23 09:52:02,531 INFO L146 ILogger]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:52:02,531 INFO L146 ILogger]: Start minimizeSevpa. Operand 101 states. [2019-05-23 09:52:02,532 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-05-23 09:52:02,533 INFO L146 ILogger]: Start removeUnreachable. Operand 101 states. [2019-05-23 09:52:02,533 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-05-23 09:52:02,533 INFO L146 ILogger]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-05-23 09:52:02,533 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:02,533 INFO L146 ILogger]: Abstraction has 101 states and 101 transitions. [2019-05-23 09:52:02,533 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:52:02,533 INFO L146 ILogger]: Start isEmpty. Operand 101 states and 101 transitions. [2019-05-23 09:52:02,534 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 101 [2019-05-23 09:52:02,534 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:02,534 INFO L146 ILogger]: trace histogram [98, 1, 1] [2019-05-23 09:52:02,534 INFO L146 ILogger]: === Iteration 99 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:02,534 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:02,534 INFO L146 ILogger]: Analyzing trace with hash 94386498, now seen corresponding path program 98 times [2019-05-23 09:52:02,535 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:02,571 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:02,576 INFO L146 ILogger]: Trace formula consists of 1181 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:52:02,577 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:05,787 INFO L146 ILogger]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:05,788 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:05,788 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:52:05,788 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:52:05,789 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:52:05,789 INFO L146 ILogger]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:52:05,789 INFO L146 ILogger]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2019-05-23 09:52:06,071 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:06,071 INFO L146 ILogger]: Finished difference Result 102 states and 102 transitions. [2019-05-23 09:52:06,071 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 09:52:06,072 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 100 [2019-05-23 09:52:06,072 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:06,072 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 09:52:06,073 INFO L146 ILogger]: Without dead ends: 102 [2019-05-23 09:52:06,073 INFO L146 ILogger]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:52:06,074 INFO L146 ILogger]: Start minimizeSevpa. Operand 102 states. [2019-05-23 09:52:06,075 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-05-23 09:52:06,075 INFO L146 ILogger]: Start removeUnreachable. Operand 102 states. [2019-05-23 09:52:06,075 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-05-23 09:52:06,075 INFO L146 ILogger]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-05-23 09:52:06,075 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:06,075 INFO L146 ILogger]: Abstraction has 102 states and 102 transitions. [2019-05-23 09:52:06,075 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:52:06,076 INFO L146 ILogger]: Start isEmpty. Operand 102 states and 102 transitions. [2019-05-23 09:52:06,076 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 102 [2019-05-23 09:52:06,076 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:06,076 INFO L146 ILogger]: trace histogram [99, 1, 1] [2019-05-23 09:52:06,076 INFO L146 ILogger]: === Iteration 100 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:06,077 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:06,077 INFO L146 ILogger]: Analyzing trace with hash -1368985818, now seen corresponding path program 99 times [2019-05-23 09:52:06,077 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:06,136 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:06,144 INFO L146 ILogger]: Trace formula consists of 1193 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 09:52:06,146 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:09,431 INFO L146 ILogger]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:09,431 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:09,432 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:52:09,432 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:52:09,432 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:52:09,433 INFO L146 ILogger]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:52:09,433 INFO L146 ILogger]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2019-05-23 09:52:09,588 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:09,588 INFO L146 ILogger]: Finished difference Result 103 states and 103 transitions. [2019-05-23 09:52:09,588 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:52:09,589 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 101 [2019-05-23 09:52:09,589 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:09,589 INFO L146 ILogger]: With dead ends: 103 [2019-05-23 09:52:09,589 INFO L146 ILogger]: Without dead ends: 103 [2019-05-23 09:52:09,590 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:52:09,590 INFO L146 ILogger]: Start minimizeSevpa. Operand 103 states. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Start removeUnreachable. Operand 103 states. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-05-23 09:52:09,591 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Abstraction has 103 states and 103 transitions. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:52:09,591 INFO L146 ILogger]: Start isEmpty. Operand 103 states and 103 transitions. [2019-05-23 09:52:09,592 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 103 [2019-05-23 09:52:09,592 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:09,593 INFO L146 ILogger]: trace histogram [100, 1, 1] [2019-05-23 09:52:09,593 INFO L146 ILogger]: === Iteration 101 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:09,593 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:09,593 INFO L146 ILogger]: Analyzing trace with hash 511112642, now seen corresponding path program 100 times [2019-05-23 09:52:09,594 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:09,648 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:09,657 INFO L146 ILogger]: Trace formula consists of 1205 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:52:09,659 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:13,000 INFO L146 ILogger]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:13,000 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:13,000 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:52:13,000 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:52:13,001 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:52:13,001 INFO L146 ILogger]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:52:13,001 INFO L146 ILogger]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2019-05-23 09:52:13,133 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:13,133 INFO L146 ILogger]: Finished difference Result 104 states and 104 transitions. [2019-05-23 09:52:13,134 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 09:52:13,134 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 102 [2019-05-23 09:52:13,134 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:13,135 INFO L146 ILogger]: With dead ends: 104 [2019-05-23 09:52:13,135 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 09:52:13,136 INFO L146 ILogger]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:52:13,136 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 09:52:13,138 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-05-23 09:52:13,138 INFO L146 ILogger]: Start removeUnreachable. Operand 104 states. [2019-05-23 09:52:13,138 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-05-23 09:52:13,138 INFO L146 ILogger]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-05-23 09:52:13,138 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:13,138 INFO L146 ILogger]: Abstraction has 104 states and 104 transitions. [2019-05-23 09:52:13,138 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:52:13,139 INFO L146 ILogger]: Start isEmpty. Operand 104 states and 104 transitions. [2019-05-23 09:52:13,139 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 104 [2019-05-23 09:52:13,139 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:13,139 INFO L146 ILogger]: trace histogram [101, 1, 1] [2019-05-23 09:52:13,140 INFO L146 ILogger]: === Iteration 102 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:13,140 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:13,140 INFO L146 ILogger]: Analyzing trace with hash -1335377242, now seen corresponding path program 101 times [2019-05-23 09:52:13,140 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:13,184 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:13,193 INFO L146 ILogger]: Trace formula consists of 1217 conjuncts, 103 conjunts are in the unsatisfiable core [2019-05-23 09:52:13,194 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:16,581 INFO L146 ILogger]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:16,581 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:16,581 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-05-23 09:52:16,582 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 09:52:16,583 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 09:52:16,583 INFO L146 ILogger]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:52:16,583 INFO L146 ILogger]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2019-05-23 09:52:16,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:16,753 INFO L146 ILogger]: Finished difference Result 105 states and 105 transitions. [2019-05-23 09:52:16,753 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 09:52:16,753 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 103 [2019-05-23 09:52:16,753 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:16,754 INFO L146 ILogger]: With dead ends: 105 [2019-05-23 09:52:16,754 INFO L146 ILogger]: Without dead ends: 105 [2019-05-23 09:52:16,755 INFO L146 ILogger]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:52:16,755 INFO L146 ILogger]: Start minimizeSevpa. Operand 105 states. [2019-05-23 09:52:16,756 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-05-23 09:52:16,756 INFO L146 ILogger]: Start removeUnreachable. Operand 105 states. [2019-05-23 09:52:16,756 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-05-23 09:52:16,757 INFO L146 ILogger]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-05-23 09:52:16,757 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:16,757 INFO L146 ILogger]: Abstraction has 105 states and 105 transitions. [2019-05-23 09:52:16,757 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 09:52:16,757 INFO L146 ILogger]: Start isEmpty. Operand 105 states and 105 transitions. [2019-05-23 09:52:16,758 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 105 [2019-05-23 09:52:16,758 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:16,758 INFO L146 ILogger]: trace histogram [102, 1, 1] [2019-05-23 09:52:16,758 INFO L146 ILogger]: === Iteration 103 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:16,758 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:16,758 INFO L146 ILogger]: Analyzing trace with hash 1552978498, now seen corresponding path program 102 times [2019-05-23 09:52:16,759 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:16,809 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:16,818 INFO L146 ILogger]: Trace formula consists of 1229 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:52:16,819 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:20,324 INFO L146 ILogger]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:20,324 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:20,324 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:52:20,324 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:52:20,325 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:52:20,326 INFO L146 ILogger]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:52:20,326 INFO L146 ILogger]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2019-05-23 09:52:20,514 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:20,515 INFO L146 ILogger]: Finished difference Result 106 states and 106 transitions. [2019-05-23 09:52:20,515 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:52:20,515 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 104 [2019-05-23 09:52:20,515 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:20,516 INFO L146 ILogger]: With dead ends: 106 [2019-05-23 09:52:20,516 INFO L146 ILogger]: Without dead ends: 106 [2019-05-23 09:52:20,516 INFO L146 ILogger]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:52:20,517 INFO L146 ILogger]: Start minimizeSevpa. Operand 106 states. [2019-05-23 09:52:20,518 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-05-23 09:52:20,518 INFO L146 ILogger]: Start removeUnreachable. Operand 106 states. [2019-05-23 09:52:20,518 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-05-23 09:52:20,518 INFO L146 ILogger]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-05-23 09:52:20,518 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:20,518 INFO L146 ILogger]: Abstraction has 106 states and 106 transitions. [2019-05-23 09:52:20,519 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:52:20,519 INFO L146 ILogger]: Start isEmpty. Operand 106 states and 106 transitions. [2019-05-23 09:52:20,519 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 106 [2019-05-23 09:52:20,519 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:20,519 INFO L146 ILogger]: trace histogram [103, 1, 1] [2019-05-23 09:52:20,520 INFO L146 ILogger]: === Iteration 104 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:20,520 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:20,520 INFO L146 ILogger]: Analyzing trace with hash 897693222, now seen corresponding path program 103 times [2019-05-23 09:52:20,520 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:20,587 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:20,596 INFO L146 ILogger]: Trace formula consists of 1241 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:52:20,598 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:24,174 INFO L146 ILogger]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:24,174 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:24,174 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 09:52:24,175 INFO L146 ILogger]: Interpolant automaton has 106 states [2019-05-23 09:52:24,175 INFO L146 ILogger]: Constructing interpolant automaton starting with 106 interpolants. [2019-05-23 09:52:24,176 INFO L146 ILogger]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:52:24,176 INFO L146 ILogger]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2019-05-23 09:52:24,324 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:24,325 INFO L146 ILogger]: Finished difference Result 107 states and 107 transitions. [2019-05-23 09:52:24,325 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 09:52:24,325 INFO L146 ILogger]: Start accepts. Automaton has 106 states. Word has length 105 [2019-05-23 09:52:24,325 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:24,326 INFO L146 ILogger]: With dead ends: 107 [2019-05-23 09:52:24,326 INFO L146 ILogger]: Without dead ends: 107 [2019-05-23 09:52:24,326 INFO L146 ILogger]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:52:24,327 INFO L146 ILogger]: Start minimizeSevpa. Operand 107 states. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Start removeUnreachable. Operand 107 states. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-05-23 09:52:24,328 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Abstraction has 107 states and 107 transitions. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Interpolant automaton has 106 states. [2019-05-23 09:52:24,328 INFO L146 ILogger]: Start isEmpty. Operand 107 states and 107 transitions. [2019-05-23 09:52:24,329 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 107 [2019-05-23 09:52:24,329 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:24,329 INFO L146 ILogger]: trace histogram [104, 1, 1] [2019-05-23 09:52:24,329 INFO L146 ILogger]: === Iteration 105 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:24,330 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:24,330 INFO L146 ILogger]: Analyzing trace with hash 2058686146, now seen corresponding path program 104 times [2019-05-23 09:52:24,330 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:24,377 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:24,382 INFO L146 ILogger]: Trace formula consists of 1253 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:52:24,383 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:28,111 INFO L146 ILogger]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:28,112 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:28,112 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:52:28,112 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 09:52:28,113 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 09:52:28,113 INFO L146 ILogger]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:52:28,113 INFO L146 ILogger]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2019-05-23 09:52:28,292 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:28,292 INFO L146 ILogger]: Finished difference Result 108 states and 108 transitions. [2019-05-23 09:52:28,293 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-05-23 09:52:28,293 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 106 [2019-05-23 09:52:28,293 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:28,293 INFO L146 ILogger]: With dead ends: 108 [2019-05-23 09:52:28,293 INFO L146 ILogger]: Without dead ends: 108 [2019-05-23 09:52:28,294 INFO L146 ILogger]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:52:28,294 INFO L146 ILogger]: Start minimizeSevpa. Operand 108 states. [2019-05-23 09:52:28,295 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-05-23 09:52:28,295 INFO L146 ILogger]: Start removeUnreachable. Operand 108 states. [2019-05-23 09:52:28,295 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-05-23 09:52:28,295 INFO L146 ILogger]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-05-23 09:52:28,296 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:28,296 INFO L146 ILogger]: Abstraction has 108 states and 108 transitions. [2019-05-23 09:52:28,296 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 09:52:28,296 INFO L146 ILogger]: Start isEmpty. Operand 108 states and 108 transitions. [2019-05-23 09:52:28,296 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 108 [2019-05-23 09:52:28,296 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:28,296 INFO L146 ILogger]: trace histogram [105, 1, 1] [2019-05-23 09:52:28,297 INFO L146 ILogger]: === Iteration 106 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:28,297 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:28,297 INFO L146 ILogger]: Analyzing trace with hash -605238874, now seen corresponding path program 105 times [2019-05-23 09:52:28,298 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:28,340 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:28,345 INFO L146 ILogger]: Trace formula consists of 1265 conjuncts, 107 conjunts are in the unsatisfiable core [2019-05-23 09:52:28,346 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:32,475 INFO L146 ILogger]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:32,476 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:32,476 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-05-23 09:52:32,476 INFO L146 ILogger]: Interpolant automaton has 108 states [2019-05-23 09:52:32,477 INFO L146 ILogger]: Constructing interpolant automaton starting with 108 interpolants. [2019-05-23 09:52:32,477 INFO L146 ILogger]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:52:32,477 INFO L146 ILogger]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2019-05-23 09:52:32,628 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:32,628 INFO L146 ILogger]: Finished difference Result 109 states and 109 transitions. [2019-05-23 09:52:32,629 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:52:32,629 INFO L146 ILogger]: Start accepts. Automaton has 108 states. Word has length 107 [2019-05-23 09:52:32,629 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:32,629 INFO L146 ILogger]: With dead ends: 109 [2019-05-23 09:52:32,629 INFO L146 ILogger]: Without dead ends: 109 [2019-05-23 09:52:32,630 INFO L146 ILogger]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:52:32,630 INFO L146 ILogger]: Start minimizeSevpa. Operand 109 states. [2019-05-23 09:52:32,631 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-05-23 09:52:32,631 INFO L146 ILogger]: Start removeUnreachable. Operand 109 states. [2019-05-23 09:52:32,631 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-05-23 09:52:32,631 INFO L146 ILogger]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-05-23 09:52:32,632 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:32,632 INFO L146 ILogger]: Abstraction has 109 states and 109 transitions. [2019-05-23 09:52:32,632 INFO L146 ILogger]: Interpolant automaton has 108 states. [2019-05-23 09:52:32,632 INFO L146 ILogger]: Start isEmpty. Operand 109 states and 109 transitions. [2019-05-23 09:52:32,632 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 109 [2019-05-23 09:52:32,632 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:32,632 INFO L146 ILogger]: trace histogram [106, 1, 1] [2019-05-23 09:52:32,632 INFO L146 ILogger]: === Iteration 107 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:32,632 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:32,633 INFO L146 ILogger]: Analyzing trace with hash -1582535870, now seen corresponding path program 106 times [2019-05-23 09:52:32,633 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:32,674 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:32,679 INFO L146 ILogger]: Trace formula consists of 1277 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:52:32,681 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:36,392 INFO L146 ILogger]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:36,392 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:36,392 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:52:36,393 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 09:52:36,393 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 09:52:36,394 INFO L146 ILogger]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:52:36,394 INFO L146 ILogger]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2019-05-23 09:52:36,584 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:36,584 INFO L146 ILogger]: Finished difference Result 110 states and 110 transitions. [2019-05-23 09:52:36,584 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-05-23 09:52:36,584 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 108 [2019-05-23 09:52:36,584 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:36,585 INFO L146 ILogger]: With dead ends: 110 [2019-05-23 09:52:36,585 INFO L146 ILogger]: Without dead ends: 110 [2019-05-23 09:52:36,585 INFO L146 ILogger]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:52:36,585 INFO L146 ILogger]: Start minimizeSevpa. Operand 110 states. [2019-05-23 09:52:36,586 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-05-23 09:52:36,586 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 09:52:36,587 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-05-23 09:52:36,587 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-05-23 09:52:36,587 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:36,587 INFO L146 ILogger]: Abstraction has 110 states and 110 transitions. [2019-05-23 09:52:36,587 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 09:52:36,587 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 110 transitions. [2019-05-23 09:52:36,588 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 09:52:36,588 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:36,588 INFO L146 ILogger]: trace histogram [107, 1, 1] [2019-05-23 09:52:36,589 INFO L146 ILogger]: === Iteration 108 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:36,589 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:36,589 INFO L146 ILogger]: Analyzing trace with hash -1813971674, now seen corresponding path program 107 times [2019-05-23 09:52:36,589 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:36,631 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:36,637 INFO L146 ILogger]: Trace formula consists of 1289 conjuncts, 109 conjunts are in the unsatisfiable core [2019-05-23 09:52:36,638 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:40,439 INFO L146 ILogger]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:40,439 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:40,439 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-05-23 09:52:40,439 INFO L146 ILogger]: Interpolant automaton has 110 states [2019-05-23 09:52:40,440 INFO L146 ILogger]: Constructing interpolant automaton starting with 110 interpolants. [2019-05-23 09:52:40,440 INFO L146 ILogger]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:52:40,441 INFO L146 ILogger]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2019-05-23 09:52:40,607 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:40,607 INFO L146 ILogger]: Finished difference Result 111 states and 111 transitions. [2019-05-23 09:52:40,607 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-05-23 09:52:40,608 INFO L146 ILogger]: Start accepts. Automaton has 110 states. Word has length 109 [2019-05-23 09:52:40,608 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:40,608 INFO L146 ILogger]: With dead ends: 111 [2019-05-23 09:52:40,608 INFO L146 ILogger]: Without dead ends: 111 [2019-05-23 09:52:40,609 INFO L146 ILogger]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:52:40,609 INFO L146 ILogger]: Start minimizeSevpa. Operand 111 states. [2019-05-23 09:52:40,611 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-05-23 09:52:40,611 INFO L146 ILogger]: Start removeUnreachable. Operand 111 states. [2019-05-23 09:52:40,611 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-05-23 09:52:40,611 INFO L146 ILogger]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-05-23 09:52:40,612 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:40,612 INFO L146 ILogger]: Abstraction has 111 states and 111 transitions. [2019-05-23 09:52:40,612 INFO L146 ILogger]: Interpolant automaton has 110 states. [2019-05-23 09:52:40,612 INFO L146 ILogger]: Start isEmpty. Operand 111 states and 111 transitions. [2019-05-23 09:52:40,612 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 111 [2019-05-23 09:52:40,612 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:40,613 INFO L146 ILogger]: trace histogram [108, 1, 1] [2019-05-23 09:52:40,613 INFO L146 ILogger]: === Iteration 109 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:40,613 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:40,613 INFO L146 ILogger]: Analyzing trace with hash -398547006, now seen corresponding path program 108 times [2019-05-23 09:52:40,613 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:40,655 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:40,661 INFO L146 ILogger]: Trace formula consists of 1301 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:52:40,662 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:44,539 INFO L146 ILogger]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:44,539 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:44,540 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:52:44,540 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 09:52:44,541 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 09:52:44,541 INFO L146 ILogger]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:52:44,541 INFO L146 ILogger]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2019-05-23 09:52:44,698 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:44,699 INFO L146 ILogger]: Finished difference Result 112 states and 112 transitions. [2019-05-23 09:52:44,699 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 09:52:44,699 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 110 [2019-05-23 09:52:44,699 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:44,700 INFO L146 ILogger]: With dead ends: 112 [2019-05-23 09:52:44,700 INFO L146 ILogger]: Without dead ends: 112 [2019-05-23 09:52:44,700 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:52:44,701 INFO L146 ILogger]: Start minimizeSevpa. Operand 112 states. [2019-05-23 09:52:44,702 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-05-23 09:52:44,702 INFO L146 ILogger]: Start removeUnreachable. Operand 112 states. [2019-05-23 09:52:44,702 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-05-23 09:52:44,702 INFO L146 ILogger]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-05-23 09:52:44,703 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:44,703 INFO L146 ILogger]: Abstraction has 112 states and 112 transitions. [2019-05-23 09:52:44,703 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 09:52:44,703 INFO L146 ILogger]: Start isEmpty. Operand 112 states and 112 transitions. [2019-05-23 09:52:44,703 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 112 [2019-05-23 09:52:44,703 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:44,704 INFO L146 ILogger]: trace histogram [109, 1, 1] [2019-05-23 09:52:44,704 INFO L146 ILogger]: === Iteration 110 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:44,704 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:44,704 INFO L146 ILogger]: Analyzing trace with hash 529944742, now seen corresponding path program 109 times [2019-05-23 09:52:44,705 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:44,751 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:44,757 INFO L146 ILogger]: Trace formula consists of 1313 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 09:52:44,759 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:48,754 INFO L146 ILogger]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:48,755 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:48,755 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-05-23 09:52:48,755 INFO L146 ILogger]: Interpolant automaton has 112 states [2019-05-23 09:52:48,756 INFO L146 ILogger]: Constructing interpolant automaton starting with 112 interpolants. [2019-05-23 09:52:48,756 INFO L146 ILogger]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:52:48,756 INFO L146 ILogger]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2019-05-23 09:52:48,929 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:48,929 INFO L146 ILogger]: Finished difference Result 113 states and 113 transitions. [2019-05-23 09:52:48,930 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 09:52:48,930 INFO L146 ILogger]: Start accepts. Automaton has 112 states. Word has length 111 [2019-05-23 09:52:48,930 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:48,930 INFO L146 ILogger]: With dead ends: 113 [2019-05-23 09:52:48,930 INFO L146 ILogger]: Without dead ends: 113 [2019-05-23 09:52:48,931 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:52:48,931 INFO L146 ILogger]: Start minimizeSevpa. Operand 113 states. [2019-05-23 09:52:48,932 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-05-23 09:52:48,932 INFO L146 ILogger]: Start removeUnreachable. Operand 113 states. [2019-05-23 09:52:48,932 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-05-23 09:52:48,932 INFO L146 ILogger]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-05-23 09:52:48,932 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:48,932 INFO L146 ILogger]: Abstraction has 113 states and 113 transitions. [2019-05-23 09:52:48,933 INFO L146 ILogger]: Interpolant automaton has 112 states. [2019-05-23 09:52:48,933 INFO L146 ILogger]: Start isEmpty. Operand 113 states and 113 transitions. [2019-05-23 09:52:48,933 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 113 [2019-05-23 09:52:48,933 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:48,933 INFO L146 ILogger]: trace histogram [110, 1, 1] [2019-05-23 09:52:48,934 INFO L146 ILogger]: === Iteration 111 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:48,934 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:48,934 INFO L146 ILogger]: Analyzing trace with hash -751582142, now seen corresponding path program 110 times [2019-05-23 09:52:48,935 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:48,979 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:48,987 INFO L146 ILogger]: Trace formula consists of 1325 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:52:48,989 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:52,937 INFO L146 ILogger]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:52,937 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:52,937 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:52:52,937 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 09:52:52,938 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 09:52:52,938 INFO L146 ILogger]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:52:52,939 INFO L146 ILogger]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2019-05-23 09:52:53,099 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:53,099 INFO L146 ILogger]: Finished difference Result 114 states and 114 transitions. [2019-05-23 09:52:53,099 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-05-23 09:52:53,100 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 112 [2019-05-23 09:52:53,100 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:53,100 INFO L146 ILogger]: With dead ends: 114 [2019-05-23 09:52:53,100 INFO L146 ILogger]: Without dead ends: 114 [2019-05-23 09:52:53,101 INFO L146 ILogger]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:52:53,102 INFO L146 ILogger]: Start minimizeSevpa. Operand 114 states. [2019-05-23 09:52:53,103 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-05-23 09:52:53,103 INFO L146 ILogger]: Start removeUnreachable. Operand 114 states. [2019-05-23 09:52:53,104 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-05-23 09:52:53,104 INFO L146 ILogger]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-05-23 09:52:53,104 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:53,104 INFO L146 ILogger]: Abstraction has 114 states and 114 transitions. [2019-05-23 09:52:53,104 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 09:52:53,104 INFO L146 ILogger]: Start isEmpty. Operand 114 states and 114 transitions. [2019-05-23 09:52:53,105 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 114 [2019-05-23 09:52:53,105 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:53,105 INFO L146 ILogger]: trace histogram [111, 1, 1] [2019-05-23 09:52:53,105 INFO L146 ILogger]: === Iteration 112 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:53,106 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:53,106 INFO L146 ILogger]: Analyzing trace with hash -1824209882, now seen corresponding path program 111 times [2019-05-23 09:52:53,106 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:53,160 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:53,166 INFO L146 ILogger]: Trace formula consists of 1337 conjuncts, 113 conjunts are in the unsatisfiable core [2019-05-23 09:52:53,167 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:57,286 INFO L146 ILogger]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:57,286 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:57,286 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-05-23 09:52:57,286 INFO L146 ILogger]: Interpolant automaton has 114 states [2019-05-23 09:52:57,287 INFO L146 ILogger]: Constructing interpolant automaton starting with 114 interpolants. [2019-05-23 09:52:57,287 INFO L146 ILogger]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:52:57,288 INFO L146 ILogger]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2019-05-23 09:52:57,486 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:57,486 INFO L146 ILogger]: Finished difference Result 115 states and 115 transitions. [2019-05-23 09:52:57,486 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:52:57,486 INFO L146 ILogger]: Start accepts. Automaton has 114 states. Word has length 113 [2019-05-23 09:52:57,486 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:57,487 INFO L146 ILogger]: With dead ends: 115 [2019-05-23 09:52:57,487 INFO L146 ILogger]: Without dead ends: 115 [2019-05-23 09:52:57,487 INFO L146 ILogger]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:52:57,487 INFO L146 ILogger]: Start minimizeSevpa. Operand 115 states. [2019-05-23 09:52:57,488 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-05-23 09:52:57,488 INFO L146 ILogger]: Start removeUnreachable. Operand 115 states. [2019-05-23 09:52:57,488 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-05-23 09:52:57,489 INFO L146 ILogger]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-05-23 09:52:57,489 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:57,489 INFO L146 ILogger]: Abstraction has 115 states and 115 transitions. [2019-05-23 09:52:57,489 INFO L146 ILogger]: Interpolant automaton has 114 states. [2019-05-23 09:52:57,489 INFO L146 ILogger]: Start isEmpty. Operand 115 states and 115 transitions. [2019-05-23 09:52:57,489 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 115 [2019-05-23 09:52:57,489 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:57,490 INFO L146 ILogger]: trace histogram [112, 1, 1] [2019-05-23 09:52:57,490 INFO L146 ILogger]: === Iteration 113 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:57,490 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:57,490 INFO L146 ILogger]: Analyzing trace with hash -715931454, now seen corresponding path program 112 times [2019-05-23 09:52:57,491 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:57,540 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:57,546 INFO L146 ILogger]: Trace formula consists of 1349 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:52:57,547 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:01,725 INFO L146 ILogger]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:01,726 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:01,726 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:53:01,726 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 09:53:01,727 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 09:53:01,727 INFO L146 ILogger]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:53:01,727 INFO L146 ILogger]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2019-05-23 09:53:01,905 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:01,905 INFO L146 ILogger]: Finished difference Result 116 states and 116 transitions. [2019-05-23 09:53:01,906 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-05-23 09:53:01,906 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 114 [2019-05-23 09:53:01,906 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:01,906 INFO L146 ILogger]: With dead ends: 116 [2019-05-23 09:53:01,907 INFO L146 ILogger]: Without dead ends: 116 [2019-05-23 09:53:01,907 INFO L146 ILogger]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:53:01,907 INFO L146 ILogger]: Start minimizeSevpa. Operand 116 states. [2019-05-23 09:53:01,908 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-05-23 09:53:01,908 INFO L146 ILogger]: Start removeUnreachable. Operand 116 states. [2019-05-23 09:53:01,908 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-05-23 09:53:01,908 INFO L146 ILogger]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-05-23 09:53:01,908 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:01,908 INFO L146 ILogger]: Abstraction has 116 states and 116 transitions. [2019-05-23 09:53:01,908 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 09:53:01,909 INFO L146 ILogger]: Start isEmpty. Operand 116 states and 116 transitions. [2019-05-23 09:53:01,909 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 116 [2019-05-23 09:53:01,909 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:01,909 INFO L146 ILogger]: trace histogram [113, 1, 1] [2019-05-23 09:53:01,909 INFO L146 ILogger]: === Iteration 114 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:01,909 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:01,910 INFO L146 ILogger]: Analyzing trace with hash -719038554, now seen corresponding path program 113 times [2019-05-23 09:53:01,910 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:01,977 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:01,983 INFO L146 ILogger]: Trace formula consists of 1361 conjuncts, 115 conjunts are in the unsatisfiable core [2019-05-23 09:53:01,985 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:06,160 INFO L146 ILogger]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:06,160 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:06,160 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-05-23 09:53:06,160 INFO L146 ILogger]: Interpolant automaton has 116 states [2019-05-23 09:53:06,161 INFO L146 ILogger]: Constructing interpolant automaton starting with 116 interpolants. [2019-05-23 09:53:06,162 INFO L146 ILogger]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:53:06,162 INFO L146 ILogger]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2019-05-23 09:53:06,319 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:06,319 INFO L146 ILogger]: Finished difference Result 117 states and 117 transitions. [2019-05-23 09:53:06,320 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-05-23 09:53:06,320 INFO L146 ILogger]: Start accepts. Automaton has 116 states. Word has length 115 [2019-05-23 09:53:06,320 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:06,320 INFO L146 ILogger]: With dead ends: 117 [2019-05-23 09:53:06,320 INFO L146 ILogger]: Without dead ends: 117 [2019-05-23 09:53:06,321 INFO L146 ILogger]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:53:06,321 INFO L146 ILogger]: Start minimizeSevpa. Operand 117 states. [2019-05-23 09:53:06,322 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-05-23 09:53:06,322 INFO L146 ILogger]: Start removeUnreachable. Operand 117 states. [2019-05-23 09:53:06,323 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-05-23 09:53:06,323 INFO L146 ILogger]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-05-23 09:53:06,323 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:06,323 INFO L146 ILogger]: Abstraction has 117 states and 117 transitions. [2019-05-23 09:53:06,323 INFO L146 ILogger]: Interpolant automaton has 116 states. [2019-05-23 09:53:06,323 INFO L146 ILogger]: Start isEmpty. Operand 117 states and 117 transitions. [2019-05-23 09:53:06,324 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 117 [2019-05-23 09:53:06,324 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:06,324 INFO L146 ILogger]: trace histogram [114, 1, 1] [2019-05-23 09:53:06,324 INFO L146 ILogger]: === Iteration 115 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:06,324 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:06,324 INFO L146 ILogger]: Analyzing trace with hash -815358654, now seen corresponding path program 114 times [2019-05-23 09:53:06,325 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:06,376 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:06,382 INFO L146 ILogger]: Trace formula consists of 1373 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:53:06,383 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:10,713 INFO L146 ILogger]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:10,713 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:10,713 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:53:10,714 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 09:53:10,714 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 09:53:10,715 INFO L146 ILogger]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:53:10,715 INFO L146 ILogger]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2019-05-23 09:53:10,894 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:10,894 INFO L146 ILogger]: Finished difference Result 118 states and 118 transitions. [2019-05-23 09:53:10,895 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 09:53:10,895 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 116 [2019-05-23 09:53:10,895 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:10,895 INFO L146 ILogger]: With dead ends: 118 [2019-05-23 09:53:10,895 INFO L146 ILogger]: Without dead ends: 118 [2019-05-23 09:53:10,896 INFO L146 ILogger]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:53:10,896 INFO L146 ILogger]: Start minimizeSevpa. Operand 118 states. [2019-05-23 09:53:10,898 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-05-23 09:53:10,898 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 09:53:10,898 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-05-23 09:53:10,898 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-05-23 09:53:10,899 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:10,899 INFO L146 ILogger]: Abstraction has 118 states and 118 transitions. [2019-05-23 09:53:10,899 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 09:53:10,899 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 118 transitions. [2019-05-23 09:53:10,899 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 09:53:10,899 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:10,900 INFO L146 ILogger]: trace histogram [115, 1, 1] [2019-05-23 09:53:10,900 INFO L146 ILogger]: === Iteration 116 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:10,900 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:10,900 INFO L146 ILogger]: Analyzing trace with hash 493685542, now seen corresponding path program 115 times [2019-05-23 09:53:10,900 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:10,948 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:10,954 INFO L146 ILogger]: Trace formula consists of 1385 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 09:53:10,955 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:15,300 INFO L146 ILogger]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:15,301 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:15,301 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-05-23 09:53:15,301 INFO L146 ILogger]: Interpolant automaton has 118 states [2019-05-23 09:53:15,302 INFO L146 ILogger]: Constructing interpolant automaton starting with 118 interpolants. [2019-05-23 09:53:15,302 INFO L146 ILogger]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:53:15,302 INFO L146 ILogger]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2019-05-23 09:53:15,508 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:15,508 INFO L146 ILogger]: Finished difference Result 119 states and 119 transitions. [2019-05-23 09:53:15,508 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 09:53:15,508 INFO L146 ILogger]: Start accepts. Automaton has 118 states. Word has length 117 [2019-05-23 09:53:15,509 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:15,509 INFO L146 ILogger]: With dead ends: 119 [2019-05-23 09:53:15,509 INFO L146 ILogger]: Without dead ends: 119 [2019-05-23 09:53:15,509 INFO L146 ILogger]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:53:15,510 INFO L146 ILogger]: Start minimizeSevpa. Operand 119 states. [2019-05-23 09:53:15,510 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-05-23 09:53:15,511 INFO L146 ILogger]: Start removeUnreachable. Operand 119 states. [2019-05-23 09:53:15,511 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-05-23 09:53:15,511 INFO L146 ILogger]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-05-23 09:53:15,511 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:15,511 INFO L146 ILogger]: Abstraction has 119 states and 119 transitions. [2019-05-23 09:53:15,511 INFO L146 ILogger]: Interpolant automaton has 118 states. [2019-05-23 09:53:15,512 INFO L146 ILogger]: Start isEmpty. Operand 119 states and 119 transitions. [2019-05-23 09:53:15,512 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 119 [2019-05-23 09:53:15,512 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:15,512 INFO L146 ILogger]: trace histogram [116, 1, 1] [2019-05-23 09:53:15,513 INFO L146 ILogger]: === Iteration 117 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:15,513 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:15,513 INFO L146 ILogger]: Analyzing trace with hash -1875617342, now seen corresponding path program 116 times [2019-05-23 09:53:15,513 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:15,562 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:15,569 INFO L146 ILogger]: Trace formula consists of 1397 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:53:15,570 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:19,997 INFO L146 ILogger]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:19,997 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:19,998 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:53:19,998 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 09:53:19,999 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 09:53:19,999 INFO L146 ILogger]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:53:19,999 INFO L146 ILogger]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2019-05-23 09:53:20,173 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:20,173 INFO L146 ILogger]: Finished difference Result 120 states and 120 transitions. [2019-05-23 09:53:20,173 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-05-23 09:53:20,173 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 118 [2019-05-23 09:53:20,174 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:20,174 INFO L146 ILogger]: With dead ends: 120 [2019-05-23 09:53:20,174 INFO L146 ILogger]: Without dead ends: 120 [2019-05-23 09:53:20,175 INFO L146 ILogger]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:53:20,175 INFO L146 ILogger]: Start minimizeSevpa. Operand 120 states. [2019-05-23 09:53:20,175 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-05-23 09:53:20,175 INFO L146 ILogger]: Start removeUnreachable. Operand 120 states. [2019-05-23 09:53:20,176 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-05-23 09:53:20,176 INFO L146 ILogger]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-05-23 09:53:20,176 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:20,176 INFO L146 ILogger]: Abstraction has 120 states and 120 transitions. [2019-05-23 09:53:20,176 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 09:53:20,176 INFO L146 ILogger]: Start isEmpty. Operand 120 states and 120 transitions. [2019-05-23 09:53:20,176 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 120 [2019-05-23 09:53:20,176 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:20,177 INFO L146 ILogger]: trace histogram [117, 1, 1] [2019-05-23 09:53:20,177 INFO L146 ILogger]: === Iteration 118 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:20,177 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:20,177 INFO L146 ILogger]: Analyzing trace with hash 1985404582, now seen corresponding path program 117 times [2019-05-23 09:53:20,177 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:20,227 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:20,234 INFO L146 ILogger]: Trace formula consists of 1409 conjuncts, 119 conjunts are in the unsatisfiable core [2019-05-23 09:53:20,235 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:24,701 INFO L146 ILogger]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:24,701 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:24,702 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-05-23 09:53:24,702 INFO L146 ILogger]: Interpolant automaton has 120 states [2019-05-23 09:53:24,706 INFO L146 ILogger]: Constructing interpolant automaton starting with 120 interpolants. [2019-05-23 09:53:24,707 INFO L146 ILogger]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:53:24,707 INFO L146 ILogger]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2019-05-23 09:53:24,882 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:24,882 INFO L146 ILogger]: Finished difference Result 121 states and 121 transitions. [2019-05-23 09:53:24,883 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:53:24,883 INFO L146 ILogger]: Start accepts. Automaton has 120 states. Word has length 119 [2019-05-23 09:53:24,883 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:24,883 INFO L146 ILogger]: With dead ends: 121 [2019-05-23 09:53:24,883 INFO L146 ILogger]: Without dead ends: 121 [2019-05-23 09:53:24,884 INFO L146 ILogger]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:53:24,884 INFO L146 ILogger]: Start minimizeSevpa. Operand 121 states. [2019-05-23 09:53:24,885 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-05-23 09:53:24,885 INFO L146 ILogger]: Start removeUnreachable. Operand 121 states. [2019-05-23 09:53:24,885 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-05-23 09:53:24,885 INFO L146 ILogger]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-05-23 09:53:24,885 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:24,886 INFO L146 ILogger]: Abstraction has 121 states and 121 transitions. [2019-05-23 09:53:24,886 INFO L146 ILogger]: Interpolant automaton has 120 states. [2019-05-23 09:53:24,886 INFO L146 ILogger]: Start isEmpty. Operand 121 states and 121 transitions. [2019-05-23 09:53:24,886 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 121 [2019-05-23 09:53:24,886 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:24,887 INFO L146 ILogger]: trace histogram [118, 1, 1] [2019-05-23 09:53:24,887 INFO L146 ILogger]: === Iteration 119 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:24,887 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:24,887 INFO L146 ILogger]: Analyzing trace with hash 1417999938, now seen corresponding path program 118 times [2019-05-23 09:53:24,888 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:24,940 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:24,946 INFO L146 ILogger]: Trace formula consists of 1421 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:53:24,948 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:29,572 INFO L146 ILogger]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:29,572 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:29,572 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:53:29,572 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 09:53:29,573 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 09:53:29,573 INFO L146 ILogger]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:53:29,573 INFO L146 ILogger]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2019-05-23 09:53:29,758 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:29,758 INFO L146 ILogger]: Finished difference Result 122 states and 122 transitions. [2019-05-23 09:53:29,759 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-05-23 09:53:29,759 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 120 [2019-05-23 09:53:29,759 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:29,759 INFO L146 ILogger]: With dead ends: 122 [2019-05-23 09:53:29,759 INFO L146 ILogger]: Without dead ends: 122 [2019-05-23 09:53:29,760 INFO L146 ILogger]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:53:29,760 INFO L146 ILogger]: Start minimizeSevpa. Operand 122 states. [2019-05-23 09:53:29,761 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-05-23 09:53:29,761 INFO L146 ILogger]: Start removeUnreachable. Operand 122 states. [2019-05-23 09:53:29,761 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-05-23 09:53:29,761 INFO L146 ILogger]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-05-23 09:53:29,761 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:29,762 INFO L146 ILogger]: Abstraction has 122 states and 122 transitions. [2019-05-23 09:53:29,762 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 09:53:29,762 INFO L146 ILogger]: Start isEmpty. Operand 122 states and 122 transitions. [2019-05-23 09:53:29,762 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 122 [2019-05-23 09:53:29,762 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:29,762 INFO L146 ILogger]: trace histogram [119, 1, 1] [2019-05-23 09:53:29,763 INFO L146 ILogger]: === Iteration 120 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:29,763 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:29,763 INFO L146 ILogger]: Analyzing trace with hash 1008325158, now seen corresponding path program 119 times [2019-05-23 09:53:29,763 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:29,813 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:29,822 INFO L146 ILogger]: Trace formula consists of 1433 conjuncts, 121 conjunts are in the unsatisfiable core [2019-05-23 09:53:29,823 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:34,486 INFO L146 ILogger]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:34,486 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:34,486 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-05-23 09:53:34,486 INFO L146 ILogger]: Interpolant automaton has 122 states [2019-05-23 09:53:34,487 INFO L146 ILogger]: Constructing interpolant automaton starting with 122 interpolants. [2019-05-23 09:53:34,488 INFO L146 ILogger]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:53:34,488 INFO L146 ILogger]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2019-05-23 09:53:34,739 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:34,740 INFO L146 ILogger]: Finished difference Result 123 states and 123 transitions. [2019-05-23 09:53:34,740 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-05-23 09:53:34,740 INFO L146 ILogger]: Start accepts. Automaton has 122 states. Word has length 121 [2019-05-23 09:53:34,740 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:34,740 INFO L146 ILogger]: With dead ends: 123 [2019-05-23 09:53:34,740 INFO L146 ILogger]: Without dead ends: 123 [2019-05-23 09:53:34,741 INFO L146 ILogger]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:53:34,741 INFO L146 ILogger]: Start minimizeSevpa. Operand 123 states. [2019-05-23 09:53:34,742 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-05-23 09:53:34,742 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 09:53:34,743 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-05-23 09:53:34,743 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2019-05-23 09:53:34,743 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:34,743 INFO L146 ILogger]: Abstraction has 123 states and 123 transitions. [2019-05-23 09:53:34,743 INFO L146 ILogger]: Interpolant automaton has 122 states. [2019-05-23 09:53:34,744 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 123 transitions. [2019-05-23 09:53:34,744 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 09:53:34,744 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:34,744 INFO L146 ILogger]: trace histogram [120, 1, 1] [2019-05-23 09:53:34,745 INFO L146 ILogger]: === Iteration 121 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:34,745 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:34,745 INFO L146 ILogger]: Analyzing trace with hash 1193308866, now seen corresponding path program 120 times [2019-05-23 09:53:34,746 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:34,803 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:34,812 INFO L146 ILogger]: Trace formula consists of 1445 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:53:34,813 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:39,564 INFO L146 ILogger]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:39,564 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:39,564 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:53:39,564 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 09:53:39,565 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 09:53:39,565 INFO L146 ILogger]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:53:39,566 INFO L146 ILogger]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2019-05-23 09:53:39,796 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:39,796 INFO L146 ILogger]: Finished difference Result 124 states and 124 transitions. [2019-05-23 09:53:39,797 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 09:53:39,797 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 122 [2019-05-23 09:53:39,797 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:39,797 INFO L146 ILogger]: With dead ends: 124 [2019-05-23 09:53:39,797 INFO L146 ILogger]: Without dead ends: 124 [2019-05-23 09:53:39,798 INFO L146 ILogger]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:53:39,798 INFO L146 ILogger]: Start minimizeSevpa. Operand 124 states. [2019-05-23 09:53:39,798 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Start removeUnreachable. Operand 124 states. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2019-05-23 09:53:39,799 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Abstraction has 124 states and 124 transitions. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Start isEmpty. Operand 124 states and 124 transitions. [2019-05-23 09:53:39,799 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 124 [2019-05-23 09:53:39,800 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:39,800 INFO L146 ILogger]: trace histogram [121, 1, 1] [2019-05-23 09:53:39,800 INFO L146 ILogger]: === Iteration 122 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:39,800 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:39,800 INFO L146 ILogger]: Analyzing trace with hash -1662130778, now seen corresponding path program 121 times [2019-05-23 09:53:39,800 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:39,857 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:39,864 INFO L146 ILogger]: Trace formula consists of 1457 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 09:53:39,865 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:44,650 INFO L146 ILogger]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:44,651 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:44,651 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-05-23 09:53:44,651 INFO L146 ILogger]: Interpolant automaton has 124 states [2019-05-23 09:53:44,652 INFO L146 ILogger]: Constructing interpolant automaton starting with 124 interpolants. [2019-05-23 09:53:44,652 INFO L146 ILogger]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 09:53:44,652 INFO L146 ILogger]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2019-05-23 09:53:44,859 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:44,859 INFO L146 ILogger]: Finished difference Result 125 states and 125 transitions. [2019-05-23 09:53:44,859 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-05-23 09:53:44,860 INFO L146 ILogger]: Start accepts. Automaton has 124 states. Word has length 123 [2019-05-23 09:53:44,860 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:44,860 INFO L146 ILogger]: With dead ends: 125 [2019-05-23 09:53:44,860 INFO L146 ILogger]: Without dead ends: 125 [2019-05-23 09:53:44,861 INFO L146 ILogger]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 09:53:44,861 INFO L146 ILogger]: Start minimizeSevpa. Operand 125 states. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Start removeUnreachable. Operand 125 states. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2019-05-23 09:53:44,862 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Abstraction has 125 states and 125 transitions. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Interpolant automaton has 124 states. [2019-05-23 09:53:44,862 INFO L146 ILogger]: Start isEmpty. Operand 125 states and 125 transitions. [2019-05-23 09:53:44,863 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 125 [2019-05-23 09:53:44,863 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:44,863 INFO L146 ILogger]: trace histogram [122, 1, 1] [2019-05-23 09:53:44,863 INFO L146 ILogger]: === Iteration 123 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:44,863 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:44,863 INFO L146 ILogger]: Analyzing trace with hash 13553474, now seen corresponding path program 122 times [2019-05-23 09:53:44,864 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:44,916 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:44,923 INFO L146 ILogger]: Trace formula consists of 1469 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 09:53:44,924 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:49,800 INFO L146 ILogger]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:49,801 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:49,801 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 09:53:49,801 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 09:53:49,802 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 09:53:49,802 INFO L146 ILogger]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:53:49,802 INFO L146 ILogger]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2019-05-23 09:53:49,992 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:49,992 INFO L146 ILogger]: Finished difference Result 126 states and 126 transitions. [2019-05-23 09:53:49,993 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-05-23 09:53:49,994 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 124 [2019-05-23 09:53:49,994 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:49,994 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 09:53:49,994 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 09:53:49,995 INFO L146 ILogger]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:53:49,995 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 09:53:49,996 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-05-23 09:53:49,996 INFO L146 ILogger]: Start removeUnreachable. Operand 126 states. [2019-05-23 09:53:49,996 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-05-23 09:53:49,996 INFO L146 ILogger]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2019-05-23 09:53:49,997 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:49,997 INFO L146 ILogger]: Abstraction has 126 states and 126 transitions. [2019-05-23 09:53:49,997 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 09:53:49,997 INFO L146 ILogger]: Start isEmpty. Operand 126 states and 126 transitions. [2019-05-23 09:53:49,997 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 126 [2019-05-23 09:53:49,997 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:49,997 INFO L146 ILogger]: trace histogram [123, 1, 1] [2019-05-23 09:53:49,997 INFO L146 ILogger]: === Iteration 124 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:49,998 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:49,998 INFO L146 ILogger]: Analyzing trace with hash 420157734, now seen corresponding path program 123 times [2019-05-23 09:53:49,998 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:50,051 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:50,058 INFO L146 ILogger]: Trace formula consists of 1481 conjuncts, 125 conjunts are in the unsatisfiable core [2019-05-23 09:53:50,059 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:53:55,056 INFO L146 ILogger]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:53:55,057 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:53:55,057 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2019-05-23 09:53:55,057 INFO L146 ILogger]: Interpolant automaton has 126 states [2019-05-23 09:53:55,058 INFO L146 ILogger]: Constructing interpolant automaton starting with 126 interpolants. [2019-05-23 09:53:55,058 INFO L146 ILogger]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 09:53:55,058 INFO L146 ILogger]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2019-05-23 09:53:55,247 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:53:55,248 INFO L146 ILogger]: Finished difference Result 127 states and 127 transitions. [2019-05-23 09:53:55,248 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 09:53:55,248 INFO L146 ILogger]: Start accepts. Automaton has 126 states. Word has length 125 [2019-05-23 09:53:55,248 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:53:55,249 INFO L146 ILogger]: With dead ends: 127 [2019-05-23 09:53:55,249 INFO L146 ILogger]: Without dead ends: 127 [2019-05-23 09:53:55,249 INFO L146 ILogger]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 09:53:55,249 INFO L146 ILogger]: Start minimizeSevpa. Operand 127 states. [2019-05-23 09:53:55,250 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-05-23 09:53:55,250 INFO L146 ILogger]: Start removeUnreachable. Operand 127 states. [2019-05-23 09:53:55,250 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-05-23 09:53:55,250 INFO L146 ILogger]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2019-05-23 09:53:55,251 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:53:55,251 INFO L146 ILogger]: Abstraction has 127 states and 127 transitions. [2019-05-23 09:53:55,251 INFO L146 ILogger]: Interpolant automaton has 126 states. [2019-05-23 09:53:55,251 INFO L146 ILogger]: Start isEmpty. Operand 127 states and 127 transitions. [2019-05-23 09:53:55,251 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 127 [2019-05-23 09:53:55,251 INFO L146 ILogger]: Found error trace [2019-05-23 09:53:55,251 INFO L146 ILogger]: trace histogram [124, 1, 1] [2019-05-23 09:53:55,251 INFO L146 ILogger]: === Iteration 125 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:53:55,251 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:53:55,252 INFO L146 ILogger]: Analyzing trace with hash 139987906, now seen corresponding path program 124 times [2019-05-23 09:53:55,252 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:53:55,307 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:53:55,316 INFO L146 ILogger]: Trace formula consists of 1493 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:53:55,318 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:00,338 INFO L146 ILogger]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:00,338 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:00,338 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 09:54:00,338 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 09:54:00,339 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 09:54:00,340 INFO L146 ILogger]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:54:00,340 INFO L146 ILogger]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2019-05-23 09:54:00,533 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:00,533 INFO L146 ILogger]: Finished difference Result 128 states and 128 transitions. [2019-05-23 09:54:00,534 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-05-23 09:54:00,534 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 126 [2019-05-23 09:54:00,534 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:00,534 INFO L146 ILogger]: With dead ends: 128 [2019-05-23 09:54:00,535 INFO L146 ILogger]: Without dead ends: 128 [2019-05-23 09:54:00,535 INFO L146 ILogger]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:54:00,536 INFO L146 ILogger]: Start minimizeSevpa. Operand 128 states. [2019-05-23 09:54:00,537 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-05-23 09:54:00,537 INFO L146 ILogger]: Start removeUnreachable. Operand 128 states. [2019-05-23 09:54:00,538 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-05-23 09:54:00,538 INFO L146 ILogger]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2019-05-23 09:54:00,538 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:00,538 INFO L146 ILogger]: Abstraction has 128 states and 128 transitions. [2019-05-23 09:54:00,538 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 09:54:00,538 INFO L146 ILogger]: Start isEmpty. Operand 128 states and 128 transitions. [2019-05-23 09:54:00,539 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 128 [2019-05-23 09:54:00,539 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:00,539 INFO L146 ILogger]: trace histogram [125, 1, 1] [2019-05-23 09:54:00,539 INFO L146 ILogger]: === Iteration 126 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:00,539 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:00,539 INFO L146 ILogger]: Analyzing trace with hash 44657830, now seen corresponding path program 125 times [2019-05-23 09:54:00,540 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:00,595 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:00,602 INFO L146 ILogger]: Trace formula consists of 1505 conjuncts, 127 conjunts are in the unsatisfiable core [2019-05-23 09:54:00,603 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:05,762 INFO L146 ILogger]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:05,763 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:05,763 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2019-05-23 09:54:05,763 INFO L146 ILogger]: Interpolant automaton has 128 states [2019-05-23 09:54:05,764 INFO L146 ILogger]: Constructing interpolant automaton starting with 128 interpolants. [2019-05-23 09:54:05,765 INFO L146 ILogger]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:54:05,765 INFO L146 ILogger]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2019-05-23 09:54:05,961 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:05,961 INFO L146 ILogger]: Finished difference Result 129 states and 129 transitions. [2019-05-23 09:54:05,961 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-05-23 09:54:05,962 INFO L146 ILogger]: Start accepts. Automaton has 128 states. Word has length 127 [2019-05-23 09:54:05,962 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:05,962 INFO L146 ILogger]: With dead ends: 129 [2019-05-23 09:54:05,962 INFO L146 ILogger]: Without dead ends: 129 [2019-05-23 09:54:05,963 INFO L146 ILogger]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:54:05,963 INFO L146 ILogger]: Start minimizeSevpa. Operand 129 states. [2019-05-23 09:54:05,964 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-05-23 09:54:05,964 INFO L146 ILogger]: Start removeUnreachable. Operand 129 states. [2019-05-23 09:54:05,964 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-05-23 09:54:05,964 INFO L146 ILogger]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2019-05-23 09:54:05,965 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:05,965 INFO L146 ILogger]: Abstraction has 129 states and 129 transitions. [2019-05-23 09:54:05,965 INFO L146 ILogger]: Interpolant automaton has 128 states. [2019-05-23 09:54:05,965 INFO L146 ILogger]: Start isEmpty. Operand 129 states and 129 transitions. [2019-05-23 09:54:05,965 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 129 [2019-05-23 09:54:05,965 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:05,965 INFO L146 ILogger]: trace histogram [126, 1, 1] [2019-05-23 09:54:05,965 INFO L146 ILogger]: === Iteration 127 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:05,966 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:05,966 INFO L146 ILogger]: Analyzing trace with hash 1384392770, now seen corresponding path program 126 times [2019-05-23 09:54:05,966 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:06,022 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:06,029 INFO L146 ILogger]: Trace formula consists of 1517 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 09:54:06,030 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:11,215 INFO L146 ILogger]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:11,216 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:11,216 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 09:54:11,216 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 09:54:11,217 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 09:54:11,217 INFO L146 ILogger]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:54:11,217 INFO L146 ILogger]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2019-05-23 09:54:11,406 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:11,406 INFO L146 ILogger]: Finished difference Result 130 states and 130 transitions. [2019-05-23 09:54:11,407 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 09:54:11,407 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 128 [2019-05-23 09:54:11,407 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:11,407 INFO L146 ILogger]: With dead ends: 130 [2019-05-23 09:54:11,407 INFO L146 ILogger]: Without dead ends: 130 [2019-05-23 09:54:11,408 INFO L146 ILogger]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:54:11,408 INFO L146 ILogger]: Start minimizeSevpa. Operand 130 states. [2019-05-23 09:54:11,410 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-05-23 09:54:11,410 INFO L146 ILogger]: Start removeUnreachable. Operand 130 states. [2019-05-23 09:54:11,410 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-05-23 09:54:11,410 INFO L146 ILogger]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2019-05-23 09:54:11,410 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:11,411 INFO L146 ILogger]: Abstraction has 130 states and 130 transitions. [2019-05-23 09:54:11,411 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 09:54:11,411 INFO L146 ILogger]: Start isEmpty. Operand 130 states and 130 transitions. [2019-05-23 09:54:11,411 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 130 [2019-05-23 09:54:11,412 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:11,412 INFO L146 ILogger]: trace histogram [127, 1, 1] [2019-05-23 09:54:11,412 INFO L146 ILogger]: === Iteration 128 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:11,412 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:11,412 INFO L146 ILogger]: Analyzing trace with hash -33497050, now seen corresponding path program 127 times [2019-05-23 09:54:11,413 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:11,470 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:11,478 INFO L146 ILogger]: Trace formula consists of 1529 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 09:54:11,479 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:16,750 INFO L146 ILogger]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:16,750 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:16,751 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2019-05-23 09:54:16,751 INFO L146 ILogger]: Interpolant automaton has 130 states [2019-05-23 09:54:16,753 INFO L146 ILogger]: Constructing interpolant automaton starting with 130 interpolants. [2019-05-23 09:54:16,754 INFO L146 ILogger]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 09:54:16,754 INFO L146 ILogger]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2019-05-23 09:54:16,950 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:16,951 INFO L146 ILogger]: Finished difference Result 131 states and 131 transitions. [2019-05-23 09:54:16,951 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-05-23 09:54:16,951 INFO L146 ILogger]: Start accepts. Automaton has 130 states. Word has length 129 [2019-05-23 09:54:16,952 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:16,952 INFO L146 ILogger]: With dead ends: 131 [2019-05-23 09:54:16,952 INFO L146 ILogger]: Without dead ends: 131 [2019-05-23 09:54:16,953 INFO L146 ILogger]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 09:54:16,953 INFO L146 ILogger]: Start minimizeSevpa. Operand 131 states. [2019-05-23 09:54:16,954 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-05-23 09:54:16,954 INFO L146 ILogger]: Start removeUnreachable. Operand 131 states. [2019-05-23 09:54:16,954 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-05-23 09:54:16,955 INFO L146 ILogger]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2019-05-23 09:54:16,955 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:16,955 INFO L146 ILogger]: Abstraction has 131 states and 131 transitions. [2019-05-23 09:54:16,955 INFO L146 ILogger]: Interpolant automaton has 130 states. [2019-05-23 09:54:16,956 INFO L146 ILogger]: Start isEmpty. Operand 131 states and 131 transitions. [2019-05-23 09:54:16,956 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 131 [2019-05-23 09:54:16,956 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:16,956 INFO L146 ILogger]: trace histogram [128, 1, 1] [2019-05-23 09:54:16,956 INFO L146 ILogger]: === Iteration 129 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:16,956 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:16,957 INFO L146 ILogger]: Analyzing trace with hash -1038408510, now seen corresponding path program 128 times [2019-05-23 09:54:16,957 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:17,015 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:17,023 INFO L146 ILogger]: Trace formula consists of 1541 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:54:17,024 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:22,398 INFO L146 ILogger]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:22,398 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:22,398 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 09:54:22,399 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 09:54:22,400 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 09:54:22,401 INFO L146 ILogger]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:54:22,401 INFO L146 ILogger]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2019-05-23 09:54:22,608 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:22,608 INFO L146 ILogger]: Finished difference Result 132 states and 132 transitions. [2019-05-23 09:54:22,608 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-05-23 09:54:22,609 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 130 [2019-05-23 09:54:22,609 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:22,609 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 09:54:22,609 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 09:54:22,610 INFO L146 ILogger]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:54:22,610 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 09:54:22,611 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-05-23 09:54:22,611 INFO L146 ILogger]: Start removeUnreachable. Operand 132 states. [2019-05-23 09:54:22,612 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-05-23 09:54:22,612 INFO L146 ILogger]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2019-05-23 09:54:22,614 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:22,614 INFO L146 ILogger]: Abstraction has 132 states and 132 transitions. [2019-05-23 09:54:22,614 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 09:54:22,614 INFO L146 ILogger]: Start isEmpty. Operand 132 states and 132 transitions. [2019-05-23 09:54:22,614 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 132 [2019-05-23 09:54:22,614 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:22,615 INFO L146 ILogger]: trace histogram [129, 1, 1] [2019-05-23 09:54:22,615 INFO L146 ILogger]: === Iteration 130 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:22,615 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:22,615 INFO L146 ILogger]: Analyzing trace with hash -2125892698, now seen corresponding path program 129 times [2019-05-23 09:54:22,616 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:22,680 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:22,691 INFO L146 ILogger]: Trace formula consists of 1553 conjuncts, 131 conjunts are in the unsatisfiable core [2019-05-23 09:54:22,693 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:28,092 INFO L146 ILogger]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:28,092 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:28,092 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-05-23 09:54:28,092 INFO L146 ILogger]: Interpolant automaton has 132 states [2019-05-23 09:54:28,093 INFO L146 ILogger]: Constructing interpolant automaton starting with 132 interpolants. [2019-05-23 09:54:28,094 INFO L146 ILogger]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 09:54:28,094 INFO L146 ILogger]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2019-05-23 09:54:28,309 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:28,309 INFO L146 ILogger]: Finished difference Result 133 states and 133 transitions. [2019-05-23 09:54:28,310 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 09:54:28,310 INFO L146 ILogger]: Start accepts. Automaton has 132 states. Word has length 131 [2019-05-23 09:54:28,310 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:28,311 INFO L146 ILogger]: With dead ends: 133 [2019-05-23 09:54:28,311 INFO L146 ILogger]: Without dead ends: 133 [2019-05-23 09:54:28,312 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 09:54:28,312 INFO L146 ILogger]: Start minimizeSevpa. Operand 133 states. [2019-05-23 09:54:28,313 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-05-23 09:54:28,313 INFO L146 ILogger]: Start removeUnreachable. Operand 133 states. [2019-05-23 09:54:28,314 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-05-23 09:54:28,314 INFO L146 ILogger]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2019-05-23 09:54:28,314 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:28,315 INFO L146 ILogger]: Abstraction has 133 states and 133 transitions. [2019-05-23 09:54:28,315 INFO L146 ILogger]: Interpolant automaton has 132 states. [2019-05-23 09:54:28,315 INFO L146 ILogger]: Start isEmpty. Operand 133 states and 133 transitions. [2019-05-23 09:54:28,315 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 133 [2019-05-23 09:54:28,315 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:28,316 INFO L146 ILogger]: trace histogram [130, 1, 1] [2019-05-23 09:54:28,316 INFO L146 ILogger]: === Iteration 131 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:28,316 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:28,316 INFO L146 ILogger]: Analyzing trace with hash -1478164158, now seen corresponding path program 130 times [2019-05-23 09:54:28,316 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:28,383 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:28,391 INFO L146 ILogger]: Trace formula consists of 1565 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:54:28,392 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:33,961 INFO L146 ILogger]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:33,962 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:33,962 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 09:54:33,962 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 09:54:33,963 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 09:54:33,963 INFO L146 ILogger]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:54:33,964 INFO L146 ILogger]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2019-05-23 09:54:34,191 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:34,192 INFO L146 ILogger]: Finished difference Result 134 states and 134 transitions. [2019-05-23 09:54:34,192 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-05-23 09:54:34,192 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 132 [2019-05-23 09:54:34,192 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:34,192 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 09:54:34,192 INFO L146 ILogger]: Without dead ends: 134 [2019-05-23 09:54:34,193 INFO L146 ILogger]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:54:34,193 INFO L146 ILogger]: Start minimizeSevpa. Operand 134 states. [2019-05-23 09:54:34,194 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-05-23 09:54:34,194 INFO L146 ILogger]: Start removeUnreachable. Operand 134 states. [2019-05-23 09:54:34,195 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-05-23 09:54:34,195 INFO L146 ILogger]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2019-05-23 09:54:34,195 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:34,195 INFO L146 ILogger]: Abstraction has 134 states and 134 transitions. [2019-05-23 09:54:34,196 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 09:54:34,196 INFO L146 ILogger]: Start isEmpty. Operand 134 states and 134 transitions. [2019-05-23 09:54:34,196 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:54:34,196 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:34,196 INFO L146 ILogger]: trace histogram [131, 1, 1] [2019-05-23 09:54:34,196 INFO L146 ILogger]: === Iteration 132 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:34,197 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:34,197 INFO L146 ILogger]: Analyzing trace with hash 1421551398, now seen corresponding path program 131 times [2019-05-23 09:54:34,197 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:34,301 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:34,314 INFO L146 ILogger]: Trace formula consists of 1577 conjuncts, 133 conjunts are in the unsatisfiable core [2019-05-23 09:54:34,316 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:39,936 INFO L146 ILogger]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:39,936 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:39,936 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2019-05-23 09:54:39,936 INFO L146 ILogger]: Interpolant automaton has 134 states [2019-05-23 09:54:39,937 INFO L146 ILogger]: Constructing interpolant automaton starting with 134 interpolants. [2019-05-23 09:54:39,938 INFO L146 ILogger]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 09:54:39,938 INFO L146 ILogger]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2019-05-23 09:54:40,184 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:40,184 INFO L146 ILogger]: Finished difference Result 135 states and 135 transitions. [2019-05-23 09:54:40,184 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-05-23 09:54:40,184 INFO L146 ILogger]: Start accepts. Automaton has 134 states. Word has length 133 [2019-05-23 09:54:40,185 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:40,185 INFO L146 ILogger]: With dead ends: 135 [2019-05-23 09:54:40,185 INFO L146 ILogger]: Without dead ends: 135 [2019-05-23 09:54:40,185 INFO L146 ILogger]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 09:54:40,186 INFO L146 ILogger]: Start minimizeSevpa. Operand 135 states. [2019-05-23 09:54:40,186 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-05-23 09:54:40,186 INFO L146 ILogger]: Start removeUnreachable. Operand 135 states. [2019-05-23 09:54:40,187 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-05-23 09:54:40,187 INFO L146 ILogger]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2019-05-23 09:54:40,187 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:40,187 INFO L146 ILogger]: Abstraction has 135 states and 135 transitions. [2019-05-23 09:54:40,187 INFO L146 ILogger]: Interpolant automaton has 134 states. [2019-05-23 09:54:40,187 INFO L146 ILogger]: Start isEmpty. Operand 135 states and 135 transitions. [2019-05-23 09:54:40,187 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 135 [2019-05-23 09:54:40,187 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:40,188 INFO L146 ILogger]: trace histogram [132, 1, 1] [2019-05-23 09:54:40,188 INFO L146 ILogger]: === Iteration 133 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:40,188 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:40,188 INFO L146 ILogger]: Analyzing trace with hash 1118420418, now seen corresponding path program 132 times [2019-05-23 09:54:40,188 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:40,248 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:40,256 INFO L146 ILogger]: Trace formula consists of 1589 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:54:40,257 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:45,910 INFO L146 ILogger]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:45,911 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:45,911 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 09:54:45,911 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 09:54:45,912 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 09:54:45,912 INFO L146 ILogger]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:54:45,912 INFO L146 ILogger]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2019-05-23 09:54:46,206 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:46,206 INFO L146 ILogger]: Finished difference Result 136 states and 136 transitions. [2019-05-23 09:54:46,207 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 09:54:46,207 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 134 [2019-05-23 09:54:46,207 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:46,207 INFO L146 ILogger]: With dead ends: 136 [2019-05-23 09:54:46,207 INFO L146 ILogger]: Without dead ends: 136 [2019-05-23 09:54:46,208 INFO L146 ILogger]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:54:46,208 INFO L146 ILogger]: Start minimizeSevpa. Operand 136 states. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Start removeUnreachable. Operand 136 states. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2019-05-23 09:54:46,209 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Abstraction has 136 states and 136 transitions. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 09:54:46,209 INFO L146 ILogger]: Start isEmpty. Operand 136 states and 136 transitions. [2019-05-23 09:54:46,210 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 136 [2019-05-23 09:54:46,210 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:46,210 INFO L146 ILogger]: trace histogram [133, 1, 1] [2019-05-23 09:54:46,210 INFO L146 ILogger]: === Iteration 134 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:46,210 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:46,210 INFO L146 ILogger]: Analyzing trace with hash 311294630, now seen corresponding path program 133 times [2019-05-23 09:54:46,211 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:46,271 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:46,279 INFO L146 ILogger]: Trace formula consists of 1601 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 09:54:46,280 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:52,080 INFO L146 ILogger]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:52,080 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:52,081 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2019-05-23 09:54:52,081 INFO L146 ILogger]: Interpolant automaton has 136 states [2019-05-23 09:54:52,082 INFO L146 ILogger]: Constructing interpolant automaton starting with 136 interpolants. [2019-05-23 09:54:52,082 INFO L146 ILogger]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 09:54:52,082 INFO L146 ILogger]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2019-05-23 09:54:52,365 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:52,365 INFO L146 ILogger]: Finished difference Result 137 states and 137 transitions. [2019-05-23 09:54:52,365 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-05-23 09:54:52,365 INFO L146 ILogger]: Start accepts. Automaton has 136 states. Word has length 135 [2019-05-23 09:54:52,366 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:52,366 INFO L146 ILogger]: With dead ends: 137 [2019-05-23 09:54:52,366 INFO L146 ILogger]: Without dead ends: 137 [2019-05-23 09:54:52,367 INFO L146 ILogger]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 09:54:52,368 INFO L146 ILogger]: Start minimizeSevpa. Operand 137 states. [2019-05-23 09:54:52,368 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-05-23 09:54:52,369 INFO L146 ILogger]: Start removeUnreachable. Operand 137 states. [2019-05-23 09:54:52,369 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-05-23 09:54:52,369 INFO L146 ILogger]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2019-05-23 09:54:52,369 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:52,369 INFO L146 ILogger]: Abstraction has 137 states and 137 transitions. [2019-05-23 09:54:52,370 INFO L146 ILogger]: Interpolant automaton has 136 states. [2019-05-23 09:54:52,370 INFO L146 ILogger]: Start isEmpty. Operand 137 states and 137 transitions. [2019-05-23 09:54:52,370 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 137 [2019-05-23 09:54:52,370 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:52,370 INFO L146 ILogger]: trace histogram [134, 1, 1] [2019-05-23 09:54:52,371 INFO L146 ILogger]: === Iteration 135 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:52,371 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:52,371 INFO L146 ILogger]: Analyzing trace with hash 1060198978, now seen corresponding path program 134 times [2019-05-23 09:54:52,371 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:52,433 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:52,441 INFO L146 ILogger]: Trace formula consists of 1613 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 09:54:52,442 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:54:58,325 INFO L146 ILogger]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:54:58,325 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:54:58,325 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 09:54:58,325 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 09:54:58,326 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 09:54:58,326 INFO L146 ILogger]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:54:58,326 INFO L146 ILogger]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2019-05-23 09:54:58,577 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:54:58,577 INFO L146 ILogger]: Finished difference Result 138 states and 138 transitions. [2019-05-23 09:54:58,578 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-05-23 09:54:58,578 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 136 [2019-05-23 09:54:58,578 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:54:58,578 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 09:54:58,578 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 09:54:58,579 INFO L146 ILogger]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:54:58,579 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 09:54:58,580 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-05-23 09:54:58,580 INFO L146 ILogger]: Start removeUnreachable. Operand 138 states. [2019-05-23 09:54:58,580 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-05-23 09:54:58,581 INFO L146 ILogger]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2019-05-23 09:54:58,581 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:54:58,581 INFO L146 ILogger]: Abstraction has 138 states and 138 transitions. [2019-05-23 09:54:58,581 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 09:54:58,581 INFO L146 ILogger]: Start isEmpty. Operand 138 states and 138 transitions. [2019-05-23 09:54:58,581 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 138 [2019-05-23 09:54:58,582 INFO L146 ILogger]: Found error trace [2019-05-23 09:54:58,582 INFO L146 ILogger]: trace histogram [135, 1, 1] [2019-05-23 09:54:58,582 INFO L146 ILogger]: === Iteration 136 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:54:58,582 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:54:58,582 INFO L146 ILogger]: Analyzing trace with hash -1493570010, now seen corresponding path program 135 times [2019-05-23 09:54:58,582 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:54:58,645 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:54:58,653 INFO L146 ILogger]: Trace formula consists of 1625 conjuncts, 137 conjunts are in the unsatisfiable core [2019-05-23 09:54:58,655 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:04,629 INFO L146 ILogger]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:04,629 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:04,629 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2019-05-23 09:55:04,630 INFO L146 ILogger]: Interpolant automaton has 138 states [2019-05-23 09:55:04,630 INFO L146 ILogger]: Constructing interpolant automaton starting with 138 interpolants. [2019-05-23 09:55:04,631 INFO L146 ILogger]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-05-23 09:55:04,631 INFO L146 ILogger]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2019-05-23 09:55:04,854 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:04,854 INFO L146 ILogger]: Finished difference Result 139 states and 139 transitions. [2019-05-23 09:55:04,854 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 09:55:04,855 INFO L146 ILogger]: Start accepts. Automaton has 138 states. Word has length 137 [2019-05-23 09:55:04,855 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:04,855 INFO L146 ILogger]: With dead ends: 139 [2019-05-23 09:55:04,856 INFO L146 ILogger]: Without dead ends: 139 [2019-05-23 09:55:04,856 INFO L146 ILogger]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-05-23 09:55:04,857 INFO L146 ILogger]: Start minimizeSevpa. Operand 139 states. [2019-05-23 09:55:04,858 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-05-23 09:55:04,858 INFO L146 ILogger]: Start removeUnreachable. Operand 139 states. [2019-05-23 09:55:04,858 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-05-23 09:55:04,858 INFO L146 ILogger]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2019-05-23 09:55:04,858 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:04,858 INFO L146 ILogger]: Abstraction has 139 states and 139 transitions. [2019-05-23 09:55:04,859 INFO L146 ILogger]: Interpolant automaton has 138 states. [2019-05-23 09:55:04,859 INFO L146 ILogger]: Start isEmpty. Operand 139 states and 139 transitions. [2019-05-23 09:55:04,859 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 139 [2019-05-23 09:55:04,859 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:04,859 INFO L146 ILogger]: trace histogram [136, 1, 1] [2019-05-23 09:55:04,859 INFO L146 ILogger]: === Iteration 137 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:04,860 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:04,860 INFO L146 ILogger]: Analyzing trace with hash 943969986, now seen corresponding path program 136 times [2019-05-23 09:55:04,860 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:04,923 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:04,931 INFO L146 ILogger]: Trace formula consists of 1637 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:55:04,933 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:11,006 INFO L146 ILogger]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:11,006 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:11,007 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 09:55:11,007 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 09:55:11,008 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 09:55:11,008 INFO L146 ILogger]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:55:11,008 INFO L146 ILogger]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2019-05-23 09:55:11,258 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:11,258 INFO L146 ILogger]: Finished difference Result 140 states and 140 transitions. [2019-05-23 09:55:11,258 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-05-23 09:55:11,258 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 138 [2019-05-23 09:55:11,259 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:11,259 INFO L146 ILogger]: With dead ends: 140 [2019-05-23 09:55:11,259 INFO L146 ILogger]: Without dead ends: 140 [2019-05-23 09:55:11,260 INFO L146 ILogger]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:55:11,260 INFO L146 ILogger]: Start minimizeSevpa. Operand 140 states. [2019-05-23 09:55:11,260 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-05-23 09:55:11,260 INFO L146 ILogger]: Start removeUnreachable. Operand 140 states. [2019-05-23 09:55:11,261 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-05-23 09:55:11,261 INFO L146 ILogger]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2019-05-23 09:55:11,261 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:11,261 INFO L146 ILogger]: Abstraction has 140 states and 140 transitions. [2019-05-23 09:55:11,261 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 09:55:11,261 INFO L146 ILogger]: Start isEmpty. Operand 140 states and 140 transitions. [2019-05-23 09:55:11,262 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 140 [2019-05-23 09:55:11,262 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:11,262 INFO L146 ILogger]: trace histogram [137, 1, 1] [2019-05-23 09:55:11,262 INFO L146 ILogger]: === Iteration 138 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:11,262 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:11,263 INFO L146 ILogger]: Analyzing trace with hash -801701466, now seen corresponding path program 137 times [2019-05-23 09:55:11,263 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:11,329 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:11,343 INFO L146 ILogger]: Trace formula consists of 1649 conjuncts, 139 conjunts are in the unsatisfiable core [2019-05-23 09:55:11,345 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:17,434 INFO L146 ILogger]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:17,434 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:17,434 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2019-05-23 09:55:17,434 INFO L146 ILogger]: Interpolant automaton has 140 states [2019-05-23 09:55:17,436 INFO L146 ILogger]: Constructing interpolant automaton starting with 140 interpolants. [2019-05-23 09:55:17,436 INFO L146 ILogger]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 09:55:17,436 INFO L146 ILogger]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2019-05-23 09:55:17,725 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:17,726 INFO L146 ILogger]: Finished difference Result 141 states and 141 transitions. [2019-05-23 09:55:17,726 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-05-23 09:55:17,726 INFO L146 ILogger]: Start accepts. Automaton has 140 states. Word has length 139 [2019-05-23 09:55:17,726 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:17,727 INFO L146 ILogger]: With dead ends: 141 [2019-05-23 09:55:17,727 INFO L146 ILogger]: Without dead ends: 141 [2019-05-23 09:55:17,728 INFO L146 ILogger]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 09:55:17,728 INFO L146 ILogger]: Start minimizeSevpa. Operand 141 states. [2019-05-23 09:55:17,729 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-05-23 09:55:17,729 INFO L146 ILogger]: Start removeUnreachable. Operand 141 states. [2019-05-23 09:55:17,730 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-05-23 09:55:17,730 INFO L146 ILogger]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2019-05-23 09:55:17,730 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:17,730 INFO L146 ILogger]: Abstraction has 141 states and 141 transitions. [2019-05-23 09:55:17,730 INFO L146 ILogger]: Interpolant automaton has 140 states. [2019-05-23 09:55:17,730 INFO L146 ILogger]: Start isEmpty. Operand 141 states and 141 transitions. [2019-05-23 09:55:17,731 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 141 [2019-05-23 09:55:17,731 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:17,731 INFO L146 ILogger]: trace histogram [138, 1, 1] [2019-05-23 09:55:17,731 INFO L146 ILogger]: === Iteration 139 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:17,731 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:17,732 INFO L146 ILogger]: Analyzing trace with hash 917058370, now seen corresponding path program 138 times [2019-05-23 09:55:17,732 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:17,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:17,805 INFO L146 ILogger]: Trace formula consists of 1661 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 09:55:17,806 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:24,010 INFO L146 ILogger]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:24,010 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:24,010 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 09:55:24,011 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 09:55:24,012 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 09:55:24,012 INFO L146 ILogger]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:55:24,012 INFO L146 ILogger]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2019-05-23 09:55:24,295 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:24,295 INFO L146 ILogger]: Finished difference Result 142 states and 142 transitions. [2019-05-23 09:55:24,295 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 09:55:24,295 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 140 [2019-05-23 09:55:24,296 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:24,296 INFO L146 ILogger]: With dead ends: 142 [2019-05-23 09:55:24,296 INFO L146 ILogger]: Without dead ends: 142 [2019-05-23 09:55:24,297 INFO L146 ILogger]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:55:24,298 INFO L146 ILogger]: Start minimizeSevpa. Operand 142 states. [2019-05-23 09:55:24,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-05-23 09:55:24,299 INFO L146 ILogger]: Start removeUnreachable. Operand 142 states. [2019-05-23 09:55:24,299 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-05-23 09:55:24,299 INFO L146 ILogger]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2019-05-23 09:55:24,299 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:24,300 INFO L146 ILogger]: Abstraction has 142 states and 142 transitions. [2019-05-23 09:55:24,300 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 09:55:24,300 INFO L146 ILogger]: Start isEmpty. Operand 142 states and 142 transitions. [2019-05-23 09:55:24,300 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 09:55:24,300 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:24,300 INFO L146 ILogger]: trace histogram [139, 1, 1] [2019-05-23 09:55:24,300 INFO L146 ILogger]: === Iteration 140 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:24,300 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:24,300 INFO L146 ILogger]: Analyzing trace with hash -1635961562, now seen corresponding path program 139 times [2019-05-23 09:55:24,301 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:24,367 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:24,376 INFO L146 ILogger]: Trace formula consists of 1673 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 09:55:24,377 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:30,660 INFO L146 ILogger]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:30,660 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:30,661 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2019-05-23 09:55:30,661 INFO L146 ILogger]: Interpolant automaton has 142 states [2019-05-23 09:55:30,662 INFO L146 ILogger]: Constructing interpolant automaton starting with 142 interpolants. [2019-05-23 09:55:30,663 INFO L146 ILogger]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 09:55:30,663 INFO L146 ILogger]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2019-05-23 09:55:30,948 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:30,948 INFO L146 ILogger]: Finished difference Result 143 states and 143 transitions. [2019-05-23 09:55:30,948 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-05-23 09:55:30,949 INFO L146 ILogger]: Start accepts. Automaton has 142 states. Word has length 141 [2019-05-23 09:55:30,949 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:30,949 INFO L146 ILogger]: With dead ends: 143 [2019-05-23 09:55:30,949 INFO L146 ILogger]: Without dead ends: 143 [2019-05-23 09:55:30,950 INFO L146 ILogger]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 09:55:30,950 INFO L146 ILogger]: Start minimizeSevpa. Operand 143 states. [2019-05-23 09:55:30,950 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-05-23 09:55:30,950 INFO L146 ILogger]: Start removeUnreachable. Operand 143 states. [2019-05-23 09:55:30,951 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-05-23 09:55:30,951 INFO L146 ILogger]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2019-05-23 09:55:30,951 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:30,951 INFO L146 ILogger]: Abstraction has 143 states and 143 transitions. [2019-05-23 09:55:30,951 INFO L146 ILogger]: Interpolant automaton has 142 states. [2019-05-23 09:55:30,951 INFO L146 ILogger]: Start isEmpty. Operand 143 states and 143 transitions. [2019-05-23 09:55:30,951 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 143 [2019-05-23 09:55:30,951 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:30,952 INFO L146 ILogger]: trace histogram [140, 1, 1] [2019-05-23 09:55:30,952 INFO L146 ILogger]: === Iteration 141 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:30,952 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:30,952 INFO L146 ILogger]: Analyzing trace with hash 824799170, now seen corresponding path program 140 times [2019-05-23 09:55:30,952 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:31,019 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:31,028 INFO L146 ILogger]: Trace formula consists of 1685 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:55:31,029 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:37,412 INFO L146 ILogger]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:37,413 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:37,413 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 09:55:37,413 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 09:55:37,414 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 09:55:37,414 INFO L146 ILogger]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:55:37,414 INFO L146 ILogger]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2019-05-23 09:55:37,727 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:37,727 INFO L146 ILogger]: Finished difference Result 144 states and 144 transitions. [2019-05-23 09:55:37,728 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-05-23 09:55:37,728 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 142 [2019-05-23 09:55:37,728 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:37,728 INFO L146 ILogger]: With dead ends: 144 [2019-05-23 09:55:37,728 INFO L146 ILogger]: Without dead ends: 144 [2019-05-23 09:55:37,729 INFO L146 ILogger]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:55:37,729 INFO L146 ILogger]: Start minimizeSevpa. Operand 144 states. [2019-05-23 09:55:37,729 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Start removeUnreachable. Operand 144 states. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2019-05-23 09:55:37,730 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Abstraction has 144 states and 144 transitions. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Start isEmpty. Operand 144 states and 144 transitions. [2019-05-23 09:55:37,730 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 144 [2019-05-23 09:55:37,731 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:37,731 INFO L146 ILogger]: trace histogram [141, 1, 1] [2019-05-23 09:55:37,731 INFO L146 ILogger]: === Iteration 142 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:37,731 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:37,731 INFO L146 ILogger]: Analyzing trace with hash -201029466, now seen corresponding path program 141 times [2019-05-23 09:55:37,731 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:37,800 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:37,808 INFO L146 ILogger]: Trace formula consists of 1697 conjuncts, 143 conjunts are in the unsatisfiable core [2019-05-23 09:55:37,810 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:44,266 INFO L146 ILogger]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:44,267 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:44,267 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2019-05-23 09:55:44,267 INFO L146 ILogger]: Interpolant automaton has 144 states [2019-05-23 09:55:44,268 INFO L146 ILogger]: Constructing interpolant automaton starting with 144 interpolants. [2019-05-23 09:55:44,268 INFO L146 ILogger]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 09:55:44,268 INFO L146 ILogger]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2019-05-23 09:55:44,560 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:44,560 INFO L146 ILogger]: Finished difference Result 145 states and 145 transitions. [2019-05-23 09:55:44,560 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 09:55:44,560 INFO L146 ILogger]: Start accepts. Automaton has 144 states. Word has length 143 [2019-05-23 09:55:44,561 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:44,561 INFO L146 ILogger]: With dead ends: 145 [2019-05-23 09:55:44,561 INFO L146 ILogger]: Without dead ends: 145 [2019-05-23 09:55:44,562 INFO L146 ILogger]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 09:55:44,562 INFO L146 ILogger]: Start minimizeSevpa. Operand 145 states. [2019-05-23 09:55:44,563 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-05-23 09:55:44,563 INFO L146 ILogger]: Start removeUnreachable. Operand 145 states. [2019-05-23 09:55:44,563 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-05-23 09:55:44,563 INFO L146 ILogger]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2019-05-23 09:55:44,563 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:44,564 INFO L146 ILogger]: Abstraction has 145 states and 145 transitions. [2019-05-23 09:55:44,564 INFO L146 ILogger]: Interpolant automaton has 144 states. [2019-05-23 09:55:44,564 INFO L146 ILogger]: Start isEmpty. Operand 145 states and 145 transitions. [2019-05-23 09:55:44,564 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 145 [2019-05-23 09:55:44,564 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:44,564 INFO L146 ILogger]: trace histogram [142, 1, 1] [2019-05-23 09:55:44,564 INFO L146 ILogger]: === Iteration 143 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:44,564 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:44,564 INFO L146 ILogger]: Analyzing trace with hash -1936946110, now seen corresponding path program 142 times [2019-05-23 09:55:44,565 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:44,633 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:44,645 INFO L146 ILogger]: Trace formula consists of 1709 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:55:44,647 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:51,202 INFO L146 ILogger]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:51,203 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:51,203 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 09:55:51,203 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 09:55:51,204 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 09:55:51,205 INFO L146 ILogger]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:55:51,205 INFO L146 ILogger]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2019-05-23 09:55:51,463 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:51,463 INFO L146 ILogger]: Finished difference Result 146 states and 146 transitions. [2019-05-23 09:55:51,463 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-05-23 09:55:51,463 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 144 [2019-05-23 09:55:51,464 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:51,464 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:55:51,464 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:55:51,465 INFO L146 ILogger]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:55:51,465 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:55:51,465 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-05-23 09:55:51,466 INFO L146 ILogger]: Start removeUnreachable. Operand 146 states. [2019-05-23 09:55:51,466 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-05-23 09:55:51,466 INFO L146 ILogger]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2019-05-23 09:55:51,466 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:51,466 INFO L146 ILogger]: Abstraction has 146 states and 146 transitions. [2019-05-23 09:55:51,466 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 09:55:51,466 INFO L146 ILogger]: Start isEmpty. Operand 146 states and 146 transitions. [2019-05-23 09:55:51,467 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 146 [2019-05-23 09:55:51,467 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:51,467 INFO L146 ILogger]: trace histogram [143, 1, 1] [2019-05-23 09:55:51,467 INFO L146 ILogger]: === Iteration 144 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:51,467 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:51,467 INFO L146 ILogger]: Analyzing trace with hash 84212774, now seen corresponding path program 143 times [2019-05-23 09:55:51,467 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:51,537 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:51,546 INFO L146 ILogger]: Trace formula consists of 1721 conjuncts, 145 conjunts are in the unsatisfiable core [2019-05-23 09:55:51,547 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:55:58,197 INFO L146 ILogger]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:55:58,198 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:55:58,198 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2019-05-23 09:55:58,198 INFO L146 ILogger]: Interpolant automaton has 146 states [2019-05-23 09:55:58,199 INFO L146 ILogger]: Constructing interpolant automaton starting with 146 interpolants. [2019-05-23 09:55:58,200 INFO L146 ILogger]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 09:55:58,200 INFO L146 ILogger]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2019-05-23 09:55:58,521 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:55:58,521 INFO L146 ILogger]: Finished difference Result 147 states and 147 transitions. [2019-05-23 09:55:58,521 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-05-23 09:55:58,522 INFO L146 ILogger]: Start accepts. Automaton has 146 states. Word has length 145 [2019-05-23 09:55:58,522 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:55:58,522 INFO L146 ILogger]: With dead ends: 147 [2019-05-23 09:55:58,522 INFO L146 ILogger]: Without dead ends: 147 [2019-05-23 09:55:58,523 INFO L146 ILogger]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 09:55:58,523 INFO L146 ILogger]: Start minimizeSevpa. Operand 147 states. [2019-05-23 09:55:58,524 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-05-23 09:55:58,524 INFO L146 ILogger]: Start removeUnreachable. Operand 147 states. [2019-05-23 09:55:58,524 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-05-23 09:55:58,524 INFO L146 ILogger]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2019-05-23 09:55:58,525 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:55:58,525 INFO L146 ILogger]: Abstraction has 147 states and 147 transitions. [2019-05-23 09:55:58,525 INFO L146 ILogger]: Interpolant automaton has 146 states. [2019-05-23 09:55:58,525 INFO L146 ILogger]: Start isEmpty. Operand 147 states and 147 transitions. [2019-05-23 09:55:58,525 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 147 [2019-05-23 09:55:58,525 INFO L146 ILogger]: Found error trace [2019-05-23 09:55:58,526 INFO L146 ILogger]: trace histogram [144, 1, 1] [2019-05-23 09:55:58,526 INFO L146 ILogger]: === Iteration 145 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:55:58,526 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:55:58,526 INFO L146 ILogger]: Analyzing trace with hash -1684371262, now seen corresponding path program 144 times [2019-05-23 09:55:58,526 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:55:58,597 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:55:58,606 INFO L146 ILogger]: Trace formula consists of 1733 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:55:58,608 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:05,294 INFO L146 ILogger]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:05,294 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:05,294 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 09:56:05,294 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 09:56:05,295 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 09:56:05,296 INFO L146 ILogger]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:56:05,296 INFO L146 ILogger]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2019-05-23 09:56:05,583 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:05,583 INFO L146 ILogger]: Finished difference Result 148 states and 148 transitions. [2019-05-23 09:56:05,583 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 09:56:05,583 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 146 [2019-05-23 09:56:05,584 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:05,584 INFO L146 ILogger]: With dead ends: 148 [2019-05-23 09:56:05,584 INFO L146 ILogger]: Without dead ends: 148 [2019-05-23 09:56:05,585 INFO L146 ILogger]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:56:05,585 INFO L146 ILogger]: Start minimizeSevpa. Operand 148 states. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Start removeUnreachable. Operand 148 states. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2019-05-23 09:56:05,586 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Abstraction has 148 states and 148 transitions. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 09:56:05,586 INFO L146 ILogger]: Start isEmpty. Operand 148 states and 148 transitions. [2019-05-23 09:56:05,587 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 148 [2019-05-23 09:56:05,587 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:05,587 INFO L146 ILogger]: trace histogram [145, 1, 1] [2019-05-23 09:56:05,587 INFO L146 ILogger]: === Iteration 146 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:05,587 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:05,587 INFO L146 ILogger]: Analyzing trace with hash -675901530, now seen corresponding path program 145 times [2019-05-23 09:56:05,588 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:05,659 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:05,668 INFO L146 ILogger]: Trace formula consists of 1745 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 09:56:05,670 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:12,487 INFO L146 ILogger]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:12,488 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:12,488 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-05-23 09:56:12,488 INFO L146 ILogger]: Interpolant automaton has 148 states [2019-05-23 09:56:12,489 INFO L146 ILogger]: Constructing interpolant automaton starting with 148 interpolants. [2019-05-23 09:56:12,490 INFO L146 ILogger]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 09:56:12,490 INFO L146 ILogger]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2019-05-23 09:56:12,831 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:12,831 INFO L146 ILogger]: Finished difference Result 149 states and 149 transitions. [2019-05-23 09:56:12,832 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-05-23 09:56:12,832 INFO L146 ILogger]: Start accepts. Automaton has 148 states. Word has length 147 [2019-05-23 09:56:12,832 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:12,832 INFO L146 ILogger]: With dead ends: 149 [2019-05-23 09:56:12,832 INFO L146 ILogger]: Without dead ends: 149 [2019-05-23 09:56:12,833 INFO L146 ILogger]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 09:56:12,833 INFO L146 ILogger]: Start minimizeSevpa. Operand 149 states. [2019-05-23 09:56:12,834 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-05-23 09:56:12,834 INFO L146 ILogger]: Start removeUnreachable. Operand 149 states. [2019-05-23 09:56:12,834 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-05-23 09:56:12,835 INFO L146 ILogger]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2019-05-23 09:56:12,835 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:12,835 INFO L146 ILogger]: Abstraction has 149 states and 149 transitions. [2019-05-23 09:56:12,835 INFO L146 ILogger]: Interpolant automaton has 148 states. [2019-05-23 09:56:12,835 INFO L146 ILogger]: Start isEmpty. Operand 149 states and 149 transitions. [2019-05-23 09:56:12,835 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 149 [2019-05-23 09:56:12,835 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:12,835 INFO L146 ILogger]: trace histogram [146, 1, 1] [2019-05-23 09:56:12,835 INFO L146 ILogger]: === Iteration 147 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:12,836 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:12,836 INFO L146 ILogger]: Analyzing trace with hash 521889090, now seen corresponding path program 146 times [2019-05-23 09:56:12,836 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:12,922 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:12,931 INFO L146 ILogger]: Trace formula consists of 1757 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 09:56:12,932 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:19,841 INFO L146 ILogger]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:19,842 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:19,842 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 09:56:19,842 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 09:56:19,843 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 09:56:19,844 INFO L146 ILogger]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:56:19,844 INFO L146 ILogger]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2019-05-23 09:56:20,154 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:20,154 INFO L146 ILogger]: Finished difference Result 150 states and 150 transitions. [2019-05-23 09:56:20,154 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-05-23 09:56:20,155 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 148 [2019-05-23 09:56:20,155 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:20,155 INFO L146 ILogger]: With dead ends: 150 [2019-05-23 09:56:20,155 INFO L146 ILogger]: Without dead ends: 150 [2019-05-23 09:56:20,156 INFO L146 ILogger]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:56:20,156 INFO L146 ILogger]: Start minimizeSevpa. Operand 150 states. [2019-05-23 09:56:20,157 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-05-23 09:56:20,157 INFO L146 ILogger]: Start removeUnreachable. Operand 150 states. [2019-05-23 09:56:20,157 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-05-23 09:56:20,157 INFO L146 ILogger]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2019-05-23 09:56:20,157 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:20,157 INFO L146 ILogger]: Abstraction has 150 states and 150 transitions. [2019-05-23 09:56:20,158 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 09:56:20,158 INFO L146 ILogger]: Start isEmpty. Operand 150 states and 150 transitions. [2019-05-23 09:56:20,158 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 150 [2019-05-23 09:56:20,158 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:20,158 INFO L146 ILogger]: trace histogram [147, 1, 1] [2019-05-23 09:56:20,158 INFO L146 ILogger]: === Iteration 148 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:20,158 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:20,158 INFO L146 ILogger]: Analyzing trace with hash -1001307354, now seen corresponding path program 147 times [2019-05-23 09:56:20,159 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:20,232 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:20,242 INFO L146 ILogger]: Trace formula consists of 1769 conjuncts, 149 conjunts are in the unsatisfiable core [2019-05-23 09:56:20,243 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:27,302 INFO L146 ILogger]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:27,302 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:27,302 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2019-05-23 09:56:27,303 INFO L146 ILogger]: Interpolant automaton has 150 states [2019-05-23 09:56:27,304 INFO L146 ILogger]: Constructing interpolant automaton starting with 150 interpolants. [2019-05-23 09:56:27,304 INFO L146 ILogger]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-05-23 09:56:27,304 INFO L146 ILogger]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2019-05-23 09:56:27,622 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:27,622 INFO L146 ILogger]: Finished difference Result 151 states and 151 transitions. [2019-05-23 09:56:27,623 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 09:56:27,623 INFO L146 ILogger]: Start accepts. Automaton has 150 states. Word has length 149 [2019-05-23 09:56:27,623 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:27,623 INFO L146 ILogger]: With dead ends: 151 [2019-05-23 09:56:27,623 INFO L146 ILogger]: Without dead ends: 151 [2019-05-23 09:56:27,624 INFO L146 ILogger]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-05-23 09:56:27,624 INFO L146 ILogger]: Start minimizeSevpa. Operand 151 states. [2019-05-23 09:56:27,625 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-05-23 09:56:27,625 INFO L146 ILogger]: Start removeUnreachable. Operand 151 states. [2019-05-23 09:56:27,625 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-05-23 09:56:27,625 INFO L146 ILogger]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2019-05-23 09:56:27,625 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:27,625 INFO L146 ILogger]: Abstraction has 151 states and 151 transitions. [2019-05-23 09:56:27,626 INFO L146 ILogger]: Interpolant automaton has 150 states. [2019-05-23 09:56:27,626 INFO L146 ILogger]: Start isEmpty. Operand 151 states and 151 transitions. [2019-05-23 09:56:27,626 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 151 [2019-05-23 09:56:27,626 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:27,626 INFO L146 ILogger]: trace histogram [148, 1, 1] [2019-05-23 09:56:27,627 INFO L146 ILogger]: === Iteration 149 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:27,627 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:27,627 INFO L146 ILogger]: Analyzing trace with hash -975756862, now seen corresponding path program 148 times [2019-05-23 09:56:27,627 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:27,700 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:27,716 INFO L146 ILogger]: Trace formula consists of 1781 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:56:27,718 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:34,878 INFO L146 ILogger]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:34,878 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:34,878 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 09:56:34,879 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 09:56:34,880 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 09:56:34,880 INFO L146 ILogger]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:56:34,880 INFO L146 ILogger]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2019-05-23 09:56:35,199 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:35,200 INFO L146 ILogger]: Finished difference Result 152 states and 152 transitions. [2019-05-23 09:56:35,200 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-05-23 09:56:35,200 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 150 [2019-05-23 09:56:35,200 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:35,201 INFO L146 ILogger]: With dead ends: 152 [2019-05-23 09:56:35,201 INFO L146 ILogger]: Without dead ends: 152 [2019-05-23 09:56:35,202 INFO L146 ILogger]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:56:35,202 INFO L146 ILogger]: Start minimizeSevpa. Operand 152 states. [2019-05-23 09:56:35,203 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-05-23 09:56:35,204 INFO L146 ILogger]: Start removeUnreachable. Operand 152 states. [2019-05-23 09:56:35,204 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-05-23 09:56:35,204 INFO L146 ILogger]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2019-05-23 09:56:35,204 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:35,204 INFO L146 ILogger]: Abstraction has 152 states and 152 transitions. [2019-05-23 09:56:35,204 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 09:56:35,204 INFO L146 ILogger]: Start isEmpty. Operand 152 states and 152 transitions. [2019-05-23 09:56:35,205 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 152 [2019-05-23 09:56:35,205 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:35,205 INFO L146 ILogger]: trace histogram [149, 1, 1] [2019-05-23 09:56:35,205 INFO L146 ILogger]: === Iteration 150 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:35,206 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:35,206 INFO L146 ILogger]: Analyzing trace with hash -183691610, now seen corresponding path program 149 times [2019-05-23 09:56:35,206 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:35,305 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:35,318 INFO L146 ILogger]: Trace formula consists of 1793 conjuncts, 151 conjunts are in the unsatisfiable core [2019-05-23 09:56:35,320 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:42,501 INFO L146 ILogger]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:42,501 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:42,502 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2019-05-23 09:56:42,502 INFO L146 ILogger]: Interpolant automaton has 152 states [2019-05-23 09:56:42,503 INFO L146 ILogger]: Constructing interpolant automaton starting with 152 interpolants. [2019-05-23 09:56:42,503 INFO L146 ILogger]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 09:56:42,503 INFO L146 ILogger]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2019-05-23 09:56:42,849 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:42,850 INFO L146 ILogger]: Finished difference Result 153 states and 153 transitions. [2019-05-23 09:56:42,850 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-05-23 09:56:42,850 INFO L146 ILogger]: Start accepts. Automaton has 152 states. Word has length 151 [2019-05-23 09:56:42,850 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:42,850 INFO L146 ILogger]: With dead ends: 153 [2019-05-23 09:56:42,850 INFO L146 ILogger]: Without dead ends: 153 [2019-05-23 09:56:42,851 INFO L146 ILogger]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 09:56:42,851 INFO L146 ILogger]: Start minimizeSevpa. Operand 153 states. [2019-05-23 09:56:42,852 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-05-23 09:56:42,852 INFO L146 ILogger]: Start removeUnreachable. Operand 153 states. [2019-05-23 09:56:42,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-05-23 09:56:42,853 INFO L146 ILogger]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2019-05-23 09:56:42,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:42,853 INFO L146 ILogger]: Abstraction has 153 states and 153 transitions. [2019-05-23 09:56:42,853 INFO L146 ILogger]: Interpolant automaton has 152 states. [2019-05-23 09:56:42,853 INFO L146 ILogger]: Start isEmpty. Operand 153 states and 153 transitions. [2019-05-23 09:56:42,854 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 153 [2019-05-23 09:56:42,854 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:42,854 INFO L146 ILogger]: trace histogram [150, 1, 1] [2019-05-23 09:56:42,854 INFO L146 ILogger]: === Iteration 151 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:42,854 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:42,854 INFO L146 ILogger]: Analyzing trace with hash -1399472574, now seen corresponding path program 150 times [2019-05-23 09:56:42,855 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:42,930 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:42,941 INFO L146 ILogger]: Trace formula consists of 1805 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 09:56:42,942 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:50,225 INFO L146 ILogger]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:50,225 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:50,225 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 09:56:50,226 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 09:56:50,227 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 09:56:50,227 INFO L146 ILogger]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:56:50,227 INFO L146 ILogger]: Start difference. First operand 153 states and 153 transitions. Second operand 153 states. [2019-05-23 09:56:50,545 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:50,545 INFO L146 ILogger]: Finished difference Result 154 states and 154 transitions. [2019-05-23 09:56:50,545 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 09:56:50,545 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 152 [2019-05-23 09:56:50,546 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:50,546 INFO L146 ILogger]: With dead ends: 154 [2019-05-23 09:56:50,546 INFO L146 ILogger]: Without dead ends: 154 [2019-05-23 09:56:50,547 INFO L146 ILogger]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:56:50,547 INFO L146 ILogger]: Start minimizeSevpa. Operand 154 states. [2019-05-23 09:56:50,548 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-05-23 09:56:50,548 INFO L146 ILogger]: Start removeUnreachable. Operand 154 states. [2019-05-23 09:56:50,548 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-05-23 09:56:50,549 INFO L146 ILogger]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2019-05-23 09:56:50,549 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:50,549 INFO L146 ILogger]: Abstraction has 154 states and 154 transitions. [2019-05-23 09:56:50,549 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 09:56:50,549 INFO L146 ILogger]: Start isEmpty. Operand 154 states and 154 transitions. [2019-05-23 09:56:50,550 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 154 [2019-05-23 09:56:50,550 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:50,550 INFO L146 ILogger]: trace histogram [151, 1, 1] [2019-05-23 09:56:50,550 INFO L146 ILogger]: === Iteration 152 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:50,550 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:50,550 INFO L146 ILogger]: Analyzing trace with hash -433976794, now seen corresponding path program 151 times [2019-05-23 09:56:50,551 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:50,627 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:50,637 INFO L146 ILogger]: Trace formula consists of 1817 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 09:56:50,639 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:56:57,997 INFO L146 ILogger]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:56:57,997 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:56:57,998 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2019-05-23 09:56:57,998 INFO L146 ILogger]: Interpolant automaton has 154 states [2019-05-23 09:56:57,999 INFO L146 ILogger]: Constructing interpolant automaton starting with 154 interpolants. [2019-05-23 09:56:58,000 INFO L146 ILogger]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 09:56:58,000 INFO L146 ILogger]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2019-05-23 09:56:58,363 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:56:58,363 INFO L146 ILogger]: Finished difference Result 155 states and 155 transitions. [2019-05-23 09:56:58,364 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-05-23 09:56:58,364 INFO L146 ILogger]: Start accepts. Automaton has 154 states. Word has length 153 [2019-05-23 09:56:58,364 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:56:58,364 INFO L146 ILogger]: With dead ends: 155 [2019-05-23 09:56:58,365 INFO L146 ILogger]: Without dead ends: 155 [2019-05-23 09:56:58,366 INFO L146 ILogger]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 09:56:58,366 INFO L146 ILogger]: Start minimizeSevpa. Operand 155 states. [2019-05-23 09:56:58,367 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-05-23 09:56:58,367 INFO L146 ILogger]: Start removeUnreachable. Operand 155 states. [2019-05-23 09:56:58,368 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-05-23 09:56:58,368 INFO L146 ILogger]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2019-05-23 09:56:58,368 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:56:58,368 INFO L146 ILogger]: Abstraction has 155 states and 155 transitions. [2019-05-23 09:56:58,368 INFO L146 ILogger]: Interpolant automaton has 154 states. [2019-05-23 09:56:58,369 INFO L146 ILogger]: Start isEmpty. Operand 155 states and 155 transitions. [2019-05-23 09:56:58,369 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 155 [2019-05-23 09:56:58,369 INFO L146 ILogger]: Found error trace [2019-05-23 09:56:58,369 INFO L146 ILogger]: trace histogram [152, 1, 1] [2019-05-23 09:56:58,369 INFO L146 ILogger]: === Iteration 153 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:56:58,369 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:56:58,370 INFO L146 ILogger]: Analyzing trace with hash -568378686, now seen corresponding path program 152 times [2019-05-23 09:56:58,370 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:56:58,447 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:56:58,458 INFO L146 ILogger]: Trace formula consists of 1829 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:56:58,459 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:05,980 INFO L146 ILogger]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:05,981 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:05,981 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 09:57:05,981 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 09:57:05,983 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 09:57:05,984 INFO L146 ILogger]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:57:05,984 INFO L146 ILogger]: Start difference. First operand 155 states and 155 transitions. Second operand 155 states. [2019-05-23 09:57:06,305 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:06,305 INFO L146 ILogger]: Finished difference Result 156 states and 156 transitions. [2019-05-23 09:57:06,305 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-05-23 09:57:06,305 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 154 [2019-05-23 09:57:06,306 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:06,306 INFO L146 ILogger]: With dead ends: 156 [2019-05-23 09:57:06,306 INFO L146 ILogger]: Without dead ends: 156 [2019-05-23 09:57:06,307 INFO L146 ILogger]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:57:06,307 INFO L146 ILogger]: Start minimizeSevpa. Operand 156 states. [2019-05-23 09:57:06,308 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-05-23 09:57:06,308 INFO L146 ILogger]: Start removeUnreachable. Operand 156 states. [2019-05-23 09:57:06,308 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-05-23 09:57:06,308 INFO L146 ILogger]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2019-05-23 09:57:06,309 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:06,309 INFO L146 ILogger]: Abstraction has 156 states and 156 transitions. [2019-05-23 09:57:06,309 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 09:57:06,309 INFO L146 ILogger]: Start isEmpty. Operand 156 states and 156 transitions. [2019-05-23 09:57:06,309 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 156 [2019-05-23 09:57:06,309 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:06,309 INFO L146 ILogger]: trace histogram [153, 1, 1] [2019-05-23 09:57:06,309 INFO L146 ILogger]: === Iteration 154 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:06,310 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:06,310 INFO L146 ILogger]: Analyzing trace with hash -439870042, now seen corresponding path program 153 times [2019-05-23 09:57:06,310 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:06,389 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:06,399 INFO L146 ILogger]: Trace formula consists of 1841 conjuncts, 155 conjunts are in the unsatisfiable core [2019-05-23 09:57:06,401 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:14,005 INFO L146 ILogger]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:14,005 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:14,006 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2019-05-23 09:57:14,006 INFO L146 ILogger]: Interpolant automaton has 156 states [2019-05-23 09:57:14,008 INFO L146 ILogger]: Constructing interpolant automaton starting with 156 interpolants. [2019-05-23 09:57:14,008 INFO L146 ILogger]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 09:57:14,008 INFO L146 ILogger]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2019-05-23 09:57:14,375 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:14,375 INFO L146 ILogger]: Finished difference Result 157 states and 157 transitions. [2019-05-23 09:57:14,375 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 09:57:14,376 INFO L146 ILogger]: Start accepts. Automaton has 156 states. Word has length 155 [2019-05-23 09:57:14,376 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:14,376 INFO L146 ILogger]: With dead ends: 157 [2019-05-23 09:57:14,376 INFO L146 ILogger]: Without dead ends: 157 [2019-05-23 09:57:14,377 INFO L146 ILogger]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 09:57:14,377 INFO L146 ILogger]: Start minimizeSevpa. Operand 157 states. [2019-05-23 09:57:14,378 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-05-23 09:57:14,379 INFO L146 ILogger]: Start removeUnreachable. Operand 157 states. [2019-05-23 09:57:14,379 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-05-23 09:57:14,379 INFO L146 ILogger]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2019-05-23 09:57:14,379 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:14,379 INFO L146 ILogger]: Abstraction has 157 states and 157 transitions. [2019-05-23 09:57:14,380 INFO L146 ILogger]: Interpolant automaton has 156 states. [2019-05-23 09:57:14,380 INFO L146 ILogger]: Start isEmpty. Operand 157 states and 157 transitions. [2019-05-23 09:57:14,380 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 157 [2019-05-23 09:57:14,380 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:14,380 INFO L146 ILogger]: trace histogram [154, 1, 1] [2019-05-23 09:57:14,381 INFO L146 ILogger]: === Iteration 155 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:14,381 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:14,381 INFO L146 ILogger]: Analyzing trace with hash -751069374, now seen corresponding path program 154 times [2019-05-23 09:57:14,381 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:14,460 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:14,471 INFO L146 ILogger]: Trace formula consists of 1853 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:57:14,472 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:22,143 INFO L146 ILogger]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:22,143 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:22,143 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 09:57:22,143 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 09:57:22,144 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 09:57:22,145 INFO L146 ILogger]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:57:22,145 INFO L146 ILogger]: Start difference. First operand 157 states and 157 transitions. Second operand 157 states. [2019-05-23 09:57:22,476 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:22,477 INFO L146 ILogger]: Finished difference Result 158 states and 158 transitions. [2019-05-23 09:57:22,477 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-05-23 09:57:22,477 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 156 [2019-05-23 09:57:22,477 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:22,478 INFO L146 ILogger]: With dead ends: 158 [2019-05-23 09:57:22,478 INFO L146 ILogger]: Without dead ends: 158 [2019-05-23 09:57:22,479 INFO L146 ILogger]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:57:22,479 INFO L146 ILogger]: Start minimizeSevpa. Operand 158 states. [2019-05-23 09:57:22,480 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-05-23 09:57:22,480 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:57:22,481 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-05-23 09:57:22,481 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2019-05-23 09:57:22,481 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:22,481 INFO L146 ILogger]: Abstraction has 158 states and 158 transitions. [2019-05-23 09:57:22,481 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 09:57:22,482 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 158 transitions. [2019-05-23 09:57:22,482 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:57:22,482 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:22,482 INFO L146 ILogger]: trace histogram [155, 1, 1] [2019-05-23 09:57:22,482 INFO L146 ILogger]: === Iteration 156 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:22,483 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:22,483 INFO L146 ILogger]: Analyzing trace with hash -1808314074, now seen corresponding path program 155 times [2019-05-23 09:57:22,483 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:22,564 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:22,574 INFO L146 ILogger]: Trace formula consists of 1865 conjuncts, 157 conjunts are in the unsatisfiable core [2019-05-23 09:57:22,576 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:30,377 INFO L146 ILogger]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:30,377 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:30,377 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2019-05-23 09:57:30,377 INFO L146 ILogger]: Interpolant automaton has 158 states [2019-05-23 09:57:30,378 INFO L146 ILogger]: Constructing interpolant automaton starting with 158 interpolants. [2019-05-23 09:57:30,379 INFO L146 ILogger]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 09:57:30,379 INFO L146 ILogger]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2019-05-23 09:57:30,706 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:30,706 INFO L146 ILogger]: Finished difference Result 159 states and 159 transitions. [2019-05-23 09:57:30,706 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-05-23 09:57:30,706 INFO L146 ILogger]: Start accepts. Automaton has 158 states. Word has length 157 [2019-05-23 09:57:30,707 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:30,707 INFO L146 ILogger]: With dead ends: 159 [2019-05-23 09:57:30,707 INFO L146 ILogger]: Without dead ends: 159 [2019-05-23 09:57:30,708 INFO L146 ILogger]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 09:57:30,708 INFO L146 ILogger]: Start minimizeSevpa. Operand 159 states. [2019-05-23 09:57:30,709 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-05-23 09:57:30,709 INFO L146 ILogger]: Start removeUnreachable. Operand 159 states. [2019-05-23 09:57:30,709 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-05-23 09:57:30,709 INFO L146 ILogger]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2019-05-23 09:57:30,709 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:30,709 INFO L146 ILogger]: Abstraction has 159 states and 159 transitions. [2019-05-23 09:57:30,710 INFO L146 ILogger]: Interpolant automaton has 158 states. [2019-05-23 09:57:30,710 INFO L146 ILogger]: Start isEmpty. Operand 159 states and 159 transitions. [2019-05-23 09:57:30,710 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 159 [2019-05-23 09:57:30,710 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:30,710 INFO L146 ILogger]: trace histogram [156, 1, 1] [2019-05-23 09:57:30,711 INFO L146 ILogger]: === Iteration 157 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:30,711 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:30,711 INFO L146 ILogger]: Analyzing trace with hash -223161406, now seen corresponding path program 156 times [2019-05-23 09:57:30,711 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:30,791 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:30,802 INFO L146 ILogger]: Trace formula consists of 1877 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:57:30,803 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:38,690 INFO L146 ILogger]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:38,691 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:38,691 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 09:57:38,691 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 09:57:38,692 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 09:57:38,693 INFO L146 ILogger]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:57:38,693 INFO L146 ILogger]: Start difference. First operand 159 states and 159 transitions. Second operand 159 states. [2019-05-23 09:57:39,066 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:39,066 INFO L146 ILogger]: Finished difference Result 160 states and 160 transitions. [2019-05-23 09:57:39,066 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 09:57:39,066 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 158 [2019-05-23 09:57:39,067 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:39,067 INFO L146 ILogger]: With dead ends: 160 [2019-05-23 09:57:39,067 INFO L146 ILogger]: Without dead ends: 160 [2019-05-23 09:57:39,068 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:57:39,068 INFO L146 ILogger]: Start minimizeSevpa. Operand 160 states. [2019-05-23 09:57:39,069 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-05-23 09:57:39,069 INFO L146 ILogger]: Start removeUnreachable. Operand 160 states. [2019-05-23 09:57:39,069 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-05-23 09:57:39,069 INFO L146 ILogger]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2019-05-23 09:57:39,069 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:39,069 INFO L146 ILogger]: Abstraction has 160 states and 160 transitions. [2019-05-23 09:57:39,069 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 09:57:39,070 INFO L146 ILogger]: Start isEmpty. Operand 160 states and 160 transitions. [2019-05-23 09:57:39,070 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 160 [2019-05-23 09:57:39,070 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:39,070 INFO L146 ILogger]: trace histogram [157, 1, 1] [2019-05-23 09:57:39,070 INFO L146 ILogger]: === Iteration 158 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:39,070 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:39,070 INFO L146 ILogger]: Analyzing trace with hash 1671931046, now seen corresponding path program 157 times [2019-05-23 09:57:39,071 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:39,153 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:39,164 INFO L146 ILogger]: Trace formula consists of 1889 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 09:57:39,165 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:47,179 INFO L146 ILogger]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:47,180 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:47,180 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2019-05-23 09:57:47,180 INFO L146 ILogger]: Interpolant automaton has 160 states [2019-05-23 09:57:47,181 INFO L146 ILogger]: Constructing interpolant automaton starting with 160 interpolants. [2019-05-23 09:57:47,182 INFO L146 ILogger]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 09:57:47,182 INFO L146 ILogger]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2019-05-23 09:57:47,542 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:47,543 INFO L146 ILogger]: Finished difference Result 161 states and 161 transitions. [2019-05-23 09:57:47,543 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-05-23 09:57:47,543 INFO L146 ILogger]: Start accepts. Automaton has 160 states. Word has length 159 [2019-05-23 09:57:47,544 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:47,544 INFO L146 ILogger]: With dead ends: 161 [2019-05-23 09:57:47,544 INFO L146 ILogger]: Without dead ends: 161 [2019-05-23 09:57:47,545 INFO L146 ILogger]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 09:57:47,545 INFO L146 ILogger]: Start minimizeSevpa. Operand 161 states. [2019-05-23 09:57:47,546 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-05-23 09:57:47,547 INFO L146 ILogger]: Start removeUnreachable. Operand 161 states. [2019-05-23 09:57:47,547 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-05-23 09:57:47,547 INFO L146 ILogger]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2019-05-23 09:57:47,547 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:47,547 INFO L146 ILogger]: Abstraction has 161 states and 161 transitions. [2019-05-23 09:57:47,547 INFO L146 ILogger]: Interpolant automaton has 160 states. [2019-05-23 09:57:47,548 INFO L146 ILogger]: Start isEmpty. Operand 161 states and 161 transitions. [2019-05-23 09:57:47,548 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 161 [2019-05-23 09:57:47,548 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:47,548 INFO L146 ILogger]: trace histogram [158, 1, 1] [2019-05-23 09:57:47,548 INFO L146 ILogger]: === Iteration 159 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:47,549 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:47,549 INFO L146 ILogger]: Analyzing trace with hash 290254914, now seen corresponding path program 158 times [2019-05-23 09:57:47,549 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:47,632 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:47,643 INFO L146 ILogger]: Trace formula consists of 1901 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 09:57:47,644 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:57:55,705 INFO L146 ILogger]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:57:55,705 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:57:55,706 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 09:57:55,706 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 09:57:55,708 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 09:57:55,708 INFO L146 ILogger]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:57:55,709 INFO L146 ILogger]: Start difference. First operand 161 states and 161 transitions. Second operand 161 states. [2019-05-23 09:57:56,061 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:57:56,061 INFO L146 ILogger]: Finished difference Result 162 states and 162 transitions. [2019-05-23 09:57:56,062 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-05-23 09:57:56,062 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 160 [2019-05-23 09:57:56,062 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:57:56,062 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:57:56,062 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 09:57:56,063 INFO L146 ILogger]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:57:56,063 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 09:57:56,064 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-05-23 09:57:56,064 INFO L146 ILogger]: Start removeUnreachable. Operand 162 states. [2019-05-23 09:57:56,065 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-05-23 09:57:56,065 INFO L146 ILogger]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2019-05-23 09:57:56,065 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:57:56,065 INFO L146 ILogger]: Abstraction has 162 states and 162 transitions. [2019-05-23 09:57:56,065 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 09:57:56,065 INFO L146 ILogger]: Start isEmpty. Operand 162 states and 162 transitions. [2019-05-23 09:57:56,066 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 162 [2019-05-23 09:57:56,066 INFO L146 ILogger]: Found error trace [2019-05-23 09:57:56,066 INFO L146 ILogger]: trace histogram [159, 1, 1] [2019-05-23 09:57:56,066 INFO L146 ILogger]: === Iteration 160 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:57:56,066 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:57:56,067 INFO L146 ILogger]: Analyzing trace with hash 407967782, now seen corresponding path program 159 times [2019-05-23 09:57:56,067 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:57:56,177 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:57:56,196 INFO L146 ILogger]: Trace formula consists of 1913 conjuncts, 161 conjunts are in the unsatisfiable core [2019-05-23 09:57:56,198 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:04,481 INFO L146 ILogger]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:04,481 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:04,481 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2019-05-23 09:58:04,481 INFO L146 ILogger]: Interpolant automaton has 162 states [2019-05-23 09:58:04,483 INFO L146 ILogger]: Constructing interpolant automaton starting with 162 interpolants. [2019-05-23 09:58:04,483 INFO L146 ILogger]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-05-23 09:58:04,484 INFO L146 ILogger]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2019-05-23 09:58:04,865 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:04,865 INFO L146 ILogger]: Finished difference Result 163 states and 163 transitions. [2019-05-23 09:58:04,865 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 09:58:04,865 INFO L146 ILogger]: Start accepts. Automaton has 162 states. Word has length 161 [2019-05-23 09:58:04,866 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:04,866 INFO L146 ILogger]: With dead ends: 163 [2019-05-23 09:58:04,866 INFO L146 ILogger]: Without dead ends: 163 [2019-05-23 09:58:04,867 INFO L146 ILogger]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-05-23 09:58:04,867 INFO L146 ILogger]: Start minimizeSevpa. Operand 163 states. [2019-05-23 09:58:04,868 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-05-23 09:58:04,868 INFO L146 ILogger]: Start removeUnreachable. Operand 163 states. [2019-05-23 09:58:04,868 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-05-23 09:58:04,868 INFO L146 ILogger]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2019-05-23 09:58:04,868 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:04,869 INFO L146 ILogger]: Abstraction has 163 states and 163 transitions. [2019-05-23 09:58:04,869 INFO L146 ILogger]: Interpolant automaton has 162 states. [2019-05-23 09:58:04,869 INFO L146 ILogger]: Start isEmpty. Operand 163 states and 163 transitions. [2019-05-23 09:58:04,869 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 163 [2019-05-23 09:58:04,869 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:04,869 INFO L146 ILogger]: trace histogram [160, 1, 1] [2019-05-23 09:58:04,869 INFO L146 ILogger]: === Iteration 161 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:04,869 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:04,870 INFO L146 ILogger]: Analyzing trace with hash -237900606, now seen corresponding path program 160 times [2019-05-23 09:58:04,870 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:04,955 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:04,967 INFO L146 ILogger]: Trace formula consists of 1925 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:58:04,968 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:13,183 INFO L146 ILogger]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:13,183 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:13,183 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 09:58:13,183 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 09:58:13,185 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 09:58:13,185 INFO L146 ILogger]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:58:13,185 INFO L146 ILogger]: Start difference. First operand 163 states and 163 transitions. Second operand 163 states. [2019-05-23 09:58:13,586 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:13,586 INFO L146 ILogger]: Finished difference Result 164 states and 164 transitions. [2019-05-23 09:58:13,587 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-05-23 09:58:13,587 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 162 [2019-05-23 09:58:13,587 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:13,588 INFO L146 ILogger]: With dead ends: 164 [2019-05-23 09:58:13,588 INFO L146 ILogger]: Without dead ends: 164 [2019-05-23 09:58:13,589 INFO L146 ILogger]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:58:13,589 INFO L146 ILogger]: Start minimizeSevpa. Operand 164 states. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Start removeUnreachable. Operand 164 states. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2019-05-23 09:58:13,590 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Abstraction has 164 states and 164 transitions. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 09:58:13,590 INFO L146 ILogger]: Start isEmpty. Operand 164 states and 164 transitions. [2019-05-23 09:58:13,591 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 164 [2019-05-23 09:58:13,591 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:13,591 INFO L146 ILogger]: trace histogram [161, 1, 1] [2019-05-23 09:58:13,591 INFO L146 ILogger]: === Iteration 162 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:13,591 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:13,591 INFO L146 ILogger]: Analyzing trace with hash 1215015846, now seen corresponding path program 161 times [2019-05-23 09:58:13,592 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:13,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:13,689 INFO L146 ILogger]: Trace formula consists of 1937 conjuncts, 163 conjunts are in the unsatisfiable core [2019-05-23 09:58:13,691 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:22,124 INFO L146 ILogger]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:22,124 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:22,124 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2019-05-23 09:58:22,124 INFO L146 ILogger]: Interpolant automaton has 164 states [2019-05-23 09:58:22,126 INFO L146 ILogger]: Constructing interpolant automaton starting with 164 interpolants. [2019-05-23 09:58:22,126 INFO L146 ILogger]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 09:58:22,126 INFO L146 ILogger]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2019-05-23 09:58:22,524 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:22,524 INFO L146 ILogger]: Finished difference Result 165 states and 165 transitions. [2019-05-23 09:58:22,525 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-05-23 09:58:22,525 INFO L146 ILogger]: Start accepts. Automaton has 164 states. Word has length 163 [2019-05-23 09:58:22,525 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:22,526 INFO L146 ILogger]: With dead ends: 165 [2019-05-23 09:58:22,526 INFO L146 ILogger]: Without dead ends: 165 [2019-05-23 09:58:22,527 INFO L146 ILogger]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 09:58:22,527 INFO L146 ILogger]: Start minimizeSevpa. Operand 165 states. [2019-05-23 09:58:22,529 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-05-23 09:58:22,529 INFO L146 ILogger]: Start removeUnreachable. Operand 165 states. [2019-05-23 09:58:22,529 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-05-23 09:58:22,529 INFO L146 ILogger]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2019-05-23 09:58:22,529 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:22,529 INFO L146 ILogger]: Abstraction has 165 states and 165 transitions. [2019-05-23 09:58:22,530 INFO L146 ILogger]: Interpolant automaton has 164 states. [2019-05-23 09:58:22,530 INFO L146 ILogger]: Start isEmpty. Operand 165 states and 165 transitions. [2019-05-23 09:58:22,530 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 165 [2019-05-23 09:58:22,530 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:22,530 INFO L146 ILogger]: trace histogram [162, 1, 1] [2019-05-23 09:58:22,530 INFO L146 ILogger]: === Iteration 163 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:22,531 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:22,531 INFO L146 ILogger]: Analyzing trace with hash -989214398, now seen corresponding path program 162 times [2019-05-23 09:58:22,531 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:22,634 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:22,647 INFO L146 ILogger]: Trace formula consists of 1949 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 09:58:22,649 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:31,081 INFO L146 ILogger]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:31,082 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:31,082 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 09:58:31,082 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 09:58:31,084 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 09:58:31,085 INFO L146 ILogger]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:58:31,085 INFO L146 ILogger]: Start difference. First operand 165 states and 165 transitions. Second operand 165 states. [2019-05-23 09:58:31,560 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:31,560 INFO L146 ILogger]: Finished difference Result 166 states and 166 transitions. [2019-05-23 09:58:31,561 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 09:58:31,561 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 164 [2019-05-23 09:58:31,561 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:31,561 INFO L146 ILogger]: With dead ends: 166 [2019-05-23 09:58:31,561 INFO L146 ILogger]: Without dead ends: 166 [2019-05-23 09:58:31,563 INFO L146 ILogger]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:58:31,563 INFO L146 ILogger]: Start minimizeSevpa. Operand 166 states. [2019-05-23 09:58:31,564 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-05-23 09:58:31,564 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 09:58:31,565 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-05-23 09:58:31,565 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2019-05-23 09:58:31,565 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:31,565 INFO L146 ILogger]: Abstraction has 166 states and 166 transitions. [2019-05-23 09:58:31,565 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 09:58:31,565 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 166 transitions. [2019-05-23 09:58:31,566 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 166 [2019-05-23 09:58:31,566 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:31,566 INFO L146 ILogger]: trace histogram [163, 1, 1] [2019-05-23 09:58:31,566 INFO L146 ILogger]: === Iteration 164 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:31,566 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:31,566 INFO L146 ILogger]: Analyzing trace with hash -600875226, now seen corresponding path program 163 times [2019-05-23 09:58:31,567 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:31,725 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:31,745 INFO L146 ILogger]: Trace formula consists of 1961 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 09:58:31,747 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:40,329 INFO L146 ILogger]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:40,329 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:40,329 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2019-05-23 09:58:40,329 INFO L146 ILogger]: Interpolant automaton has 166 states [2019-05-23 09:58:40,331 INFO L146 ILogger]: Constructing interpolant automaton starting with 166 interpolants. [2019-05-23 09:58:40,332 INFO L146 ILogger]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 09:58:40,332 INFO L146 ILogger]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2019-05-23 09:58:40,764 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:40,764 INFO L146 ILogger]: Finished difference Result 167 states and 167 transitions. [2019-05-23 09:58:40,764 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-05-23 09:58:40,764 INFO L146 ILogger]: Start accepts. Automaton has 166 states. Word has length 165 [2019-05-23 09:58:40,765 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:40,765 INFO L146 ILogger]: With dead ends: 167 [2019-05-23 09:58:40,765 INFO L146 ILogger]: Without dead ends: 167 [2019-05-23 09:58:40,767 INFO L146 ILogger]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 09:58:40,767 INFO L146 ILogger]: Start minimizeSevpa. Operand 167 states. [2019-05-23 09:58:40,767 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-05-23 09:58:40,768 INFO L146 ILogger]: Start removeUnreachable. Operand 167 states. [2019-05-23 09:58:40,768 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-05-23 09:58:40,768 INFO L146 ILogger]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2019-05-23 09:58:40,768 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:40,768 INFO L146 ILogger]: Abstraction has 167 states and 167 transitions. [2019-05-23 09:58:40,768 INFO L146 ILogger]: Interpolant automaton has 166 states. [2019-05-23 09:58:40,768 INFO L146 ILogger]: Start isEmpty. Operand 167 states and 167 transitions. [2019-05-23 09:58:40,769 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 167 [2019-05-23 09:58:40,769 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:40,769 INFO L146 ILogger]: trace histogram [164, 1, 1] [2019-05-23 09:58:40,769 INFO L146 ILogger]: === Iteration 165 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:40,769 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:40,770 INFO L146 ILogger]: Analyzing trace with hash -1447262782, now seen corresponding path program 164 times [2019-05-23 09:58:40,770 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:40,874 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:40,886 INFO L146 ILogger]: Trace formula consists of 1973 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:58:40,887 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:49,693 INFO L146 ILogger]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:49,693 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:49,693 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 09:58:49,694 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 09:58:49,695 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 09:58:49,695 INFO L146 ILogger]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:58:49,695 INFO L146 ILogger]: Start difference. First operand 167 states and 167 transitions. Second operand 167 states. [2019-05-23 09:58:50,094 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:50,095 INFO L146 ILogger]: Finished difference Result 168 states and 168 transitions. [2019-05-23 09:58:50,095 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-05-23 09:58:50,095 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 166 [2019-05-23 09:58:50,095 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:50,095 INFO L146 ILogger]: With dead ends: 168 [2019-05-23 09:58:50,096 INFO L146 ILogger]: Without dead ends: 168 [2019-05-23 09:58:50,096 INFO L146 ILogger]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:58:50,096 INFO L146 ILogger]: Start minimizeSevpa. Operand 168 states. [2019-05-23 09:58:50,097 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-05-23 09:58:50,097 INFO L146 ILogger]: Start removeUnreachable. Operand 168 states. [2019-05-23 09:58:50,097 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2019-05-23 09:58:50,097 INFO L146 ILogger]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2019-05-23 09:58:50,098 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:50,098 INFO L146 ILogger]: Abstraction has 168 states and 168 transitions. [2019-05-23 09:58:50,098 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 09:58:50,098 INFO L146 ILogger]: Start isEmpty. Operand 168 states and 168 transitions. [2019-05-23 09:58:50,098 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 168 [2019-05-23 09:58:50,098 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:50,098 INFO L146 ILogger]: trace histogram [165, 1, 1] [2019-05-23 09:58:50,098 INFO L146 ILogger]: === Iteration 166 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:50,099 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:50,099 INFO L146 ILogger]: Analyzing trace with hash -1915473242, now seen corresponding path program 165 times [2019-05-23 09:58:50,099 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:50,193 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:50,205 INFO L146 ILogger]: Trace formula consists of 1985 conjuncts, 167 conjunts are in the unsatisfiable core [2019-05-23 09:58:50,207 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:58:59,057 INFO L146 ILogger]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:58:59,057 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:58:59,057 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2019-05-23 09:58:59,058 INFO L146 ILogger]: Interpolant automaton has 168 states [2019-05-23 09:58:59,059 INFO L146 ILogger]: Constructing interpolant automaton starting with 168 interpolants. [2019-05-23 09:58:59,059 INFO L146 ILogger]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 09:58:59,059 INFO L146 ILogger]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2019-05-23 09:58:59,445 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:58:59,445 INFO L146 ILogger]: Finished difference Result 169 states and 169 transitions. [2019-05-23 09:58:59,445 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 09:58:59,445 INFO L146 ILogger]: Start accepts. Automaton has 168 states. Word has length 167 [2019-05-23 09:58:59,446 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:58:59,446 INFO L146 ILogger]: With dead ends: 169 [2019-05-23 09:58:59,446 INFO L146 ILogger]: Without dead ends: 169 [2019-05-23 09:58:59,447 INFO L146 ILogger]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 09:58:59,447 INFO L146 ILogger]: Start minimizeSevpa. Operand 169 states. [2019-05-23 09:58:59,447 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-05-23 09:58:59,447 INFO L146 ILogger]: Start removeUnreachable. Operand 169 states. [2019-05-23 09:58:59,448 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-05-23 09:58:59,448 INFO L146 ILogger]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2019-05-23 09:58:59,448 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:58:59,448 INFO L146 ILogger]: Abstraction has 169 states and 169 transitions. [2019-05-23 09:58:59,448 INFO L146 ILogger]: Interpolant automaton has 168 states. [2019-05-23 09:58:59,448 INFO L146 ILogger]: Start isEmpty. Operand 169 states and 169 transitions. [2019-05-23 09:58:59,448 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 169 [2019-05-23 09:58:59,449 INFO L146 ILogger]: Found error trace [2019-05-23 09:58:59,449 INFO L146 ILogger]: trace histogram [166, 1, 1] [2019-05-23 09:58:59,449 INFO L146 ILogger]: === Iteration 167 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:58:59,449 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:58:59,449 INFO L146 ILogger]: Analyzing trace with hash 749871682, now seen corresponding path program 166 times [2019-05-23 09:58:59,449 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:58:59,548 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:58:59,561 INFO L146 ILogger]: Trace formula consists of 1997 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:58:59,563 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:08,454 INFO L146 ILogger]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:08,455 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:08,455 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 09:59:08,455 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 09:59:08,456 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 09:59:08,457 INFO L146 ILogger]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:59:08,457 INFO L146 ILogger]: Start difference. First operand 169 states and 169 transitions. Second operand 169 states. [2019-05-23 09:59:08,859 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:08,859 INFO L146 ILogger]: Finished difference Result 170 states and 170 transitions. [2019-05-23 09:59:08,859 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-05-23 09:59:08,859 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 168 [2019-05-23 09:59:08,860 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:08,860 INFO L146 ILogger]: With dead ends: 170 [2019-05-23 09:59:08,860 INFO L146 ILogger]: Without dead ends: 170 [2019-05-23 09:59:08,861 INFO L146 ILogger]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:59:08,861 INFO L146 ILogger]: Start minimizeSevpa. Operand 170 states. [2019-05-23 09:59:08,861 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-05-23 09:59:08,862 INFO L146 ILogger]: Start removeUnreachable. Operand 170 states. [2019-05-23 09:59:08,862 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2019-05-23 09:59:08,862 INFO L146 ILogger]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2019-05-23 09:59:08,862 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:08,862 INFO L146 ILogger]: Abstraction has 170 states and 170 transitions. [2019-05-23 09:59:08,862 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 09:59:08,862 INFO L146 ILogger]: Start isEmpty. Operand 170 states and 170 transitions. [2019-05-23 09:59:08,863 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:59:08,863 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:08,863 INFO L146 ILogger]: trace histogram [167, 1, 1] [2019-05-23 09:59:08,863 INFO L146 ILogger]: === Iteration 168 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:08,863 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:08,863 INFO L146 ILogger]: Analyzing trace with hash 1771185702, now seen corresponding path program 167 times [2019-05-23 09:59:08,864 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:08,955 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:08,968 INFO L146 ILogger]: Trace formula consists of 2009 conjuncts, 169 conjunts are in the unsatisfiable core [2019-05-23 09:59:08,969 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:17,972 INFO L146 ILogger]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:17,973 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:17,973 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2019-05-23 09:59:17,973 INFO L146 ILogger]: Interpolant automaton has 170 states [2019-05-23 09:59:17,974 INFO L146 ILogger]: Constructing interpolant automaton starting with 170 interpolants. [2019-05-23 09:59:17,975 INFO L146 ILogger]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 09:59:17,975 INFO L146 ILogger]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2019-05-23 09:59:18,399 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:18,400 INFO L146 ILogger]: Finished difference Result 171 states and 171 transitions. [2019-05-23 09:59:18,400 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-05-23 09:59:18,400 INFO L146 ILogger]: Start accepts. Automaton has 170 states. Word has length 169 [2019-05-23 09:59:18,400 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:18,400 INFO L146 ILogger]: With dead ends: 171 [2019-05-23 09:59:18,401 INFO L146 ILogger]: Without dead ends: 171 [2019-05-23 09:59:18,401 INFO L146 ILogger]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 09:59:18,401 INFO L146 ILogger]: Start minimizeSevpa. Operand 171 states. [2019-05-23 09:59:18,402 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-05-23 09:59:18,402 INFO L146 ILogger]: Start removeUnreachable. Operand 171 states. [2019-05-23 09:59:18,403 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-05-23 09:59:18,403 INFO L146 ILogger]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2019-05-23 09:59:18,403 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:18,403 INFO L146 ILogger]: Abstraction has 171 states and 171 transitions. [2019-05-23 09:59:18,403 INFO L146 ILogger]: Interpolant automaton has 170 states. [2019-05-23 09:59:18,403 INFO L146 ILogger]: Start isEmpty. Operand 171 states and 171 transitions. [2019-05-23 09:59:18,404 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 171 [2019-05-23 09:59:18,404 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:18,404 INFO L146 ILogger]: trace histogram [168, 1, 1] [2019-05-23 09:59:18,404 INFO L146 ILogger]: === Iteration 169 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:18,404 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:18,405 INFO L146 ILogger]: Analyzing trace with hash -927818046, now seen corresponding path program 168 times [2019-05-23 09:59:18,405 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:18,497 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:18,510 INFO L146 ILogger]: Trace formula consists of 2021 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:59:18,511 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:27,671 INFO L146 ILogger]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:27,672 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:27,672 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 09:59:27,672 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 09:59:27,673 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 09:59:27,674 INFO L146 ILogger]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:59:27,674 INFO L146 ILogger]: Start difference. First operand 171 states and 171 transitions. Second operand 171 states. [2019-05-23 09:59:28,095 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:28,095 INFO L146 ILogger]: Finished difference Result 172 states and 172 transitions. [2019-05-23 09:59:28,095 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 09:59:28,095 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 170 [2019-05-23 09:59:28,096 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:28,096 INFO L146 ILogger]: With dead ends: 172 [2019-05-23 09:59:28,096 INFO L146 ILogger]: Without dead ends: 172 [2019-05-23 09:59:28,097 INFO L146 ILogger]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:59:28,097 INFO L146 ILogger]: Start minimizeSevpa. Operand 172 states. [2019-05-23 09:59:28,098 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-05-23 09:59:28,098 INFO L146 ILogger]: Start removeUnreachable. Operand 172 states. [2019-05-23 09:59:28,098 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-05-23 09:59:28,098 INFO L146 ILogger]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2019-05-23 09:59:28,098 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:28,098 INFO L146 ILogger]: Abstraction has 172 states and 172 transitions. [2019-05-23 09:59:28,099 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 09:59:28,099 INFO L146 ILogger]: Start isEmpty. Operand 172 states and 172 transitions. [2019-05-23 09:59:28,099 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 172 [2019-05-23 09:59:28,099 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:28,099 INFO L146 ILogger]: trace histogram [169, 1, 1] [2019-05-23 09:59:28,099 INFO L146 ILogger]: === Iteration 170 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:28,099 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:28,100 INFO L146 ILogger]: Analyzing trace with hash 1302411686, now seen corresponding path program 169 times [2019-05-23 09:59:28,100 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:28,193 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:28,206 INFO L146 ILogger]: Trace formula consists of 2033 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 09:59:28,208 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:37,357 INFO L146 ILogger]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:37,357 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:37,357 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2019-05-23 09:59:37,358 INFO L146 ILogger]: Interpolant automaton has 172 states [2019-05-23 09:59:37,359 INFO L146 ILogger]: Constructing interpolant automaton starting with 172 interpolants. [2019-05-23 09:59:37,359 INFO L146 ILogger]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 09:59:37,360 INFO L146 ILogger]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2019-05-23 09:59:37,797 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:37,797 INFO L146 ILogger]: Finished difference Result 173 states and 173 transitions. [2019-05-23 09:59:37,798 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-05-23 09:59:37,798 INFO L146 ILogger]: Start accepts. Automaton has 172 states. Word has length 171 [2019-05-23 09:59:37,798 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:37,798 INFO L146 ILogger]: With dead ends: 173 [2019-05-23 09:59:37,798 INFO L146 ILogger]: Without dead ends: 173 [2019-05-23 09:59:37,799 INFO L146 ILogger]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 09:59:37,799 INFO L146 ILogger]: Start minimizeSevpa. Operand 173 states. [2019-05-23 09:59:37,800 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-05-23 09:59:37,801 INFO L146 ILogger]: Start removeUnreachable. Operand 173 states. [2019-05-23 09:59:37,801 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-05-23 09:59:37,801 INFO L146 ILogger]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2019-05-23 09:59:37,801 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:37,801 INFO L146 ILogger]: Abstraction has 173 states and 173 transitions. [2019-05-23 09:59:37,802 INFO L146 ILogger]: Interpolant automaton has 172 states. [2019-05-23 09:59:37,802 INFO L146 ILogger]: Start isEmpty. Operand 173 states and 173 transitions. [2019-05-23 09:59:37,802 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 173 [2019-05-23 09:59:37,802 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:37,802 INFO L146 ILogger]: trace histogram [170, 1, 1] [2019-05-23 09:59:37,802 INFO L146 ILogger]: === Iteration 171 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:37,802 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:37,803 INFO L146 ILogger]: Analyzing trace with hash 1720056642, now seen corresponding path program 170 times [2019-05-23 09:59:37,803 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:37,906 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:37,919 INFO L146 ILogger]: Trace formula consists of 2045 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 09:59:37,920 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:47,288 INFO L146 ILogger]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:47,288 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:47,288 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 09:59:47,289 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 09:59:47,291 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 09:59:47,292 INFO L146 ILogger]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:59:47,292 INFO L146 ILogger]: Start difference. First operand 173 states and 173 transitions. Second operand 173 states. [2019-05-23 09:59:47,742 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:47,742 INFO L146 ILogger]: Finished difference Result 174 states and 174 transitions. [2019-05-23 09:59:47,742 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-05-23 09:59:47,742 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 172 [2019-05-23 09:59:47,743 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:47,743 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 09:59:47,743 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 09:59:47,744 INFO L146 ILogger]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:59:47,744 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 09:59:47,745 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-05-23 09:59:47,745 INFO L146 ILogger]: Start removeUnreachable. Operand 174 states. [2019-05-23 09:59:47,745 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2019-05-23 09:59:47,745 INFO L146 ILogger]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2019-05-23 09:59:47,746 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:47,746 INFO L146 ILogger]: Abstraction has 174 states and 174 transitions. [2019-05-23 09:59:47,746 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 09:59:47,746 INFO L146 ILogger]: Start isEmpty. Operand 174 states and 174 transitions. [2019-05-23 09:59:47,746 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 174 [2019-05-23 09:59:47,746 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:47,746 INFO L146 ILogger]: trace histogram [171, 1, 1] [2019-05-23 09:59:47,746 INFO L146 ILogger]: === Iteration 172 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:47,747 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:47,747 INFO L146 ILogger]: Analyzing trace with hash 1782148390, now seen corresponding path program 171 times [2019-05-23 09:59:47,747 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:47,845 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:47,859 INFO L146 ILogger]: Trace formula consists of 2057 conjuncts, 173 conjunts are in the unsatisfiable core [2019-05-23 09:59:47,860 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:59:57,263 INFO L146 ILogger]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:59:57,263 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:59:57,264 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2019-05-23 09:59:57,264 INFO L146 ILogger]: Interpolant automaton has 174 states [2019-05-23 09:59:57,265 INFO L146 ILogger]: Constructing interpolant automaton starting with 174 interpolants. [2019-05-23 09:59:57,266 INFO L146 ILogger]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-05-23 09:59:57,266 INFO L146 ILogger]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2019-05-23 09:59:57,753 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:59:57,753 INFO L146 ILogger]: Finished difference Result 175 states and 175 transitions. [2019-05-23 09:59:57,753 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 09:59:57,753 INFO L146 ILogger]: Start accepts. Automaton has 174 states. Word has length 173 [2019-05-23 09:59:57,753 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:59:57,754 INFO L146 ILogger]: With dead ends: 175 [2019-05-23 09:59:57,754 INFO L146 ILogger]: Without dead ends: 175 [2019-05-23 09:59:57,755 INFO L146 ILogger]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-05-23 09:59:57,755 INFO L146 ILogger]: Start minimizeSevpa. Operand 175 states. [2019-05-23 09:59:57,756 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-05-23 09:59:57,756 INFO L146 ILogger]: Start removeUnreachable. Operand 175 states. [2019-05-23 09:59:57,756 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-05-23 09:59:57,756 INFO L146 ILogger]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2019-05-23 09:59:57,756 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:59:57,756 INFO L146 ILogger]: Abstraction has 175 states and 175 transitions. [2019-05-23 09:59:57,756 INFO L146 ILogger]: Interpolant automaton has 174 states. [2019-05-23 09:59:57,757 INFO L146 ILogger]: Start isEmpty. Operand 175 states and 175 transitions. [2019-05-23 09:59:57,757 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 175 [2019-05-23 09:59:57,757 INFO L146 ILogger]: Found error trace [2019-05-23 09:59:57,757 INFO L146 ILogger]: trace histogram [172, 1, 1] [2019-05-23 09:59:57,757 INFO L146 ILogger]: === Iteration 173 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:59:57,757 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:59:57,757 INFO L146 ILogger]: Analyzing trace with hash -587974718, now seen corresponding path program 172 times [2019-05-23 09:59:57,758 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:59:57,854 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:59:57,867 INFO L146 ILogger]: Trace formula consists of 2069 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:59:57,869 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:07,503 INFO L146 ILogger]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:07,504 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:07,504 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2019-05-23 10:00:07,504 INFO L146 ILogger]: Interpolant automaton has 175 states [2019-05-23 10:00:07,506 INFO L146 ILogger]: Constructing interpolant automaton starting with 175 interpolants. [2019-05-23 10:00:07,506 INFO L146 ILogger]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 10:00:07,506 INFO L146 ILogger]: Start difference. First operand 175 states and 175 transitions. Second operand 175 states. [2019-05-23 10:00:08,375 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:08,376 INFO L146 ILogger]: Finished difference Result 176 states and 176 transitions. [2019-05-23 10:00:08,376 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-05-23 10:00:08,376 INFO L146 ILogger]: Start accepts. Automaton has 175 states. Word has length 174 [2019-05-23 10:00:08,376 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:08,377 INFO L146 ILogger]: With dead ends: 176 [2019-05-23 10:00:08,377 INFO L146 ILogger]: Without dead ends: 176 [2019-05-23 10:00:08,378 INFO L146 ILogger]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2019-05-23 10:00:08,378 INFO L146 ILogger]: Start minimizeSevpa. Operand 176 states. [2019-05-23 10:00:08,380 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-05-23 10:00:08,380 INFO L146 ILogger]: Start removeUnreachable. Operand 176 states. [2019-05-23 10:00:08,380 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-05-23 10:00:08,380 INFO L146 ILogger]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2019-05-23 10:00:08,380 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:08,381 INFO L146 ILogger]: Abstraction has 176 states and 176 transitions. [2019-05-23 10:00:08,381 INFO L146 ILogger]: Interpolant automaton has 175 states. [2019-05-23 10:00:08,381 INFO L146 ILogger]: Start isEmpty. Operand 176 states and 176 transitions. [2019-05-23 10:00:08,381 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 176 [2019-05-23 10:00:08,381 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:08,382 INFO L146 ILogger]: trace histogram [173, 1, 1] [2019-05-23 10:00:08,382 INFO L146 ILogger]: === Iteration 174 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:08,382 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:08,382 INFO L146 ILogger]: Analyzing trace with hash -1047347034, now seen corresponding path program 173 times [2019-05-23 10:00:08,382 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:08,481 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:08,494 INFO L146 ILogger]: Trace formula consists of 2081 conjuncts, 175 conjunts are in the unsatisfiable core [2019-05-23 10:00:08,496 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:18,117 INFO L146 ILogger]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:18,118 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:18,118 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2019-05-23 10:00:18,118 INFO L146 ILogger]: Interpolant automaton has 176 states [2019-05-23 10:00:18,120 INFO L146 ILogger]: Constructing interpolant automaton starting with 176 interpolants. [2019-05-23 10:00:18,120 INFO L146 ILogger]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-05-23 10:00:18,120 INFO L146 ILogger]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2019-05-23 10:00:18,618 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:18,618 INFO L146 ILogger]: Finished difference Result 177 states and 177 transitions. [2019-05-23 10:00:18,619 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-05-23 10:00:18,619 INFO L146 ILogger]: Start accepts. Automaton has 176 states. Word has length 175 [2019-05-23 10:00:18,619 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:18,619 INFO L146 ILogger]: With dead ends: 177 [2019-05-23 10:00:18,619 INFO L146 ILogger]: Without dead ends: 177 [2019-05-23 10:00:18,621 INFO L146 ILogger]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-05-23 10:00:18,621 INFO L146 ILogger]: Start minimizeSevpa. Operand 177 states. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Start removeUnreachable. Operand 177 states. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2019-05-23 10:00:18,622 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Abstraction has 177 states and 177 transitions. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Interpolant automaton has 176 states. [2019-05-23 10:00:18,622 INFO L146 ILogger]: Start isEmpty. Operand 177 states and 177 transitions. [2019-05-23 10:00:18,623 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 177 [2019-05-23 10:00:18,623 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:18,623 INFO L146 ILogger]: trace histogram [174, 1, 1] [2019-05-23 10:00:18,623 INFO L146 ILogger]: === Iteration 175 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:18,623 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:18,623 INFO L146 ILogger]: Analyzing trace with hash 1891980354, now seen corresponding path program 174 times [2019-05-23 10:00:18,624 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:18,722 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:18,735 INFO L146 ILogger]: Trace formula consists of 2093 conjuncts, 176 conjunts are in the unsatisfiable core [2019-05-23 10:00:18,737 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:28,415 INFO L146 ILogger]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:28,415 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:28,415 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2019-05-23 10:00:28,416 INFO L146 ILogger]: Interpolant automaton has 177 states [2019-05-23 10:00:28,417 INFO L146 ILogger]: Constructing interpolant automaton starting with 177 interpolants. [2019-05-23 10:00:28,418 INFO L146 ILogger]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 10:00:28,418 INFO L146 ILogger]: Start difference. First operand 177 states and 177 transitions. Second operand 177 states. [2019-05-23 10:00:28,894 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:28,894 INFO L146 ILogger]: Finished difference Result 178 states and 178 transitions. [2019-05-23 10:00:28,894 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2019-05-23 10:00:28,894 INFO L146 ILogger]: Start accepts. Automaton has 177 states. Word has length 176 [2019-05-23 10:00:28,895 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:28,895 INFO L146 ILogger]: With dead ends: 178 [2019-05-23 10:00:28,895 INFO L146 ILogger]: Without dead ends: 178 [2019-05-23 10:00:28,897 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2019-05-23 10:00:28,897 INFO L146 ILogger]: Start minimizeSevpa. Operand 178 states. [2019-05-23 10:00:28,898 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-05-23 10:00:28,898 INFO L146 ILogger]: Start removeUnreachable. Operand 178 states. [2019-05-23 10:00:28,898 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-05-23 10:00:28,899 INFO L146 ILogger]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2019-05-23 10:00:28,899 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:28,899 INFO L146 ILogger]: Abstraction has 178 states and 178 transitions. [2019-05-23 10:00:28,899 INFO L146 ILogger]: Interpolant automaton has 177 states. [2019-05-23 10:00:28,899 INFO L146 ILogger]: Start isEmpty. Operand 178 states and 178 transitions. [2019-05-23 10:00:28,899 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 178 [2019-05-23 10:00:28,899 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:28,899 INFO L146 ILogger]: trace histogram [175, 1, 1] [2019-05-23 10:00:28,900 INFO L146 ILogger]: === Iteration 176 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:28,900 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:28,900 INFO L146 ILogger]: Analyzing trace with hash -1478151130, now seen corresponding path program 175 times [2019-05-23 10:00:28,900 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:29,000 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:29,014 INFO L146 ILogger]: Trace formula consists of 2105 conjuncts, 177 conjunts are in the unsatisfiable core [2019-05-23 10:00:29,015 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:38,813 INFO L146 ILogger]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:38,814 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:38,814 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2019-05-23 10:00:38,814 INFO L146 ILogger]: Interpolant automaton has 178 states [2019-05-23 10:00:38,816 INFO L146 ILogger]: Constructing interpolant automaton starting with 178 interpolants. [2019-05-23 10:00:38,817 INFO L146 ILogger]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-05-23 10:00:38,817 INFO L146 ILogger]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2019-05-23 10:00:39,294 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:39,294 INFO L146 ILogger]: Finished difference Result 179 states and 179 transitions. [2019-05-23 10:00:39,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-05-23 10:00:39,295 INFO L146 ILogger]: Start accepts. Automaton has 178 states. Word has length 177 [2019-05-23 10:00:39,295 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:39,295 INFO L146 ILogger]: With dead ends: 179 [2019-05-23 10:00:39,295 INFO L146 ILogger]: Without dead ends: 179 [2019-05-23 10:00:39,297 INFO L146 ILogger]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-05-23 10:00:39,298 INFO L146 ILogger]: Start minimizeSevpa. Operand 179 states. [2019-05-23 10:00:39,299 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-05-23 10:00:39,299 INFO L146 ILogger]: Start removeUnreachable. Operand 179 states. [2019-05-23 10:00:39,299 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-05-23 10:00:39,299 INFO L146 ILogger]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2019-05-23 10:00:39,300 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:39,300 INFO L146 ILogger]: Abstraction has 179 states and 179 transitions. [2019-05-23 10:00:39,300 INFO L146 ILogger]: Interpolant automaton has 178 states. [2019-05-23 10:00:39,300 INFO L146 ILogger]: Start isEmpty. Operand 179 states and 179 transitions. [2019-05-23 10:00:39,300 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 179 [2019-05-23 10:00:39,301 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:39,301 INFO L146 ILogger]: trace histogram [176, 1, 1] [2019-05-23 10:00:39,301 INFO L146 ILogger]: === Iteration 177 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:39,301 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:39,301 INFO L146 ILogger]: Analyzing trace with hash 1421955266, now seen corresponding path program 176 times [2019-05-23 10:00:39,302 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:39,423 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:39,435 INFO L146 ILogger]: Trace formula consists of 2117 conjuncts, 178 conjunts are in the unsatisfiable core [2019-05-23 10:00:39,437 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:00:49,433 INFO L146 ILogger]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:00:49,434 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:00:49,434 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2019-05-23 10:00:49,434 INFO L146 ILogger]: Interpolant automaton has 179 states [2019-05-23 10:00:49,435 INFO L146 ILogger]: Constructing interpolant automaton starting with 179 interpolants. [2019-05-23 10:00:49,436 INFO L146 ILogger]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 10:00:49,436 INFO L146 ILogger]: Start difference. First operand 179 states and 179 transitions. Second operand 179 states. [2019-05-23 10:00:49,864 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:00:49,864 INFO L146 ILogger]: Finished difference Result 180 states and 180 transitions. [2019-05-23 10:00:49,864 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-05-23 10:00:49,864 INFO L146 ILogger]: Start accepts. Automaton has 179 states. Word has length 178 [2019-05-23 10:00:49,865 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:00:49,865 INFO L146 ILogger]: With dead ends: 180 [2019-05-23 10:00:49,865 INFO L146 ILogger]: Without dead ends: 180 [2019-05-23 10:00:49,866 INFO L146 ILogger]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2019-05-23 10:00:49,866 INFO L146 ILogger]: Start minimizeSevpa. Operand 180 states. [2019-05-23 10:00:49,867 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-05-23 10:00:49,867 INFO L146 ILogger]: Start removeUnreachable. Operand 180 states. [2019-05-23 10:00:49,867 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-05-23 10:00:49,867 INFO L146 ILogger]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2019-05-23 10:00:49,867 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:00:49,867 INFO L146 ILogger]: Abstraction has 180 states and 180 transitions. [2019-05-23 10:00:49,867 INFO L146 ILogger]: Interpolant automaton has 179 states. [2019-05-23 10:00:49,868 INFO L146 ILogger]: Start isEmpty. Operand 180 states and 180 transitions. [2019-05-23 10:00:49,868 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 180 [2019-05-23 10:00:49,868 INFO L146 ILogger]: Found error trace [2019-05-23 10:00:49,868 INFO L146 ILogger]: trace histogram [177, 1, 1] [2019-05-23 10:00:49,868 INFO L146 ILogger]: === Iteration 178 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:00:49,868 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:00:49,869 INFO L146 ILogger]: Analyzing trace with hash 1130940326, now seen corresponding path program 177 times [2019-05-23 10:00:49,869 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:00:49,971 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:00:49,985 INFO L146 ILogger]: Trace formula consists of 2129 conjuncts, 179 conjunts are in the unsatisfiable core [2019-05-23 10:00:49,987 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:00,073 INFO L146 ILogger]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:00,073 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:00,073 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2019-05-23 10:01:00,073 INFO L146 ILogger]: Interpolant automaton has 180 states [2019-05-23 10:01:00,075 INFO L146 ILogger]: Constructing interpolant automaton starting with 180 interpolants. [2019-05-23 10:01:00,075 INFO L146 ILogger]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-05-23 10:01:00,075 INFO L146 ILogger]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2019-05-23 10:01:00,556 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:00,556 INFO L146 ILogger]: Finished difference Result 181 states and 181 transitions. [2019-05-23 10:01:00,557 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-05-23 10:01:00,557 INFO L146 ILogger]: Start accepts. Automaton has 180 states. Word has length 179 [2019-05-23 10:01:00,557 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:00,557 INFO L146 ILogger]: With dead ends: 181 [2019-05-23 10:01:00,557 INFO L146 ILogger]: Without dead ends: 181 [2019-05-23 10:01:00,558 INFO L146 ILogger]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-05-23 10:01:00,558 INFO L146 ILogger]: Start minimizeSevpa. Operand 181 states. [2019-05-23 10:01:00,559 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-05-23 10:01:00,559 INFO L146 ILogger]: Start removeUnreachable. Operand 181 states. [2019-05-23 10:01:00,559 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-05-23 10:01:00,559 INFO L146 ILogger]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2019-05-23 10:01:00,560 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:00,560 INFO L146 ILogger]: Abstraction has 181 states and 181 transitions. [2019-05-23 10:01:00,560 INFO L146 ILogger]: Interpolant automaton has 180 states. [2019-05-23 10:01:00,560 INFO L146 ILogger]: Start isEmpty. Operand 181 states and 181 transitions. [2019-05-23 10:01:00,560 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 181 [2019-05-23 10:01:00,560 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:00,560 INFO L146 ILogger]: trace histogram [178, 1, 1] [2019-05-23 10:01:00,560 INFO L146 ILogger]: === Iteration 179 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:00,561 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:00,561 INFO L146 ILogger]: Analyzing trace with hash 699411778, now seen corresponding path program 178 times [2019-05-23 10:01:00,561 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:00,672 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:00,686 INFO L146 ILogger]: Trace formula consists of 2141 conjuncts, 180 conjunts are in the unsatisfiable core [2019-05-23 10:01:00,688 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:10,908 INFO L146 ILogger]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:10,909 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:10,909 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2019-05-23 10:01:10,909 INFO L146 ILogger]: Interpolant automaton has 181 states [2019-05-23 10:01:10,910 INFO L146 ILogger]: Constructing interpolant automaton starting with 181 interpolants. [2019-05-23 10:01:10,911 INFO L146 ILogger]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 10:01:10,911 INFO L146 ILogger]: Start difference. First operand 181 states and 181 transitions. Second operand 181 states. [2019-05-23 10:01:11,418 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:11,418 INFO L146 ILogger]: Finished difference Result 182 states and 182 transitions. [2019-05-23 10:01:11,419 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-05-23 10:01:11,419 INFO L146 ILogger]: Start accepts. Automaton has 181 states. Word has length 180 [2019-05-23 10:01:11,419 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:11,419 INFO L146 ILogger]: With dead ends: 182 [2019-05-23 10:01:11,419 INFO L146 ILogger]: Without dead ends: 182 [2019-05-23 10:01:11,420 INFO L146 ILogger]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2019-05-23 10:01:11,420 INFO L146 ILogger]: Start minimizeSevpa. Operand 182 states. [2019-05-23 10:01:11,421 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-05-23 10:01:11,421 INFO L146 ILogger]: Start removeUnreachable. Operand 182 states. [2019-05-23 10:01:11,422 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-05-23 10:01:11,422 INFO L146 ILogger]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2019-05-23 10:01:11,422 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:11,422 INFO L146 ILogger]: Abstraction has 182 states and 182 transitions. [2019-05-23 10:01:11,422 INFO L146 ILogger]: Interpolant automaton has 181 states. [2019-05-23 10:01:11,422 INFO L146 ILogger]: Start isEmpty. Operand 182 states and 182 transitions. [2019-05-23 10:01:11,422 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 10:01:11,422 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:11,423 INFO L146 ILogger]: trace histogram [179, 1, 1] [2019-05-23 10:01:11,423 INFO L146 ILogger]: === Iteration 180 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:11,423 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:11,423 INFO L146 ILogger]: Analyzing trace with hash 206928678, now seen corresponding path program 179 times [2019-05-23 10:01:11,423 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:11,529 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:11,543 INFO L146 ILogger]: Trace formula consists of 2153 conjuncts, 181 conjunts are in the unsatisfiable core [2019-05-23 10:01:11,545 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:21,895 INFO L146 ILogger]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:21,896 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:21,896 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2019-05-23 10:01:21,896 INFO L146 ILogger]: Interpolant automaton has 182 states [2019-05-23 10:01:21,897 INFO L146 ILogger]: Constructing interpolant automaton starting with 182 interpolants. [2019-05-23 10:01:21,898 INFO L146 ILogger]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-05-23 10:01:21,898 INFO L146 ILogger]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2019-05-23 10:01:22,406 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:22,406 INFO L146 ILogger]: Finished difference Result 183 states and 183 transitions. [2019-05-23 10:01:22,407 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2019-05-23 10:01:22,407 INFO L146 ILogger]: Start accepts. Automaton has 182 states. Word has length 181 [2019-05-23 10:01:22,407 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:22,407 INFO L146 ILogger]: With dead ends: 183 [2019-05-23 10:01:22,407 INFO L146 ILogger]: Without dead ends: 183 [2019-05-23 10:01:22,409 INFO L146 ILogger]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-05-23 10:01:22,409 INFO L146 ILogger]: Start minimizeSevpa. Operand 183 states. [2019-05-23 10:01:22,410 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-05-23 10:01:22,411 INFO L146 ILogger]: Start removeUnreachable. Operand 183 states. [2019-05-23 10:01:22,411 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-05-23 10:01:22,411 INFO L146 ILogger]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2019-05-23 10:01:22,411 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:22,411 INFO L146 ILogger]: Abstraction has 183 states and 183 transitions. [2019-05-23 10:01:22,411 INFO L146 ILogger]: Interpolant automaton has 182 states. [2019-05-23 10:01:22,411 INFO L146 ILogger]: Start isEmpty. Operand 183 states and 183 transitions. [2019-05-23 10:01:22,412 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 10:01:22,412 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:22,412 INFO L146 ILogger]: trace histogram [180, 1, 1] [2019-05-23 10:01:22,412 INFO L146 ILogger]: === Iteration 181 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:22,412 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:22,412 INFO L146 ILogger]: Analyzing trace with hash 2119821762, now seen corresponding path program 180 times [2019-05-23 10:01:22,413 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:22,518 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:22,532 INFO L146 ILogger]: Trace formula consists of 2165 conjuncts, 182 conjunts are in the unsatisfiable core [2019-05-23 10:01:22,534 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:32,906 INFO L146 ILogger]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:32,907 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:32,907 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2019-05-23 10:01:32,907 INFO L146 ILogger]: Interpolant automaton has 183 states [2019-05-23 10:01:32,909 INFO L146 ILogger]: Constructing interpolant automaton starting with 183 interpolants. [2019-05-23 10:01:32,909 INFO L146 ILogger]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 10:01:32,910 INFO L146 ILogger]: Start difference. First operand 183 states and 183 transitions. Second operand 183 states. [2019-05-23 10:01:33,385 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:33,385 INFO L146 ILogger]: Finished difference Result 184 states and 184 transitions. [2019-05-23 10:01:33,385 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2019-05-23 10:01:33,386 INFO L146 ILogger]: Start accepts. Automaton has 183 states. Word has length 182 [2019-05-23 10:01:33,386 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:33,386 INFO L146 ILogger]: With dead ends: 184 [2019-05-23 10:01:33,386 INFO L146 ILogger]: Without dead ends: 184 [2019-05-23 10:01:33,387 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2019-05-23 10:01:33,388 INFO L146 ILogger]: Start minimizeSevpa. Operand 184 states. [2019-05-23 10:01:33,388 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-05-23 10:01:33,389 INFO L146 ILogger]: Start removeUnreachable. Operand 184 states. [2019-05-23 10:01:33,389 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-05-23 10:01:33,389 INFO L146 ILogger]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2019-05-23 10:01:33,389 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:33,389 INFO L146 ILogger]: Abstraction has 184 states and 184 transitions. [2019-05-23 10:01:33,389 INFO L146 ILogger]: Interpolant automaton has 183 states. [2019-05-23 10:01:33,389 INFO L146 ILogger]: Start isEmpty. Operand 184 states and 184 transitions. [2019-05-23 10:01:33,390 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 184 [2019-05-23 10:01:33,390 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:33,390 INFO L146 ILogger]: trace histogram [181, 1, 1] [2019-05-23 10:01:33,390 INFO L146 ILogger]: === Iteration 182 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:33,390 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:33,390 INFO L146 ILogger]: Analyzing trace with hash 1289965222, now seen corresponding path program 181 times [2019-05-23 10:01:33,390 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:33,496 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:33,511 INFO L146 ILogger]: Trace formula consists of 2177 conjuncts, 183 conjunts are in the unsatisfiable core [2019-05-23 10:01:33,512 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:44,024 INFO L146 ILogger]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:44,025 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:44,025 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2019-05-23 10:01:44,025 INFO L146 ILogger]: Interpolant automaton has 184 states [2019-05-23 10:01:44,027 INFO L146 ILogger]: Constructing interpolant automaton starting with 184 interpolants. [2019-05-23 10:01:44,027 INFO L146 ILogger]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-05-23 10:01:44,028 INFO L146 ILogger]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2019-05-23 10:01:44,539 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:44,540 INFO L146 ILogger]: Finished difference Result 185 states and 185 transitions. [2019-05-23 10:01:44,540 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-05-23 10:01:44,540 INFO L146 ILogger]: Start accepts. Automaton has 184 states. Word has length 183 [2019-05-23 10:01:44,540 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:44,540 INFO L146 ILogger]: With dead ends: 185 [2019-05-23 10:01:44,541 INFO L146 ILogger]: Without dead ends: 185 [2019-05-23 10:01:44,542 INFO L146 ILogger]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-05-23 10:01:44,543 INFO L146 ILogger]: Start minimizeSevpa. Operand 185 states. [2019-05-23 10:01:44,544 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-05-23 10:01:44,544 INFO L146 ILogger]: Start removeUnreachable. Operand 185 states. [2019-05-23 10:01:44,544 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-05-23 10:01:44,544 INFO L146 ILogger]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2019-05-23 10:01:44,545 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:44,545 INFO L146 ILogger]: Abstraction has 185 states and 185 transitions. [2019-05-23 10:01:44,545 INFO L146 ILogger]: Interpolant automaton has 184 states. [2019-05-23 10:01:44,545 INFO L146 ILogger]: Start isEmpty. Operand 185 states and 185 transitions. [2019-05-23 10:01:44,545 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 185 [2019-05-23 10:01:44,546 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:44,546 INFO L146 ILogger]: trace histogram [182, 1, 1] [2019-05-23 10:01:44,546 INFO L146 ILogger]: === Iteration 183 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:44,546 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:44,546 INFO L146 ILogger]: Analyzing trace with hash 1334216258, now seen corresponding path program 182 times [2019-05-23 10:01:44,547 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:44,743 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:44,765 INFO L146 ILogger]: Trace formula consists of 2189 conjuncts, 184 conjunts are in the unsatisfiable core [2019-05-23 10:01:44,767 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:01:55,406 INFO L146 ILogger]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:01:55,406 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:01:55,406 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2019-05-23 10:01:55,406 INFO L146 ILogger]: Interpolant automaton has 185 states [2019-05-23 10:01:55,408 INFO L146 ILogger]: Constructing interpolant automaton starting with 185 interpolants. [2019-05-23 10:01:55,408 INFO L146 ILogger]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 10:01:55,408 INFO L146 ILogger]: Start difference. First operand 185 states and 185 transitions. Second operand 185 states. [2019-05-23 10:01:55,931 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:01:55,931 INFO L146 ILogger]: Finished difference Result 186 states and 186 transitions. [2019-05-23 10:01:55,931 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-05-23 10:01:55,931 INFO L146 ILogger]: Start accepts. Automaton has 185 states. Word has length 184 [2019-05-23 10:01:55,932 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:01:55,932 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 10:01:55,932 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 10:01:55,933 INFO L146 ILogger]: 0 DeclaredPredicates, 183 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2019-05-23 10:01:55,933 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Start removeUnreachable. Operand 186 states. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2019-05-23 10:01:55,934 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Abstraction has 186 states and 186 transitions. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Interpolant automaton has 185 states. [2019-05-23 10:01:55,934 INFO L146 ILogger]: Start isEmpty. Operand 186 states and 186 transitions. [2019-05-23 10:01:55,935 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 186 [2019-05-23 10:01:55,935 INFO L146 ILogger]: Found error trace [2019-05-23 10:01:55,935 INFO L146 ILogger]: trace histogram [183, 1, 1] [2019-05-23 10:01:55,935 INFO L146 ILogger]: === Iteration 184 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:01:55,935 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:01:55,935 INFO L146 ILogger]: Analyzing trace with hash -1588968922, now seen corresponding path program 183 times [2019-05-23 10:01:55,936 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:01:56,043 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:01:56,059 INFO L146 ILogger]: Trace formula consists of 2201 conjuncts, 185 conjunts are in the unsatisfiable core [2019-05-23 10:01:56,060 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 10:02:06,843 INFO L146 ILogger]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 10:02:06,843 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 10:02:06,843 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2019-05-23 10:02:06,843 INFO L146 ILogger]: Interpolant automaton has 186 states [2019-05-23 10:02:06,845 INFO L146 ILogger]: Constructing interpolant automaton starting with 186 interpolants. [2019-05-23 10:02:06,845 INFO L146 ILogger]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-05-23 10:02:06,845 INFO L146 ILogger]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2019-05-23 10:02:07,349 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 10:02:07,350 INFO L146 ILogger]: Finished difference Result 187 states and 187 transitions. [2019-05-23 10:02:07,350 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2019-05-23 10:02:07,350 INFO L146 ILogger]: Start accepts. Automaton has 186 states. Word has length 185 [2019-05-23 10:02:07,350 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 10:02:07,351 INFO L146 ILogger]: With dead ends: 187 [2019-05-23 10:02:07,351 INFO L146 ILogger]: Without dead ends: 187 [2019-05-23 10:02:07,352 INFO L146 ILogger]: 0 DeclaredPredicates, 184 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-05-23 10:02:07,352 INFO L146 ILogger]: Start minimizeSevpa. Operand 187 states. [2019-05-23 10:02:07,353 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-05-23 10:02:07,353 INFO L146 ILogger]: Start removeUnreachable. Operand 187 states. [2019-05-23 10:02:07,354 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-05-23 10:02:07,354 INFO L146 ILogger]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2019-05-23 10:02:07,354 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 10:02:07,354 INFO L146 ILogger]: Abstraction has 187 states and 187 transitions. [2019-05-23 10:02:07,354 INFO L146 ILogger]: Interpolant automaton has 186 states. [2019-05-23 10:02:07,354 INFO L146 ILogger]: Start isEmpty. Operand 187 states and 187 transitions. [2019-05-23 10:02:07,354 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 187 [2019-05-23 10:02:07,354 INFO L146 ILogger]: Found error trace [2019-05-23 10:02:07,355 INFO L146 ILogger]: trace histogram [184, 1, 1] [2019-05-23 10:02:07,355 INFO L146 ILogger]: === Iteration 185 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 10:02:07,355 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 10:02:07,355 INFO L146 ILogger]: Analyzing trace with hash -2013396286, now seen corresponding path program 184 times [2019-05-23 10:02:07,355 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 10:02:07,464 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 10:02:07,479 INFO L146 ILogger]: Trace formula consists of 2213 conjuncts, 186 conjunts are in the unsatisfiable core [2019-05-23 10:02:07,481 INFO L146 ILogger]: Computing forward predicates...