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/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:22:04,952 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:22:04,955 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:22:04,971 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:22:04,972 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:22:04,974 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:22:04,977 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:22:04,980 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:22:04,981 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:22:04,983 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:22:04,984 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:22:04,984 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:22:04,985 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:22:04,986 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:22:04,987 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:22:04,988 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:22:04,989 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:22:04,991 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:22:04,993 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:22:04,994 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:22:04,995 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:22:04,997 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:22:04,999 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:22:04,999 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:22:05,000 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:22:05,001 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:22:05,001 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:22:05,002 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:22:05,003 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:22:05,003 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:22:05,004 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:22:05,005 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:22:05,006 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:22:05,006 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:22:05,007 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:22:05,007 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:22:05,007 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:22:05,008 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:22:05,010 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.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-23 09:22:05,068 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:22:05,082 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:22:05,088 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:22:05,090 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:22:05,090 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:22:05,091 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:22:05,091 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-05-23 09:22:05,130 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:22:05,131 INFO L146 ILogger]: Walking toolchain with 4 elements. [2019-05-23 09:22:05,132 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:05,132 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:22:05,133 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:22:05,150 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:22:05" (1/1) ... [2019-05-23 09:22:05,163 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:22:05" (1/1) ... [2019-05-23 09:22:05,170 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:22:05,170 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:22:05,170 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:22:05,173 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:22:05,174 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:22:05,174 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:22:05,174 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:22:05,186 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:22:05" (1/1) ... [2019-05-23 09:22:05,186 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:22:05" (1/1) ... [2019-05-23 09:22:05,188 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:22:05" (1/1) ... [2019-05-23 09:22:05,189 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:22:05" (1/1) ... [2019-05-23 09:22:05,191 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:22:05" (1/1) ... [2019-05-23 09:22:05,196 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:22:05" (1/1) ... [2019-05-23 09:22:05,197 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:22:05" (1/1) ... [2019-05-23 09:22:05,198 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:22:05,199 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:22:05,199 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:22:05,199 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:22:05,201 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:22:05" (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:22:05,266 INFO L146 ILogger]: Found specification of procedure proc [2019-05-23 09:22:05,266 INFO L146 ILogger]: Found implementation of procedure proc [2019-05-23 09:22:05,432 INFO L146 ILogger]: Using library mode [2019-05-23 09:22:05,433 INFO L146 ILogger]: Removed 1 assume(true) statements. [2019-05-23 09:22:05,434 INFO L146 ILogger]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:22:05 BoogieIcfgContainer [2019-05-23 09:22:05,434 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:22:05,436 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:22:05,440 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:22:05,446 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:22:05,446 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:22:05" (1/2) ... [2019-05-23 09:22:05,448 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc24a87 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:22:05, skipping insertion in model container [2019-05-23 09:22:05,448 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:22:05" (2/2) ... [2019-05-23 09:22:05,450 INFO L146 ILogger]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-05-23 09:22:05,461 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:22:05,468 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:22:05,498 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:22:05,524 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:22:05,524 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:22:05,524 INFO L146 ILogger]: Hoare is false [2019-05-23 09:22:05,524 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:22:05,525 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:22:05,525 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:22:05,525 INFO L146 ILogger]: Difference is false [2019-05-23 09:22:05,525 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:22:05,525 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:22:05,537 INFO L146 ILogger]: Start isEmpty. Operand 9 states. [2019-05-23 09:22:05,545 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 3 [2019-05-23 09:22:05,545 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,546 INFO L146 ILogger]: trace histogram [1, 1] [2019-05-23 09:22:05,549 INFO L146 ILogger]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,555 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,555 INFO L146 ILogger]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-05-23 09:22:05,605 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,628 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,630 INFO L146 ILogger]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,634 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,661 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:22:05,663 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:22:05,664 INFO L146 ILogger]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-23 09:22:05,667 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:22:05,678 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:22:05,679 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:22:05,680 INFO L146 ILogger]: Start difference. First operand 9 states. Second operand 3 states. [2019-05-23 09:22:05,769 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:05,769 INFO L146 ILogger]: Finished difference Result 16 states and 16 transitions. [2019-05-23 09:22:05,771 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:22:05,773 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-23 09:22:05,774 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:05,788 INFO L146 ILogger]: With dead ends: 16 [2019-05-23 09:22:05,788 INFO L146 ILogger]: Without dead ends: 14 [2019-05-23 09:22:05,791 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:22:05,813 INFO L146 ILogger]: Start minimizeSevpa. Operand 14 states. [2019-05-23 09:22:05,827 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 14 to 9. [2019-05-23 09:22:05,829 INFO L146 ILogger]: Start removeUnreachable. Operand 9 states. [2019-05-23 09:22:05,830 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-23 09:22:05,831 INFO L146 ILogger]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 2 [2019-05-23 09:22:05,832 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:05,832 INFO L146 ILogger]: Abstraction has 9 states and 9 transitions. [2019-05-23 09:22:05,832 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:22:05,832 INFO L146 ILogger]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-23 09:22:05,833 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 9 [2019-05-23 09:22:05,833 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:05,833 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-05-23 09:22:05,834 INFO L146 ILogger]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:05,834 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:05,834 INFO L146 ILogger]: Analyzing trace with hash -1486416510, now seen corresponding path program 1 times [2019-05-23 09:22:05,838 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:05,850 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:05,851 INFO L146 ILogger]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 09:22:05,853 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:05,962 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:22:05,962 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:05,962 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-05-23 09:22:05,964 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:22:05,965 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:22:05,965 INFO L146 ILogger]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:22:05,965 INFO L146 ILogger]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-05-23 09:22:06,038 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,038 INFO L146 ILogger]: Finished difference Result 20 states and 20 transitions. [2019-05-23 09:22:06,039 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:22:06,039 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 8 [2019-05-23 09:22:06,040 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,040 INFO L146 ILogger]: With dead ends: 20 [2019-05-23 09:22:06,041 INFO L146 ILogger]: Without dead ends: 20 [2019-05-23 09:22:06,042 INFO L146 ILogger]: 0 DeclaredPredicates, 7 GetRequests, 5 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:22:06,043 INFO L146 ILogger]: Start minimizeSevpa. Operand 20 states. [2019-05-23 09:22:06,045 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-05-23 09:22:06,046 INFO L146 ILogger]: Start removeUnreachable. Operand 15 states. [2019-05-23 09:22:06,046 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-23 09:22:06,046 INFO L146 ILogger]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2019-05-23 09:22:06,047 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,047 INFO L146 ILogger]: Abstraction has 15 states and 15 transitions. [2019-05-23 09:22:06,047 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:22:06,048 INFO L146 ILogger]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-23 09:22:06,048 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 15 [2019-05-23 09:22:06,048 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,049 INFO L146 ILogger]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1] [2019-05-23 09:22:06,049 INFO L146 ILogger]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,049 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,049 INFO L146 ILogger]: Analyzing trace with hash 1031218559, now seen corresponding path program 2 times [2019-05-23 09:22:06,050 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,069 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,070 INFO L146 ILogger]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,072 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,149 INFO L146 ILogger]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,149 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,149 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 09:22:06,150 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:22:06,150 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:22:06,150 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:06,151 INFO L146 ILogger]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-05-23 09:22:06,200 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,201 INFO L146 ILogger]: Finished difference Result 26 states and 26 transitions. [2019-05-23 09:22:06,201 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:22:06,201 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 14 [2019-05-23 09:22:06,202 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,202 INFO L146 ILogger]: With dead ends: 26 [2019-05-23 09:22:06,203 INFO L146 ILogger]: Without dead ends: 26 [2019-05-23 09:22:06,203 INFO L146 ILogger]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:22:06,204 INFO L146 ILogger]: Start minimizeSevpa. Operand 26 states. [2019-05-23 09:22:06,207 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-05-23 09:22:06,207 INFO L146 ILogger]: Start removeUnreachable. Operand 21 states. [2019-05-23 09:22:06,208 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-23 09:22:06,209 INFO L146 ILogger]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-05-23 09:22:06,209 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,209 INFO L146 ILogger]: Abstraction has 21 states and 21 transitions. [2019-05-23 09:22:06,209 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:22:06,209 INFO L146 ILogger]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-23 09:22:06,210 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 21 [2019-05-23 09:22:06,210 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,210 INFO L146 ILogger]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1] [2019-05-23 09:22:06,210 INFO L146 ILogger]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,211 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,211 INFO L146 ILogger]: Analyzing trace with hash -863468612, now seen corresponding path program 3 times [2019-05-23 09:22:06,212 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,224 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,225 INFO L146 ILogger]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,227 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,355 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:22:06,356 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,356 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 09:22:06,356 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:22:06,357 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:22:06,357 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:06,357 INFO L146 ILogger]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2019-05-23 09:22:06,454 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,455 INFO L146 ILogger]: Finished difference Result 32 states and 32 transitions. [2019-05-23 09:22:06,455 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:22:06,456 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 20 [2019-05-23 09:22:06,456 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,457 INFO L146 ILogger]: With dead ends: 32 [2019-05-23 09:22:06,457 INFO L146 ILogger]: Without dead ends: 32 [2019-05-23 09:22:06,457 INFO L146 ILogger]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:22:06,458 INFO L146 ILogger]: Start minimizeSevpa. Operand 32 states. [2019-05-23 09:22:06,461 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-05-23 09:22:06,462 INFO L146 ILogger]: Start removeUnreachable. Operand 27 states. [2019-05-23 09:22:06,463 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-23 09:22:06,463 INFO L146 ILogger]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-05-23 09:22:06,463 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,463 INFO L146 ILogger]: Abstraction has 27 states and 27 transitions. [2019-05-23 09:22:06,463 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:22:06,464 INFO L146 ILogger]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-23 09:22:06,464 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 27 [2019-05-23 09:22:06,464 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,465 INFO L146 ILogger]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1] [2019-05-23 09:22:06,465 INFO L146 ILogger]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,465 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,465 INFO L146 ILogger]: Analyzing trace with hash 796360761, now seen corresponding path program 4 times [2019-05-23 09:22:06,466 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,480 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,481 INFO L146 ILogger]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,483 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:06,704 INFO L146 ILogger]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:06,705 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:06,705 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:22:06,705 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:22:06,706 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:22:06,706 INFO L146 ILogger]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:06,706 INFO L146 ILogger]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2019-05-23 09:22:06,804 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:06,805 INFO L146 ILogger]: Finished difference Result 38 states and 38 transitions. [2019-05-23 09:22:06,806 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:22:06,806 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 26 [2019-05-23 09:22:06,807 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:06,808 INFO L146 ILogger]: With dead ends: 38 [2019-05-23 09:22:06,808 INFO L146 ILogger]: Without dead ends: 38 [2019-05-23 09:22:06,809 INFO L146 ILogger]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:22:06,809 INFO L146 ILogger]: Start minimizeSevpa. Operand 38 states. [2019-05-23 09:22:06,816 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 38 to 33. [2019-05-23 09:22:06,817 INFO L146 ILogger]: Start removeUnreachable. Operand 33 states. [2019-05-23 09:22:06,818 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-23 09:22:06,818 INFO L146 ILogger]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 26 [2019-05-23 09:22:06,818 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:06,818 INFO L146 ILogger]: Abstraction has 33 states and 33 transitions. [2019-05-23 09:22:06,818 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:22:06,819 INFO L146 ILogger]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-23 09:22:06,821 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 33 [2019-05-23 09:22:06,822 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:06,822 INFO L146 ILogger]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1] [2019-05-23 09:22:06,822 INFO L146 ILogger]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:06,822 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:06,823 INFO L146 ILogger]: Analyzing trace with hash -1633391882, now seen corresponding path program 5 times [2019-05-23 09:22:06,824 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:06,852 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:06,857 INFO L146 ILogger]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:22:06,858 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,070 INFO L146 ILogger]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,070 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,070 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:22:07,071 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:22:07,071 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:22:07,072 INFO L146 ILogger]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:07,072 INFO L146 ILogger]: Start difference. First operand 33 states and 33 transitions. Second operand 8 states. [2019-05-23 09:22:07,133 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,134 INFO L146 ILogger]: Finished difference Result 44 states and 44 transitions. [2019-05-23 09:22:07,135 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:22:07,135 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 32 [2019-05-23 09:22:07,136 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,137 INFO L146 ILogger]: With dead ends: 44 [2019-05-23 09:22:07,137 INFO L146 ILogger]: Without dead ends: 44 [2019-05-23 09:22:07,138 INFO L146 ILogger]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:22:07,138 INFO L146 ILogger]: Start minimizeSevpa. Operand 44 states. [2019-05-23 09:22:07,141 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-05-23 09:22:07,141 INFO L146 ILogger]: Start removeUnreachable. Operand 39 states. [2019-05-23 09:22:07,142 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-23 09:22:07,142 INFO L146 ILogger]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2019-05-23 09:22:07,143 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,143 INFO L146 ILogger]: Abstraction has 39 states and 39 transitions. [2019-05-23 09:22:07,143 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:22:07,144 INFO L146 ILogger]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-23 09:22:07,145 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 39 [2019-05-23 09:22:07,145 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,145 INFO L146 ILogger]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1] [2019-05-23 09:22:07,145 INFO L146 ILogger]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,146 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,146 INFO L146 ILogger]: Analyzing trace with hash 2096337907, now seen corresponding path program 6 times [2019-05-23 09:22:07,147 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,162 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,164 INFO L146 ILogger]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,166 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,303 INFO L146 ILogger]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,303 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,303 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:22:07,304 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:22:07,304 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:22:07,305 INFO L146 ILogger]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:22:07,306 INFO L146 ILogger]: Start difference. First operand 39 states and 39 transitions. Second operand 9 states. [2019-05-23 09:22:07,394 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:07,395 INFO L146 ILogger]: Finished difference Result 50 states and 50 transitions. [2019-05-23 09:22:07,396 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:22:07,396 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 38 [2019-05-23 09:22:07,397 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:07,397 INFO L146 ILogger]: With dead ends: 50 [2019-05-23 09:22:07,398 INFO L146 ILogger]: Without dead ends: 50 [2019-05-23 09:22:07,398 INFO L146 ILogger]: 0 DeclaredPredicates, 37 GetRequests, 30 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:22:07,398 INFO L146 ILogger]: Start minimizeSevpa. Operand 50 states. [2019-05-23 09:22:07,406 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-05-23 09:22:07,407 INFO L146 ILogger]: Start removeUnreachable. Operand 45 states. [2019-05-23 09:22:07,408 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-23 09:22:07,408 INFO L146 ILogger]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 38 [2019-05-23 09:22:07,408 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:07,409 INFO L146 ILogger]: Abstraction has 45 states and 45 transitions. [2019-05-23 09:22:07,409 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:22:07,410 INFO L146 ILogger]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-23 09:22:07,411 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 45 [2019-05-23 09:22:07,412 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:07,412 INFO L146 ILogger]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1] [2019-05-23 09:22:07,412 INFO L146 ILogger]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:07,412 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:07,412 INFO L146 ILogger]: Analyzing trace with hash 1691175728, now seen corresponding path program 7 times [2019-05-23 09:22:07,415 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:07,434 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:07,435 INFO L146 ILogger]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:22:07,437 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:07,830 INFO L146 ILogger]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:07,830 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:07,830 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:22:07,831 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:22:07,831 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:22:07,831 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:07,831 INFO L146 ILogger]: Start difference. First operand 45 states and 45 transitions. Second operand 10 states. [2019-05-23 09:22:08,021 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,021 INFO L146 ILogger]: Finished difference Result 56 states and 56 transitions. [2019-05-23 09:22:08,022 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:22:08,022 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 44 [2019-05-23 09:22:08,022 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,023 INFO L146 ILogger]: With dead ends: 56 [2019-05-23 09:22:08,023 INFO L146 ILogger]: Without dead ends: 56 [2019-05-23 09:22:08,024 INFO L146 ILogger]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:22:08,024 INFO L146 ILogger]: Start minimizeSevpa. Operand 56 states. [2019-05-23 09:22:08,033 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-05-23 09:22:08,033 INFO L146 ILogger]: Start removeUnreachable. Operand 51 states. [2019-05-23 09:22:08,034 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-23 09:22:08,038 INFO L146 ILogger]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 44 [2019-05-23 09:22:08,038 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,038 INFO L146 ILogger]: Abstraction has 51 states and 51 transitions. [2019-05-23 09:22:08,038 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:22:08,039 INFO L146 ILogger]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-23 09:22:08,040 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 51 [2019-05-23 09:22:08,042 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,042 INFO L146 ILogger]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1] [2019-05-23 09:22:08,043 INFO L146 ILogger]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,043 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,044 INFO L146 ILogger]: Analyzing trace with hash 1964892333, now seen corresponding path program 8 times [2019-05-23 09:22:08,045 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,064 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,066 INFO L146 ILogger]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,069 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,322 INFO L146 ILogger]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,322 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,322 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:22:08,323 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:22:08,323 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:22:08,324 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:08,324 INFO L146 ILogger]: Start difference. First operand 51 states and 51 transitions. Second operand 11 states. [2019-05-23 09:22:08,424 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,424 INFO L146 ILogger]: Finished difference Result 62 states and 62 transitions. [2019-05-23 09:22:08,425 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:22:08,425 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 50 [2019-05-23 09:22:08,425 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,426 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 09:22:08,426 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 09:22:08,427 INFO L146 ILogger]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:22:08,427 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 09:22:08,431 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 57. [2019-05-23 09:22:08,431 INFO L146 ILogger]: Start removeUnreachable. Operand 57 states. [2019-05-23 09:22:08,432 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-23 09:22:08,432 INFO L146 ILogger]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 50 [2019-05-23 09:22:08,433 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,433 INFO L146 ILogger]: Abstraction has 57 states and 57 transitions. [2019-05-23 09:22:08,433 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:22:08,433 INFO L146 ILogger]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-23 09:22:08,434 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 57 [2019-05-23 09:22:08,434 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,434 INFO L146 ILogger]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1] [2019-05-23 09:22:08,435 INFO L146 ILogger]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,435 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,435 INFO L146 ILogger]: Analyzing trace with hash -564812694, now seen corresponding path program 9 times [2019-05-23 09:22:08,436 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,464 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,466 INFO L146 ILogger]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,470 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,637 INFO L146 ILogger]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,638 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,638 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:22:08,638 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:22:08,638 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:22:08,639 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:22:08,639 INFO L146 ILogger]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2019-05-23 09:22:08,752 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:08,752 INFO L146 ILogger]: Finished difference Result 68 states and 68 transitions. [2019-05-23 09:22:08,752 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:22:08,752 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 56 [2019-05-23 09:22:08,753 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:08,754 INFO L146 ILogger]: With dead ends: 68 [2019-05-23 09:22:08,754 INFO L146 ILogger]: Without dead ends: 68 [2019-05-23 09:22:08,754 INFO L146 ILogger]: 0 DeclaredPredicates, 55 GetRequests, 45 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:22:08,754 INFO L146 ILogger]: Start minimizeSevpa. Operand 68 states. [2019-05-23 09:22:08,758 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-05-23 09:22:08,758 INFO L146 ILogger]: Start removeUnreachable. Operand 63 states. [2019-05-23 09:22:08,759 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-23 09:22:08,759 INFO L146 ILogger]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 56 [2019-05-23 09:22:08,760 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:08,760 INFO L146 ILogger]: Abstraction has 63 states and 63 transitions. [2019-05-23 09:22:08,760 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:22:08,760 INFO L146 ILogger]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-23 09:22:08,761 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 63 [2019-05-23 09:22:08,761 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:08,761 INFO L146 ILogger]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1] [2019-05-23 09:22:08,761 INFO L146 ILogger]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:08,762 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:08,762 INFO L146 ILogger]: Analyzing trace with hash -1352079769, now seen corresponding path program 10 times [2019-05-23 09:22:08,763 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:08,777 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:08,778 INFO L146 ILogger]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:22:08,781 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:08,959 INFO L146 ILogger]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:08,959 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:08,960 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:22:08,960 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:22:08,960 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:22:08,961 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:22:08,961 INFO L146 ILogger]: Start difference. First operand 63 states and 63 transitions. Second operand 13 states. [2019-05-23 09:22:09,037 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Finished difference Result 74 states and 74 transitions. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:22:09,038 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 62 [2019-05-23 09:22:09,039 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,040 INFO L146 ILogger]: With dead ends: 74 [2019-05-23 09:22:09,040 INFO L146 ILogger]: Without dead ends: 74 [2019-05-23 09:22:09,041 INFO L146 ILogger]: 0 DeclaredPredicates, 61 GetRequests, 50 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:22:09,041 INFO L146 ILogger]: Start minimizeSevpa. Operand 74 states. [2019-05-23 09:22:09,046 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 74 to 69. [2019-05-23 09:22:09,047 INFO L146 ILogger]: Start removeUnreachable. Operand 69 states. [2019-05-23 09:22:09,047 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-23 09:22:09,048 INFO L146 ILogger]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 62 [2019-05-23 09:22:09,048 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,048 INFO L146 ILogger]: Abstraction has 69 states and 69 transitions. [2019-05-23 09:22:09,048 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:22:09,048 INFO L146 ILogger]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-23 09:22:09,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 69 [2019-05-23 09:22:09,049 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,050 INFO L146 ILogger]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1] [2019-05-23 09:22:09,050 INFO L146 ILogger]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,050 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,050 INFO L146 ILogger]: Analyzing trace with hash -489687388, now seen corresponding path program 11 times [2019-05-23 09:22:09,051 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,066 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,068 INFO L146 ILogger]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,070 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,363 INFO L146 ILogger]: Checked inductivity of 341 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,363 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,363 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:22:09,363 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:22:09,364 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:22:09,364 INFO L146 ILogger]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:22:09,364 INFO L146 ILogger]: Start difference. First operand 69 states and 69 transitions. Second operand 14 states. [2019-05-23 09:22:09,488 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,489 INFO L146 ILogger]: Finished difference Result 80 states and 80 transitions. [2019-05-23 09:22:09,489 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:22:09,489 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 68 [2019-05-23 09:22:09,490 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,491 INFO L146 ILogger]: With dead ends: 80 [2019-05-23 09:22:09,491 INFO L146 ILogger]: Without dead ends: 80 [2019-05-23 09:22:09,492 INFO L146 ILogger]: 0 DeclaredPredicates, 67 GetRequests, 55 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:22:09,492 INFO L146 ILogger]: Start minimizeSevpa. Operand 80 states. [2019-05-23 09:22:09,496 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-05-23 09:22:09,496 INFO L146 ILogger]: Start removeUnreachable. Operand 75 states. [2019-05-23 09:22:09,497 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-23 09:22:09,497 INFO L146 ILogger]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 68 [2019-05-23 09:22:09,498 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,498 INFO L146 ILogger]: Abstraction has 75 states and 75 transitions. [2019-05-23 09:22:09,498 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:22:09,498 INFO L146 ILogger]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-23 09:22:09,499 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 75 [2019-05-23 09:22:09,499 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,500 INFO L146 ILogger]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1] [2019-05-23 09:22:09,500 INFO L146 ILogger]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,500 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,500 INFO L146 ILogger]: Analyzing trace with hash -1417206495, now seen corresponding path program 12 times [2019-05-23 09:22:09,501 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,530 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,537 INFO L146 ILogger]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,539 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:09,764 INFO L146 ILogger]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:09,764 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:09,764 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:22:09,765 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:22:09,765 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:22:09,765 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:22:09,765 INFO L146 ILogger]: Start difference. First operand 75 states and 75 transitions. Second operand 15 states. [2019-05-23 09:22:09,838 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:09,838 INFO L146 ILogger]: Finished difference Result 86 states and 86 transitions. [2019-05-23 09:22:09,839 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:22:09,839 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 74 [2019-05-23 09:22:09,839 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:09,840 INFO L146 ILogger]: With dead ends: 86 [2019-05-23 09:22:09,840 INFO L146 ILogger]: Without dead ends: 86 [2019-05-23 09:22:09,841 INFO L146 ILogger]: 0 DeclaredPredicates, 73 GetRequests, 60 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:22:09,841 INFO L146 ILogger]: Start minimizeSevpa. Operand 86 states. [2019-05-23 09:22:09,846 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-05-23 09:22:09,846 INFO L146 ILogger]: Start removeUnreachable. Operand 81 states. [2019-05-23 09:22:09,847 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-23 09:22:09,847 INFO L146 ILogger]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 74 [2019-05-23 09:22:09,847 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:09,847 INFO L146 ILogger]: Abstraction has 81 states and 81 transitions. [2019-05-23 09:22:09,847 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:22:09,848 INFO L146 ILogger]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-23 09:22:09,849 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 81 [2019-05-23 09:22:09,849 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:09,849 INFO L146 ILogger]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1] [2019-05-23 09:22:09,849 INFO L146 ILogger]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:09,850 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:09,850 INFO L146 ILogger]: Analyzing trace with hash 34521566, now seen corresponding path program 13 times [2019-05-23 09:22:09,850 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:09,863 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:09,865 INFO L146 ILogger]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:22:09,868 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,025 INFO L146 ILogger]: Checked inductivity of 481 backedges. 0 proven. 481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:10,025 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,025 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:22:10,025 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:22:10,026 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:22:10,026 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:10,026 INFO L146 ILogger]: Start difference. First operand 81 states and 81 transitions. Second operand 16 states. [2019-05-23 09:22:10,107 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,108 INFO L146 ILogger]: Finished difference Result 92 states and 92 transitions. [2019-05-23 09:22:10,109 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:22:10,109 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 80 [2019-05-23 09:22:10,109 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,110 INFO L146 ILogger]: With dead ends: 92 [2019-05-23 09:22:10,110 INFO L146 ILogger]: Without dead ends: 92 [2019-05-23 09:22:10,111 INFO L146 ILogger]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:22:10,112 INFO L146 ILogger]: Start minimizeSevpa. Operand 92 states. [2019-05-23 09:22:10,114 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 92 to 87. [2019-05-23 09:22:10,115 INFO L146 ILogger]: Start removeUnreachable. Operand 87 states. [2019-05-23 09:22:10,116 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-23 09:22:10,116 INFO L146 ILogger]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 80 [2019-05-23 09:22:10,116 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,116 INFO L146 ILogger]: Abstraction has 87 states and 87 transitions. [2019-05-23 09:22:10,116 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:22:10,116 INFO L146 ILogger]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-23 09:22:10,118 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 87 [2019-05-23 09:22:10,118 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,118 INFO L146 ILogger]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1] [2019-05-23 09:22:10,118 INFO L146 ILogger]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,118 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,119 INFO L146 ILogger]: Analyzing trace with hash 1902845147, now seen corresponding path program 14 times [2019-05-23 09:22:10,119 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,133 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,134 INFO L146 ILogger]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,137 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:10,343 INFO L146 ILogger]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:10,344 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:10,344 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:22:10,344 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:22:10,344 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:22:10,345 INFO L146 ILogger]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:22:10,345 INFO L146 ILogger]: Start difference. First operand 87 states and 87 transitions. Second operand 17 states. [2019-05-23 09:22:10,533 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:10,533 INFO L146 ILogger]: Finished difference Result 98 states and 98 transitions. [2019-05-23 09:22:10,534 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:22:10,534 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 86 [2019-05-23 09:22:10,534 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:10,535 INFO L146 ILogger]: With dead ends: 98 [2019-05-23 09:22:10,535 INFO L146 ILogger]: Without dead ends: 98 [2019-05-23 09:22:10,536 INFO L146 ILogger]: 0 DeclaredPredicates, 85 GetRequests, 70 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:22:10,536 INFO L146 ILogger]: Start minimizeSevpa. Operand 98 states. [2019-05-23 09:22:10,539 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 98 to 93. [2019-05-23 09:22:10,539 INFO L146 ILogger]: Start removeUnreachable. Operand 93 states. [2019-05-23 09:22:10,540 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-23 09:22:10,540 INFO L146 ILogger]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 86 [2019-05-23 09:22:10,541 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:10,541 INFO L146 ILogger]: Abstraction has 93 states and 93 transitions. [2019-05-23 09:22:10,541 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:22:10,541 INFO L146 ILogger]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-23 09:22:10,542 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 93 [2019-05-23 09:22:10,542 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:10,543 INFO L146 ILogger]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1] [2019-05-23 09:22:10,543 INFO L146 ILogger]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:10,543 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:10,543 INFO L146 ILogger]: Analyzing trace with hash 606373400, now seen corresponding path program 15 times [2019-05-23 09:22:10,544 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:10,558 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:10,559 INFO L146 ILogger]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 09:22:10,562 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,220 INFO L146 ILogger]: Checked inductivity of 645 backedges. 0 proven. 645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,221 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,221 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:22:11,222 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:22:11,222 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:22:11,222 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:11,223 INFO L146 ILogger]: Start difference. First operand 93 states and 93 transitions. Second operand 18 states. [2019-05-23 09:22:11,312 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,312 INFO L146 ILogger]: Finished difference Result 104 states and 104 transitions. [2019-05-23 09:22:11,312 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:22:11,312 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 92 [2019-05-23 09:22:11,313 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,314 INFO L146 ILogger]: With dead ends: 104 [2019-05-23 09:22:11,314 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 09:22:11,315 INFO L146 ILogger]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:22:11,315 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 09:22:11,318 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 99. [2019-05-23 09:22:11,318 INFO L146 ILogger]: Start removeUnreachable. Operand 99 states. [2019-05-23 09:22:11,319 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-05-23 09:22:11,319 INFO L146 ILogger]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 92 [2019-05-23 09:22:11,319 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,319 INFO L146 ILogger]: Abstraction has 99 states and 99 transitions. [2019-05-23 09:22:11,320 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:22:11,320 INFO L146 ILogger]: Start isEmpty. Operand 99 states and 99 transitions. [2019-05-23 09:22:11,321 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 99 [2019-05-23 09:22:11,321 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,321 INFO L146 ILogger]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1] [2019-05-23 09:22:11,321 INFO L146 ILogger]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,322 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,322 INFO L146 ILogger]: Analyzing trace with hash 826756501, now seen corresponding path program 16 times [2019-05-23 09:22:11,323 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,336 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,338 INFO L146 ILogger]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,341 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:11,620 INFO L146 ILogger]: Checked inductivity of 736 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:11,620 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:11,621 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:22:11,621 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:22:11,621 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:22:11,622 INFO L146 ILogger]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:11,622 INFO L146 ILogger]: Start difference. First operand 99 states and 99 transitions. Second operand 19 states. [2019-05-23 09:22:11,839 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:11,839 INFO L146 ILogger]: Finished difference Result 110 states and 110 transitions. [2019-05-23 09:22:11,839 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:22:11,839 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 98 [2019-05-23 09:22:11,840 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:11,840 INFO L146 ILogger]: With dead ends: 110 [2019-05-23 09:22:11,840 INFO L146 ILogger]: Without dead ends: 110 [2019-05-23 09:22:11,841 INFO L146 ILogger]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:22:11,841 INFO L146 ILogger]: Start minimizeSevpa. Operand 110 states. [2019-05-23 09:22:11,842 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 110 to 105. [2019-05-23 09:22:11,842 INFO L146 ILogger]: Start removeUnreachable. Operand 105 states. [2019-05-23 09:22:11,843 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-05-23 09:22:11,843 INFO L146 ILogger]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 98 [2019-05-23 09:22:11,846 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:11,846 INFO L146 ILogger]: Abstraction has 105 states and 105 transitions. [2019-05-23 09:22:11,847 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:22:11,847 INFO L146 ILogger]: Start isEmpty. Operand 105 states and 105 transitions. [2019-05-23 09:22:11,848 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 105 [2019-05-23 09:22:11,848 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:11,848 INFO L146 ILogger]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1] [2019-05-23 09:22:11,848 INFO L146 ILogger]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:11,849 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:11,850 INFO L146 ILogger]: Analyzing trace with hash 694403922, now seen corresponding path program 17 times [2019-05-23 09:22:11,851 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:11,870 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:11,871 INFO L146 ILogger]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:22:11,881 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,205 INFO L146 ILogger]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,205 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,205 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:22:12,206 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:22:12,206 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:22:12,206 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:12,206 INFO L146 ILogger]: Start difference. First operand 105 states and 105 transitions. Second operand 20 states. [2019-05-23 09:22:12,289 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,289 INFO L146 ILogger]: Finished difference Result 116 states and 116 transitions. [2019-05-23 09:22:12,290 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:22:12,290 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 104 [2019-05-23 09:22:12,290 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,291 INFO L146 ILogger]: With dead ends: 116 [2019-05-23 09:22:12,292 INFO L146 ILogger]: Without dead ends: 116 [2019-05-23 09:22:12,292 INFO L146 ILogger]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:22:12,293 INFO L146 ILogger]: Start minimizeSevpa. Operand 116 states. [2019-05-23 09:22:12,294 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 116 to 111. [2019-05-23 09:22:12,294 INFO L146 ILogger]: Start removeUnreachable. Operand 111 states. [2019-05-23 09:22:12,295 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-05-23 09:22:12,295 INFO L146 ILogger]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 104 [2019-05-23 09:22:12,295 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,295 INFO L146 ILogger]: Abstraction has 111 states and 111 transitions. [2019-05-23 09:22:12,296 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:22:12,296 INFO L146 ILogger]: Start isEmpty. Operand 111 states and 111 transitions. [2019-05-23 09:22:12,296 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 111 [2019-05-23 09:22:12,297 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,297 INFO L146 ILogger]: trace histogram [18, 18, 18, 18, 18, 18, 1, 1] [2019-05-23 09:22:12,297 INFO L146 ILogger]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,297 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,297 INFO L146 ILogger]: Analyzing trace with hash -477218993, now seen corresponding path program 18 times [2019-05-23 09:22:12,298 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,312 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,313 INFO L146 ILogger]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,316 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:12,579 INFO L146 ILogger]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:12,579 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:12,579 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:22:12,580 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:22:12,580 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:22:12,580 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:12,581 INFO L146 ILogger]: Start difference. First operand 111 states and 111 transitions. Second operand 21 states. [2019-05-23 09:22:12,708 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:12,709 INFO L146 ILogger]: Finished difference Result 122 states and 122 transitions. [2019-05-23 09:22:12,709 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:22:12,709 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 110 [2019-05-23 09:22:12,710 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:12,710 INFO L146 ILogger]: With dead ends: 122 [2019-05-23 09:22:12,711 INFO L146 ILogger]: Without dead ends: 122 [2019-05-23 09:22:12,711 INFO L146 ILogger]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:22:12,714 INFO L146 ILogger]: Start minimizeSevpa. Operand 122 states. [2019-05-23 09:22:12,716 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 122 to 117. [2019-05-23 09:22:12,716 INFO L146 ILogger]: Start removeUnreachable. Operand 117 states. [2019-05-23 09:22:12,717 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-05-23 09:22:12,717 INFO L146 ILogger]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 110 [2019-05-23 09:22:12,717 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:12,717 INFO L146 ILogger]: Abstraction has 117 states and 117 transitions. [2019-05-23 09:22:12,717 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:22:12,718 INFO L146 ILogger]: Start isEmpty. Operand 117 states and 117 transitions. [2019-05-23 09:22:12,718 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 117 [2019-05-23 09:22:12,718 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:12,719 INFO L146 ILogger]: trace histogram [19, 19, 19, 19, 19, 19, 1, 1] [2019-05-23 09:22:12,719 INFO L146 ILogger]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:12,719 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:12,719 INFO L146 ILogger]: Analyzing trace with hash -1973487220, now seen corresponding path program 19 times [2019-05-23 09:22:12,720 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:12,743 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:12,745 INFO L146 ILogger]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:22:12,747 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,220 INFO L146 ILogger]: Checked inductivity of 1045 backedges. 0 proven. 1045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,221 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,221 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:22:13,221 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:22:13,221 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:22:13,222 INFO L146 ILogger]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:13,222 INFO L146 ILogger]: Start difference. First operand 117 states and 117 transitions. Second operand 22 states. [2019-05-23 09:22:13,324 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,325 INFO L146 ILogger]: Finished difference Result 128 states and 128 transitions. [2019-05-23 09:22:13,327 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:22:13,327 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 116 [2019-05-23 09:22:13,328 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,329 INFO L146 ILogger]: With dead ends: 128 [2019-05-23 09:22:13,329 INFO L146 ILogger]: Without dead ends: 128 [2019-05-23 09:22:13,330 INFO L146 ILogger]: 0 DeclaredPredicates, 115 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:22:13,330 INFO L146 ILogger]: Start minimizeSevpa. Operand 128 states. [2019-05-23 09:22:13,332 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 128 to 123. [2019-05-23 09:22:13,332 INFO L146 ILogger]: Start removeUnreachable. Operand 123 states. [2019-05-23 09:22:13,332 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-05-23 09:22:13,333 INFO L146 ILogger]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 116 [2019-05-23 09:22:13,333 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,333 INFO L146 ILogger]: Abstraction has 123 states and 123 transitions. [2019-05-23 09:22:13,333 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:22:13,333 INFO L146 ILogger]: Start isEmpty. Operand 123 states and 123 transitions. [2019-05-23 09:22:13,334 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 123 [2019-05-23 09:22:13,334 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,334 INFO L146 ILogger]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1] [2019-05-23 09:22:13,334 INFO L146 ILogger]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,335 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,335 INFO L146 ILogger]: Analyzing trace with hash -386770423, now seen corresponding path program 20 times [2019-05-23 09:22:13,335 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,348 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,349 INFO L146 ILogger]: Trace formula consists of 165 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,351 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:13,780 INFO L146 ILogger]: Checked inductivity of 1160 backedges. 0 proven. 1160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:13,781 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:13,781 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:22:13,781 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:22:13,782 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:22:13,782 INFO L146 ILogger]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:13,782 INFO L146 ILogger]: Start difference. First operand 123 states and 123 transitions. Second operand 23 states. [2019-05-23 09:22:13,901 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:13,901 INFO L146 ILogger]: Finished difference Result 134 states and 134 transitions. [2019-05-23 09:22:13,902 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:22:13,902 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 122 [2019-05-23 09:22:13,902 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:13,903 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 09:22:13,903 INFO L146 ILogger]: Without dead ends: 134 [2019-05-23 09:22:13,904 INFO L146 ILogger]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:22:13,905 INFO L146 ILogger]: Start minimizeSevpa. Operand 134 states. [2019-05-23 09:22:13,907 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 134 to 129. [2019-05-23 09:22:13,907 INFO L146 ILogger]: Start removeUnreachable. Operand 129 states. [2019-05-23 09:22:13,907 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-05-23 09:22:13,907 INFO L146 ILogger]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 122 [2019-05-23 09:22:13,908 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:13,908 INFO L146 ILogger]: Abstraction has 129 states and 129 transitions. [2019-05-23 09:22:13,908 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:22:13,908 INFO L146 ILogger]: Start isEmpty. Operand 129 states and 129 transitions. [2019-05-23 09:22:13,909 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 129 [2019-05-23 09:22:13,909 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:13,909 INFO L146 ILogger]: trace histogram [21, 21, 21, 21, 21, 21, 1, 1] [2019-05-23 09:22:13,909 INFO L146 ILogger]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:13,910 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:13,910 INFO L146 ILogger]: Analyzing trace with hash -135747386, now seen corresponding path program 21 times [2019-05-23 09:22:13,911 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:13,922 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:13,923 INFO L146 ILogger]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:22:13,925 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,237 INFO L146 ILogger]: Checked inductivity of 1281 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,237 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,237 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:22:14,238 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:22:14,238 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:22:14,238 INFO L146 ILogger]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:14,238 INFO L146 ILogger]: Start difference. First operand 129 states and 129 transitions. Second operand 24 states. [2019-05-23 09:22:14,368 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,368 INFO L146 ILogger]: Finished difference Result 140 states and 140 transitions. [2019-05-23 09:22:14,371 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:22:14,371 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 128 [2019-05-23 09:22:14,372 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,373 INFO L146 ILogger]: With dead ends: 140 [2019-05-23 09:22:14,373 INFO L146 ILogger]: Without dead ends: 140 [2019-05-23 09:22:14,373 INFO L146 ILogger]: 0 DeclaredPredicates, 127 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:22:14,373 INFO L146 ILogger]: Start minimizeSevpa. Operand 140 states. [2019-05-23 09:22:14,375 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 140 to 135. [2019-05-23 09:22:14,376 INFO L146 ILogger]: Start removeUnreachable. Operand 135 states. [2019-05-23 09:22:14,376 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-05-23 09:22:14,376 INFO L146 ILogger]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 128 [2019-05-23 09:22:14,377 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,377 INFO L146 ILogger]: Abstraction has 135 states and 135 transitions. [2019-05-23 09:22:14,377 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:22:14,377 INFO L146 ILogger]: Start isEmpty. Operand 135 states and 135 transitions. [2019-05-23 09:22:14,377 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 135 [2019-05-23 09:22:14,378 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,378 INFO L146 ILogger]: trace histogram [22, 22, 22, 22, 22, 22, 1, 1] [2019-05-23 09:22:14,378 INFO L146 ILogger]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,378 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,378 INFO L146 ILogger]: Analyzing trace with hash -1436142141, now seen corresponding path program 22 times [2019-05-23 09:22:14,379 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,389 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,391 INFO L146 ILogger]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,392 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:14,662 INFO L146 ILogger]: Checked inductivity of 1408 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:14,663 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:14,663 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:22:14,663 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:22:14,663 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:22:14,663 INFO L146 ILogger]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:14,664 INFO L146 ILogger]: Start difference. First operand 135 states and 135 transitions. Second operand 25 states. [2019-05-23 09:22:14,784 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:14,784 INFO L146 ILogger]: Finished difference Result 146 states and 146 transitions. [2019-05-23 09:22:14,785 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:22:14,785 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 134 [2019-05-23 09:22:14,785 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:14,787 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:22:14,787 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:22:14,788 INFO L146 ILogger]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:22:14,788 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:22:14,791 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 141. [2019-05-23 09:22:14,791 INFO L146 ILogger]: Start removeUnreachable. Operand 141 states. [2019-05-23 09:22:14,791 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-05-23 09:22:14,792 INFO L146 ILogger]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 134 [2019-05-23 09:22:14,792 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:14,792 INFO L146 ILogger]: Abstraction has 141 states and 141 transitions. [2019-05-23 09:22:14,792 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:22:14,792 INFO L146 ILogger]: Start isEmpty. Operand 141 states and 141 transitions. [2019-05-23 09:22:14,793 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 141 [2019-05-23 09:22:14,793 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:14,793 INFO L146 ILogger]: trace histogram [23, 23, 23, 23, 23, 23, 1, 1] [2019-05-23 09:22:14,793 INFO L146 ILogger]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:14,794 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:14,794 INFO L146 ILogger]: Analyzing trace with hash -82620160, now seen corresponding path program 23 times [2019-05-23 09:22:14,795 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:14,805 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:14,807 INFO L146 ILogger]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 09:22:14,809 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:15,145 INFO L146 ILogger]: Checked inductivity of 1541 backedges. 0 proven. 1541 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:15,145 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:15,145 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:22:15,146 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:22:15,146 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:22:15,146 INFO L146 ILogger]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:15,146 INFO L146 ILogger]: Start difference. First operand 141 states and 141 transitions. Second operand 26 states. [2019-05-23 09:22:15,399 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:15,399 INFO L146 ILogger]: Finished difference Result 152 states and 152 transitions. [2019-05-23 09:22:15,400 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:22:15,400 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 140 [2019-05-23 09:22:15,401 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:15,404 INFO L146 ILogger]: With dead ends: 152 [2019-05-23 09:22:15,404 INFO L146 ILogger]: Without dead ends: 152 [2019-05-23 09:22:15,405 INFO L146 ILogger]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:22:15,405 INFO L146 ILogger]: Start minimizeSevpa. Operand 152 states. [2019-05-23 09:22:15,407 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-05-23 09:22:15,407 INFO L146 ILogger]: Start removeUnreachable. Operand 147 states. [2019-05-23 09:22:15,408 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-05-23 09:22:15,408 INFO L146 ILogger]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 140 [2019-05-23 09:22:15,408 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:15,408 INFO L146 ILogger]: Abstraction has 147 states and 147 transitions. [2019-05-23 09:22:15,408 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:22:15,408 INFO L146 ILogger]: Start isEmpty. Operand 147 states and 147 transitions. [2019-05-23 09:22:15,409 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 147 [2019-05-23 09:22:15,409 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:15,409 INFO L146 ILogger]: trace histogram [24, 24, 24, 24, 24, 24, 1, 1] [2019-05-23 09:22:15,410 INFO L146 ILogger]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:15,410 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:15,410 INFO L146 ILogger]: Analyzing trace with hash 958155389, now seen corresponding path program 24 times [2019-05-23 09:22:15,411 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:15,422 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:15,423 INFO L146 ILogger]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:22:15,425 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,068 INFO L146 ILogger]: Checked inductivity of 1680 backedges. 0 proven. 1680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,069 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,069 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:22:16,069 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:22:16,069 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:22:16,070 INFO L146 ILogger]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:16,070 INFO L146 ILogger]: Start difference. First operand 147 states and 147 transitions. Second operand 27 states. [2019-05-23 09:22:16,279 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,279 INFO L146 ILogger]: Finished difference Result 158 states and 158 transitions. [2019-05-23 09:22:16,279 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:22:16,280 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 146 [2019-05-23 09:22:16,280 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,281 INFO L146 ILogger]: With dead ends: 158 [2019-05-23 09:22:16,282 INFO L146 ILogger]: Without dead ends: 158 [2019-05-23 09:22:16,283 INFO L146 ILogger]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:22:16,283 INFO L146 ILogger]: Start minimizeSevpa. Operand 158 states. [2019-05-23 09:22:16,286 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 158 to 153. [2019-05-23 09:22:16,286 INFO L146 ILogger]: Start removeUnreachable. Operand 153 states. [2019-05-23 09:22:16,287 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-05-23 09:22:16,287 INFO L146 ILogger]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 146 [2019-05-23 09:22:16,287 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,287 INFO L146 ILogger]: Abstraction has 153 states and 153 transitions. [2019-05-23 09:22:16,287 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:22:16,288 INFO L146 ILogger]: Start isEmpty. Operand 153 states and 153 transitions. [2019-05-23 09:22:16,288 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 153 [2019-05-23 09:22:16,288 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,289 INFO L146 ILogger]: trace histogram [25, 25, 25, 25, 25, 25, 1, 1] [2019-05-23 09:22:16,289 INFO L146 ILogger]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,289 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,289 INFO L146 ILogger]: Analyzing trace with hash -1791921606, now seen corresponding path program 25 times [2019-05-23 09:22:16,290 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,302 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,304 INFO L146 ILogger]: Trace formula consists of 205 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,307 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:16,811 INFO L146 ILogger]: Checked inductivity of 1825 backedges. 0 proven. 1825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:16,811 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:16,811 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:22:16,811 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:22:16,812 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:22:16,812 INFO L146 ILogger]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:16,812 INFO L146 ILogger]: Start difference. First operand 153 states and 153 transitions. Second operand 28 states. [2019-05-23 09:22:16,948 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:16,948 INFO L146 ILogger]: Finished difference Result 164 states and 164 transitions. [2019-05-23 09:22:16,948 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:22:16,948 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 152 [2019-05-23 09:22:16,949 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:16,950 INFO L146 ILogger]: With dead ends: 164 [2019-05-23 09:22:16,950 INFO L146 ILogger]: Without dead ends: 164 [2019-05-23 09:22:16,951 INFO L146 ILogger]: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:22:16,951 INFO L146 ILogger]: Start minimizeSevpa. Operand 164 states. [2019-05-23 09:22:16,954 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 164 to 159. [2019-05-23 09:22:16,954 INFO L146 ILogger]: Start removeUnreachable. Operand 159 states. [2019-05-23 09:22:16,954 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-05-23 09:22:16,955 INFO L146 ILogger]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 152 [2019-05-23 09:22:16,955 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:16,955 INFO L146 ILogger]: Abstraction has 159 states and 159 transitions. [2019-05-23 09:22:16,955 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:22:16,955 INFO L146 ILogger]: Start isEmpty. Operand 159 states and 159 transitions. [2019-05-23 09:22:16,956 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 159 [2019-05-23 09:22:16,956 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:16,956 INFO L146 ILogger]: trace histogram [26, 26, 26, 26, 26, 26, 1, 1] [2019-05-23 09:22:16,956 INFO L146 ILogger]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:16,956 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:16,957 INFO L146 ILogger]: Analyzing trace with hash -293136329, now seen corresponding path program 26 times [2019-05-23 09:22:16,957 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:16,968 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:16,969 INFO L146 ILogger]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:22:16,971 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:17,597 INFO L146 ILogger]: Checked inductivity of 1976 backedges. 0 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:17,597 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:17,597 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:22:17,598 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:22:17,598 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:22:17,598 INFO L146 ILogger]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:17,598 INFO L146 ILogger]: Start difference. First operand 159 states and 159 transitions. Second operand 29 states. [2019-05-23 09:22:17,710 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:17,711 INFO L146 ILogger]: Finished difference Result 170 states and 170 transitions. [2019-05-23 09:22:17,711 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:22:17,711 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 158 [2019-05-23 09:22:17,712 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:17,713 INFO L146 ILogger]: With dead ends: 170 [2019-05-23 09:22:17,713 INFO L146 ILogger]: Without dead ends: 170 [2019-05-23 09:22:17,714 INFO L146 ILogger]: 0 DeclaredPredicates, 157 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:22:17,714 INFO L146 ILogger]: Start minimizeSevpa. Operand 170 states. [2019-05-23 09:22:17,717 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-05-23 09:22:17,717 INFO L146 ILogger]: Start removeUnreachable. Operand 165 states. [2019-05-23 09:22:17,717 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-05-23 09:22:17,718 INFO L146 ILogger]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 158 [2019-05-23 09:22:17,718 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:17,718 INFO L146 ILogger]: Abstraction has 165 states and 165 transitions. [2019-05-23 09:22:17,718 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:22:17,718 INFO L146 ILogger]: Start isEmpty. Operand 165 states and 165 transitions. [2019-05-23 09:22:17,719 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 165 [2019-05-23 09:22:17,719 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:17,719 INFO L146 ILogger]: trace histogram [27, 27, 27, 27, 27, 27, 1, 1] [2019-05-23 09:22:17,719 INFO L146 ILogger]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:17,719 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:17,720 INFO L146 ILogger]: Analyzing trace with hash -539653004, now seen corresponding path program 27 times [2019-05-23 09:22:17,720 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:17,731 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:17,732 INFO L146 ILogger]: Trace formula consists of 221 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 09:22:17,735 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:18,934 INFO L146 ILogger]: Checked inductivity of 2133 backedges. 0 proven. 2133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:18,934 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:18,934 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:22:18,934 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:22:18,935 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:22:18,935 INFO L146 ILogger]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:18,935 INFO L146 ILogger]: Start difference. First operand 165 states and 165 transitions. Second operand 30 states. [2019-05-23 09:22:19,057 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,057 INFO L146 ILogger]: Finished difference Result 176 states and 176 transitions. [2019-05-23 09:22:19,057 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:22:19,058 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 164 [2019-05-23 09:22:19,058 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,059 INFO L146 ILogger]: With dead ends: 176 [2019-05-23 09:22:19,060 INFO L146 ILogger]: Without dead ends: 176 [2019-05-23 09:22:19,061 INFO L146 ILogger]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:22:19,061 INFO L146 ILogger]: Start minimizeSevpa. Operand 176 states. [2019-05-23 09:22:19,063 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 176 to 171. [2019-05-23 09:22:19,064 INFO L146 ILogger]: Start removeUnreachable. Operand 171 states. [2019-05-23 09:22:19,064 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-05-23 09:22:19,064 INFO L146 ILogger]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 164 [2019-05-23 09:22:19,065 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,065 INFO L146 ILogger]: Abstraction has 171 states and 171 transitions. [2019-05-23 09:22:19,065 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:22:19,065 INFO L146 ILogger]: Start isEmpty. Operand 171 states and 171 transitions. [2019-05-23 09:22:19,066 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 171 [2019-05-23 09:22:19,066 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,066 INFO L146 ILogger]: trace histogram [28, 28, 28, 28, 28, 28, 1, 1] [2019-05-23 09:22:19,066 INFO L146 ILogger]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,066 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,066 INFO L146 ILogger]: Analyzing trace with hash 207167217, now seen corresponding path program 28 times [2019-05-23 09:22:19,067 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,078 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,080 INFO L146 ILogger]: Trace formula consists of 229 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,082 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:19,495 INFO L146 ILogger]: Checked inductivity of 2296 backedges. 0 proven. 2296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:19,496 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:19,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:22:19,496 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:22:19,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:22:19,497 INFO L146 ILogger]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:19,497 INFO L146 ILogger]: Start difference. First operand 171 states and 171 transitions. Second operand 31 states. [2019-05-23 09:22:19,630 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:19,631 INFO L146 ILogger]: Finished difference Result 182 states and 182 transitions. [2019-05-23 09:22:19,631 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:22:19,631 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 170 [2019-05-23 09:22:19,632 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:19,633 INFO L146 ILogger]: With dead ends: 182 [2019-05-23 09:22:19,634 INFO L146 ILogger]: Without dead ends: 182 [2019-05-23 09:22:19,635 INFO L146 ILogger]: 0 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:22:19,635 INFO L146 ILogger]: Start minimizeSevpa. Operand 182 states. [2019-05-23 09:22:19,638 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 182 to 177. [2019-05-23 09:22:19,638 INFO L146 ILogger]: Start removeUnreachable. Operand 177 states. [2019-05-23 09:22:19,639 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-05-23 09:22:19,639 INFO L146 ILogger]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 170 [2019-05-23 09:22:19,639 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:19,639 INFO L146 ILogger]: Abstraction has 177 states and 177 transitions. [2019-05-23 09:22:19,639 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:22:19,640 INFO L146 ILogger]: Start isEmpty. Operand 177 states and 177 transitions. [2019-05-23 09:22:19,641 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 177 [2019-05-23 09:22:19,641 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:19,641 INFO L146 ILogger]: trace histogram [29, 29, 29, 29, 29, 29, 1, 1] [2019-05-23 09:22:19,641 INFO L146 ILogger]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:19,641 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:19,642 INFO L146 ILogger]: Analyzing trace with hash -1395515474, now seen corresponding path program 29 times [2019-05-23 09:22:19,642 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:19,655 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:19,657 INFO L146 ILogger]: Trace formula consists of 237 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:22:19,660 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:20,102 INFO L146 ILogger]: Checked inductivity of 2465 backedges. 0 proven. 2465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:20,102 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:20,102 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:22:20,102 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:22:20,103 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:22:20,103 INFO L146 ILogger]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:20,103 INFO L146 ILogger]: Start difference. First operand 177 states and 177 transitions. Second operand 32 states. [2019-05-23 09:22:21,194 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:21,194 INFO L146 ILogger]: Finished difference Result 188 states and 188 transitions. [2019-05-23 09:22:21,195 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:22:21,195 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 176 [2019-05-23 09:22:21,195 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:21,196 INFO L146 ILogger]: With dead ends: 188 [2019-05-23 09:22:21,196 INFO L146 ILogger]: Without dead ends: 188 [2019-05-23 09:22:21,197 INFO L146 ILogger]: 0 DeclaredPredicates, 175 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:22:21,197 INFO L146 ILogger]: Start minimizeSevpa. Operand 188 states. [2019-05-23 09:22:21,199 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 188 to 183. [2019-05-23 09:22:21,200 INFO L146 ILogger]: Start removeUnreachable. Operand 183 states. [2019-05-23 09:22:21,200 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-05-23 09:22:21,200 INFO L146 ILogger]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 176 [2019-05-23 09:22:21,201 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:21,201 INFO L146 ILogger]: Abstraction has 183 states and 183 transitions. [2019-05-23 09:22:21,201 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:22:21,201 INFO L146 ILogger]: Start isEmpty. Operand 183 states and 183 transitions. [2019-05-23 09:22:21,202 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 183 [2019-05-23 09:22:21,202 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:21,202 INFO L146 ILogger]: trace histogram [30, 30, 30, 30, 30, 30, 1, 1] [2019-05-23 09:22:21,202 INFO L146 ILogger]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:21,202 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:21,203 INFO L146 ILogger]: Analyzing trace with hash 1552211627, now seen corresponding path program 30 times [2019-05-23 09:22:21,203 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:21,215 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:21,216 INFO L146 ILogger]: Trace formula consists of 245 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:22:21,219 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:22,448 INFO L146 ILogger]: Checked inductivity of 2640 backedges. 0 proven. 2640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:22,449 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:22,449 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:22:22,449 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:22:22,449 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:22:22,450 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:22,450 INFO L146 ILogger]: Start difference. First operand 183 states and 183 transitions. Second operand 33 states. [2019-05-23 09:22:22,625 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:22,625 INFO L146 ILogger]: Finished difference Result 194 states and 194 transitions. [2019-05-23 09:22:22,626 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:22:22,626 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 182 [2019-05-23 09:22:22,626 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:22,628 INFO L146 ILogger]: With dead ends: 194 [2019-05-23 09:22:22,628 INFO L146 ILogger]: Without dead ends: 194 [2019-05-23 09:22:22,629 INFO L146 ILogger]: 0 DeclaredPredicates, 181 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:22:22,629 INFO L146 ILogger]: Start minimizeSevpa. Operand 194 states. [2019-05-23 09:22:22,632 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-05-23 09:22:22,632 INFO L146 ILogger]: Start removeUnreachable. Operand 189 states. [2019-05-23 09:22:22,633 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-05-23 09:22:22,633 INFO L146 ILogger]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 182 [2019-05-23 09:22:22,634 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:22,634 INFO L146 ILogger]: Abstraction has 189 states and 189 transitions. [2019-05-23 09:22:22,634 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:22:22,634 INFO L146 ILogger]: Start isEmpty. Operand 189 states and 189 transitions. [2019-05-23 09:22:22,635 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 189 [2019-05-23 09:22:22,635 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:22,635 INFO L146 ILogger]: trace histogram [31, 31, 31, 31, 31, 31, 1, 1] [2019-05-23 09:22:22,635 INFO L146 ILogger]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:22,636 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:22,636 INFO L146 ILogger]: Analyzing trace with hash 641313768, now seen corresponding path program 31 times [2019-05-23 09:22:22,636 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:22,648 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:22,649 INFO L146 ILogger]: Trace formula consists of 253 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:22:22,652 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:23,701 INFO L146 ILogger]: Checked inductivity of 2821 backedges. 0 proven. 2821 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:23,702 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:23,702 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:22:23,702 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:22:23,703 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:22:23,703 INFO L146 ILogger]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:23,703 INFO L146 ILogger]: Start difference. First operand 189 states and 189 transitions. Second operand 34 states. [2019-05-23 09:22:23,977 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:23,977 INFO L146 ILogger]: Finished difference Result 200 states and 200 transitions. [2019-05-23 09:22:23,978 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:22:23,978 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 188 [2019-05-23 09:22:23,978 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:23,980 INFO L146 ILogger]: With dead ends: 200 [2019-05-23 09:22:23,980 INFO L146 ILogger]: Without dead ends: 200 [2019-05-23 09:22:23,981 INFO L146 ILogger]: 0 DeclaredPredicates, 187 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:22:23,981 INFO L146 ILogger]: Start minimizeSevpa. Operand 200 states. [2019-05-23 09:22:23,984 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 200 to 195. [2019-05-23 09:22:23,984 INFO L146 ILogger]: Start removeUnreachable. Operand 195 states. [2019-05-23 09:22:23,985 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-05-23 09:22:23,985 INFO L146 ILogger]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 188 [2019-05-23 09:22:23,985 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:23,985 INFO L146 ILogger]: Abstraction has 195 states and 195 transitions. [2019-05-23 09:22:23,985 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:22:23,985 INFO L146 ILogger]: Start isEmpty. Operand 195 states and 195 transitions. [2019-05-23 09:22:23,986 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 195 [2019-05-23 09:22:23,986 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:23,987 INFO L146 ILogger]: trace histogram [32, 32, 32, 32, 32, 32, 1, 1] [2019-05-23 09:22:23,987 INFO L146 ILogger]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:23,987 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:23,987 INFO L146 ILogger]: Analyzing trace with hash -784541851, now seen corresponding path program 32 times [2019-05-23 09:22:23,988 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:23,999 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:24,001 INFO L146 ILogger]: Trace formula consists of 261 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:22:24,003 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:24,566 INFO L146 ILogger]: Checked inductivity of 3008 backedges. 0 proven. 3008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:24,566 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:24,567 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:22:24,567 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:22:24,567 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:22:24,568 INFO L146 ILogger]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:24,568 INFO L146 ILogger]: Start difference. First operand 195 states and 195 transitions. Second operand 35 states. [2019-05-23 09:22:25,002 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,003 INFO L146 ILogger]: Finished difference Result 206 states and 206 transitions. [2019-05-23 09:22:25,003 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:22:25,003 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 194 [2019-05-23 09:22:25,004 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,005 INFO L146 ILogger]: With dead ends: 206 [2019-05-23 09:22:25,005 INFO L146 ILogger]: Without dead ends: 206 [2019-05-23 09:22:25,006 INFO L146 ILogger]: 0 DeclaredPredicates, 193 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:22:25,007 INFO L146 ILogger]: Start minimizeSevpa. Operand 206 states. [2019-05-23 09:22:25,009 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 206 to 201. [2019-05-23 09:22:25,009 INFO L146 ILogger]: Start removeUnreachable. Operand 201 states. [2019-05-23 09:22:25,010 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-05-23 09:22:25,010 INFO L146 ILogger]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 194 [2019-05-23 09:22:25,010 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,010 INFO L146 ILogger]: Abstraction has 201 states and 201 transitions. [2019-05-23 09:22:25,010 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:22:25,011 INFO L146 ILogger]: Start isEmpty. Operand 201 states and 201 transitions. [2019-05-23 09:22:25,011 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 201 [2019-05-23 09:22:25,011 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,012 INFO L146 ILogger]: trace histogram [33, 33, 33, 33, 33, 33, 1, 1] [2019-05-23 09:22:25,012 INFO L146 ILogger]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,012 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,012 INFO L146 ILogger]: Analyzing trace with hash 1851699490, now seen corresponding path program 33 times [2019-05-23 09:22:25,013 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,025 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,026 INFO L146 ILogger]: Trace formula consists of 269 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,029 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:25,611 INFO L146 ILogger]: Checked inductivity of 3201 backedges. 0 proven. 3201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:25,611 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:25,611 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:22:25,611 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:22:25,612 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:22:25,612 INFO L146 ILogger]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:25,612 INFO L146 ILogger]: Start difference. First operand 201 states and 201 transitions. Second operand 36 states. [2019-05-23 09:22:25,747 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:25,747 INFO L146 ILogger]: Finished difference Result 212 states and 212 transitions. [2019-05-23 09:22:25,747 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:22:25,748 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 200 [2019-05-23 09:22:25,748 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:25,749 INFO L146 ILogger]: With dead ends: 212 [2019-05-23 09:22:25,749 INFO L146 ILogger]: Without dead ends: 212 [2019-05-23 09:22:25,750 INFO L146 ILogger]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:22:25,751 INFO L146 ILogger]: Start minimizeSevpa. Operand 212 states. [2019-05-23 09:22:25,753 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 212 to 207. [2019-05-23 09:22:25,753 INFO L146 ILogger]: Start removeUnreachable. Operand 207 states. [2019-05-23 09:22:25,754 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-05-23 09:22:25,754 INFO L146 ILogger]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 200 [2019-05-23 09:22:25,754 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:25,755 INFO L146 ILogger]: Abstraction has 207 states and 207 transitions. [2019-05-23 09:22:25,755 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:22:25,755 INFO L146 ILogger]: Start isEmpty. Operand 207 states and 207 transitions. [2019-05-23 09:22:25,756 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 207 [2019-05-23 09:22:25,756 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:25,756 INFO L146 ILogger]: trace histogram [34, 34, 34, 34, 34, 34, 1, 1] [2019-05-23 09:22:25,756 INFO L146 ILogger]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:25,756 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:25,757 INFO L146 ILogger]: Analyzing trace with hash 619940127, now seen corresponding path program 34 times [2019-05-23 09:22:25,757 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:25,769 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:25,770 INFO L146 ILogger]: Trace formula consists of 277 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:22:25,773 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:26,723 INFO L146 ILogger]: Checked inductivity of 3400 backedges. 0 proven. 3400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:26,724 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:26,724 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:22:26,724 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:22:26,725 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:22:26,725 INFO L146 ILogger]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:26,725 INFO L146 ILogger]: Start difference. First operand 207 states and 207 transitions. Second operand 37 states. [2019-05-23 09:22:26,966 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:26,966 INFO L146 ILogger]: Finished difference Result 218 states and 218 transitions. [2019-05-23 09:22:26,966 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:22:26,966 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 206 [2019-05-23 09:22:26,967 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:26,968 INFO L146 ILogger]: With dead ends: 218 [2019-05-23 09:22:26,968 INFO L146 ILogger]: Without dead ends: 218 [2019-05-23 09:22:26,969 INFO L146 ILogger]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:22:26,969 INFO L146 ILogger]: Start minimizeSevpa. Operand 218 states. [2019-05-23 09:22:26,971 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 218 to 213. [2019-05-23 09:22:26,971 INFO L146 ILogger]: Start removeUnreachable. Operand 213 states. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 206 [2019-05-23 09:22:26,972 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Abstraction has 213 states and 213 transitions. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:22:26,972 INFO L146 ILogger]: Start isEmpty. Operand 213 states and 213 transitions. [2019-05-23 09:22:26,973 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 213 [2019-05-23 09:22:26,973 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:26,973 INFO L146 ILogger]: trace histogram [35, 35, 35, 35, 35, 35, 1, 1] [2019-05-23 09:22:26,974 INFO L146 ILogger]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:26,974 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:26,974 INFO L146 ILogger]: Analyzing trace with hash 1070837596, now seen corresponding path program 35 times [2019-05-23 09:22:26,975 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:26,988 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:26,989 INFO L146 ILogger]: Trace formula consists of 285 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 09:22:26,992 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:27,584 INFO L146 ILogger]: Checked inductivity of 3605 backedges. 0 proven. 3605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:27,585 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:27,585 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:22:27,585 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:22:27,586 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:22:27,586 INFO L146 ILogger]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:27,587 INFO L146 ILogger]: Start difference. First operand 213 states and 213 transitions. Second operand 38 states. [2019-05-23 09:22:27,782 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:27,782 INFO L146 ILogger]: Finished difference Result 224 states and 224 transitions. [2019-05-23 09:22:27,782 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:22:27,783 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 212 [2019-05-23 09:22:27,783 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:27,784 INFO L146 ILogger]: With dead ends: 224 [2019-05-23 09:22:27,784 INFO L146 ILogger]: Without dead ends: 224 [2019-05-23 09:22:27,785 INFO L146 ILogger]: 0 DeclaredPredicates, 211 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:22:27,786 INFO L146 ILogger]: Start minimizeSevpa. Operand 224 states. [2019-05-23 09:22:27,789 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-05-23 09:22:27,789 INFO L146 ILogger]: Start removeUnreachable. Operand 219 states. [2019-05-23 09:22:27,789 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-05-23 09:22:27,790 INFO L146 ILogger]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 212 [2019-05-23 09:22:27,790 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:27,790 INFO L146 ILogger]: Abstraction has 219 states and 219 transitions. [2019-05-23 09:22:27,790 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:22:27,790 INFO L146 ILogger]: Start isEmpty. Operand 219 states and 219 transitions. [2019-05-23 09:22:27,792 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 219 [2019-05-23 09:22:27,792 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:27,792 INFO L146 ILogger]: trace histogram [36, 36, 36, 36, 36, 36, 1, 1] [2019-05-23 09:22:27,792 INFO L146 ILogger]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:27,792 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:27,793 INFO L146 ILogger]: Analyzing trace with hash 2052813785, now seen corresponding path program 36 times [2019-05-23 09:22:27,793 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:27,808 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:27,822 INFO L146 ILogger]: Trace formula consists of 293 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:22:27,825 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:29,910 INFO L146 ILogger]: Checked inductivity of 3816 backedges. 0 proven. 3816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:29,910 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:29,911 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:22:29,911 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:22:29,911 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:22:29,912 INFO L146 ILogger]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:22:29,912 INFO L146 ILogger]: Start difference. First operand 219 states and 219 transitions. Second operand 39 states. [2019-05-23 09:22:30,094 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:30,095 INFO L146 ILogger]: Finished difference Result 230 states and 230 transitions. [2019-05-23 09:22:30,095 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:22:30,095 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 218 [2019-05-23 09:22:30,096 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:30,097 INFO L146 ILogger]: With dead ends: 230 [2019-05-23 09:22:30,097 INFO L146 ILogger]: Without dead ends: 230 [2019-05-23 09:22:30,098 INFO L146 ILogger]: 0 DeclaredPredicates, 217 GetRequests, 180 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:22:30,098 INFO L146 ILogger]: Start minimizeSevpa. Operand 230 states. [2019-05-23 09:22:30,101 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 230 to 225. [2019-05-23 09:22:30,101 INFO L146 ILogger]: Start removeUnreachable. Operand 225 states. [2019-05-23 09:22:30,101 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-05-23 09:22:30,102 INFO L146 ILogger]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 218 [2019-05-23 09:22:30,102 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:30,102 INFO L146 ILogger]: Abstraction has 225 states and 225 transitions. [2019-05-23 09:22:30,102 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:22:30,102 INFO L146 ILogger]: Start isEmpty. Operand 225 states and 225 transitions. [2019-05-23 09:22:30,103 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 225 [2019-05-23 09:22:30,103 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:30,103 INFO L146 ILogger]: trace histogram [37, 37, 37, 37, 37, 37, 1, 1] [2019-05-23 09:22:30,104 INFO L146 ILogger]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:30,104 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:30,104 INFO L146 ILogger]: Analyzing trace with hash -1922357610, now seen corresponding path program 37 times [2019-05-23 09:22:30,105 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:30,118 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:30,120 INFO L146 ILogger]: Trace formula consists of 301 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:22:30,122 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:30,798 INFO L146 ILogger]: Checked inductivity of 4033 backedges. 0 proven. 4033 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:30,798 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:30,798 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:22:30,799 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:22:30,799 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:22:30,799 INFO L146 ILogger]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:22:30,800 INFO L146 ILogger]: Start difference. First operand 225 states and 225 transitions. Second operand 40 states. [2019-05-23 09:22:30,962 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:30,962 INFO L146 ILogger]: Finished difference Result 236 states and 236 transitions. [2019-05-23 09:22:30,963 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:22:30,963 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 224 [2019-05-23 09:22:30,963 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:30,965 INFO L146 ILogger]: With dead ends: 236 [2019-05-23 09:22:30,965 INFO L146 ILogger]: Without dead ends: 236 [2019-05-23 09:22:30,966 INFO L146 ILogger]: 0 DeclaredPredicates, 223 GetRequests, 185 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:22:30,966 INFO L146 ILogger]: Start minimizeSevpa. Operand 236 states. [2019-05-23 09:22:30,968 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 236 to 231. [2019-05-23 09:22:30,968 INFO L146 ILogger]: Start removeUnreachable. Operand 231 states. [2019-05-23 09:22:30,968 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-05-23 09:22:30,968 INFO L146 ILogger]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 224 [2019-05-23 09:22:30,969 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:30,969 INFO L146 ILogger]: Abstraction has 231 states and 231 transitions. [2019-05-23 09:22:30,969 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:22:30,969 INFO L146 ILogger]: Start isEmpty. Operand 231 states and 231 transitions. [2019-05-23 09:22:30,970 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 231 [2019-05-23 09:22:30,970 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:30,970 INFO L146 ILogger]: trace histogram [38, 38, 38, 38, 38, 38, 1, 1] [2019-05-23 09:22:30,970 INFO L146 ILogger]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:30,970 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:30,970 INFO L146 ILogger]: Analyzing trace with hash -60352621, now seen corresponding path program 38 times [2019-05-23 09:22:30,971 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:30,984 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:30,986 INFO L146 ILogger]: Trace formula consists of 309 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:22:30,988 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:31,821 INFO L146 ILogger]: Checked inductivity of 4256 backedges. 0 proven. 4256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:31,821 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:31,821 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:22:31,821 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:22:31,822 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:22:31,822 INFO L146 ILogger]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:22:31,822 INFO L146 ILogger]: Start difference. First operand 231 states and 231 transitions. Second operand 41 states. [2019-05-23 09:22:31,983 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:31,983 INFO L146 ILogger]: Finished difference Result 242 states and 242 transitions. [2019-05-23 09:22:31,983 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:22:31,984 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 230 [2019-05-23 09:22:31,984 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:31,985 INFO L146 ILogger]: With dead ends: 242 [2019-05-23 09:22:31,986 INFO L146 ILogger]: Without dead ends: 242 [2019-05-23 09:22:31,987 INFO L146 ILogger]: 0 DeclaredPredicates, 229 GetRequests, 190 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:22:31,987 INFO L146 ILogger]: Start minimizeSevpa. Operand 242 states. [2019-05-23 09:22:31,990 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 242 to 237. [2019-05-23 09:22:31,990 INFO L146 ILogger]: Start removeUnreachable. Operand 237 states. [2019-05-23 09:22:31,990 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-05-23 09:22:31,990 INFO L146 ILogger]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 230 [2019-05-23 09:22:31,991 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:31,991 INFO L146 ILogger]: Abstraction has 237 states and 237 transitions. [2019-05-23 09:22:31,991 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:22:31,991 INFO L146 ILogger]: Start isEmpty. Operand 237 states and 237 transitions. [2019-05-23 09:22:31,992 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 237 [2019-05-23 09:22:31,992 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:31,992 INFO L146 ILogger]: trace histogram [39, 39, 39, 39, 39, 39, 1, 1] [2019-05-23 09:22:31,992 INFO L146 ILogger]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:31,993 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:31,993 INFO L146 ILogger]: Analyzing trace with hash 574068432, now seen corresponding path program 39 times [2019-05-23 09:22:31,993 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,006 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,008 INFO L146 ILogger]: Trace formula consists of 317 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,011 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:32,742 INFO L146 ILogger]: Checked inductivity of 4485 backedges. 0 proven. 4485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:32,743 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:32,743 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:22:32,743 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:22:32,743 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:22:32,744 INFO L146 ILogger]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:32,744 INFO L146 ILogger]: Start difference. First operand 237 states and 237 transitions. Second operand 42 states. [2019-05-23 09:22:32,970 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:32,971 INFO L146 ILogger]: Finished difference Result 248 states and 248 transitions. [2019-05-23 09:22:32,971 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:22:32,971 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 236 [2019-05-23 09:22:32,971 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:32,973 INFO L146 ILogger]: With dead ends: 248 [2019-05-23 09:22:32,973 INFO L146 ILogger]: Without dead ends: 248 [2019-05-23 09:22:32,974 INFO L146 ILogger]: 0 DeclaredPredicates, 235 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:22:32,974 INFO L146 ILogger]: Start minimizeSevpa. Operand 248 states. [2019-05-23 09:22:32,976 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 248 to 243. [2019-05-23 09:22:32,976 INFO L146 ILogger]: Start removeUnreachable. Operand 243 states. [2019-05-23 09:22:32,977 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-05-23 09:22:32,977 INFO L146 ILogger]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 236 [2019-05-23 09:22:32,977 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:32,977 INFO L146 ILogger]: Abstraction has 243 states and 243 transitions. [2019-05-23 09:22:32,977 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:22:32,977 INFO L146 ILogger]: Start isEmpty. Operand 243 states and 243 transitions. [2019-05-23 09:22:32,978 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 243 [2019-05-23 09:22:32,978 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:32,978 INFO L146 ILogger]: trace histogram [40, 40, 40, 40, 40, 40, 1, 1] [2019-05-23 09:22:32,978 INFO L146 ILogger]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:32,979 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:32,979 INFO L146 ILogger]: Analyzing trace with hash 2118710349, now seen corresponding path program 40 times [2019-05-23 09:22:32,979 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:32,993 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:32,994 INFO L146 ILogger]: Trace formula consists of 325 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:22:32,997 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:33,712 INFO L146 ILogger]: Checked inductivity of 4720 backedges. 0 proven. 4720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:33,713 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:33,713 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:22:33,714 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:22:33,714 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:22:33,714 INFO L146 ILogger]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:22:33,715 INFO L146 ILogger]: Start difference. First operand 243 states and 243 transitions. Second operand 43 states. [2019-05-23 09:22:33,900 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:33,901 INFO L146 ILogger]: Finished difference Result 254 states and 254 transitions. [2019-05-23 09:22:33,901 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:22:33,901 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 242 [2019-05-23 09:22:33,902 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:33,903 INFO L146 ILogger]: With dead ends: 254 [2019-05-23 09:22:33,903 INFO L146 ILogger]: Without dead ends: 254 [2019-05-23 09:22:33,904 INFO L146 ILogger]: 0 DeclaredPredicates, 241 GetRequests, 200 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:22:33,905 INFO L146 ILogger]: Start minimizeSevpa. Operand 254 states. [2019-05-23 09:22:33,907 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 254 to 249. [2019-05-23 09:22:33,907 INFO L146 ILogger]: Start removeUnreachable. Operand 249 states. [2019-05-23 09:22:33,907 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-05-23 09:22:33,908 INFO L146 ILogger]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 242 [2019-05-23 09:22:33,908 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:33,908 INFO L146 ILogger]: Abstraction has 249 states and 249 transitions. [2019-05-23 09:22:33,908 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:22:33,908 INFO L146 ILogger]: Start isEmpty. Operand 249 states and 249 transitions. [2019-05-23 09:22:33,909 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 249 [2019-05-23 09:22:33,909 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:33,910 INFO L146 ILogger]: trace histogram [41, 41, 41, 41, 41, 41, 1, 1] [2019-05-23 09:22:33,910 INFO L146 ILogger]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:33,910 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:33,910 INFO L146 ILogger]: Analyzing trace with hash 1099661322, now seen corresponding path program 41 times [2019-05-23 09:22:33,911 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:33,923 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:33,925 INFO L146 ILogger]: Trace formula consists of 333 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 09:22:33,928 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:36,124 INFO L146 ILogger]: Checked inductivity of 4961 backedges. 0 proven. 4961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:36,124 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:36,124 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:22:36,124 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:22:36,125 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:22:36,125 INFO L146 ILogger]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:36,125 INFO L146 ILogger]: Start difference. First operand 249 states and 249 transitions. Second operand 44 states. [2019-05-23 09:22:36,335 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:36,335 INFO L146 ILogger]: Finished difference Result 260 states and 260 transitions. [2019-05-23 09:22:36,336 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:22:36,336 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 248 [2019-05-23 09:22:36,336 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:36,338 INFO L146 ILogger]: With dead ends: 260 [2019-05-23 09:22:36,338 INFO L146 ILogger]: Without dead ends: 260 [2019-05-23 09:22:36,339 INFO L146 ILogger]: 0 DeclaredPredicates, 247 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:22:36,340 INFO L146 ILogger]: Start minimizeSevpa. Operand 260 states. [2019-05-23 09:22:36,342 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 260 to 255. [2019-05-23 09:22:36,342 INFO L146 ILogger]: Start removeUnreachable. Operand 255 states. [2019-05-23 09:22:36,343 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-05-23 09:22:36,343 INFO L146 ILogger]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 248 [2019-05-23 09:22:36,343 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:36,343 INFO L146 ILogger]: Abstraction has 255 states and 255 transitions. [2019-05-23 09:22:36,344 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:22:36,344 INFO L146 ILogger]: Start isEmpty. Operand 255 states and 255 transitions. [2019-05-23 09:22:36,345 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 255 [2019-05-23 09:22:36,345 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:36,345 INFO L146 ILogger]: trace histogram [42, 42, 42, 42, 42, 42, 1, 1] [2019-05-23 09:22:36,345 INFO L146 ILogger]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:36,345 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:36,346 INFO L146 ILogger]: Analyzing trace with hash 460556807, now seen corresponding path program 42 times [2019-05-23 09:22:36,346 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:36,360 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:36,363 INFO L146 ILogger]: Trace formula consists of 341 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:22:36,367 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:39,542 INFO L146 ILogger]: Checked inductivity of 5208 backedges. 0 proven. 5208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:39,542 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:39,542 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:22:39,543 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:22:39,543 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:22:39,544 INFO L146 ILogger]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:39,544 INFO L146 ILogger]: Start difference. First operand 255 states and 255 transitions. Second operand 45 states. [2019-05-23 09:22:39,764 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:39,765 INFO L146 ILogger]: Finished difference Result 266 states and 266 transitions. [2019-05-23 09:22:39,765 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:22:39,765 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 254 [2019-05-23 09:22:39,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:39,767 INFO L146 ILogger]: With dead ends: 266 [2019-05-23 09:22:39,768 INFO L146 ILogger]: Without dead ends: 266 [2019-05-23 09:22:39,768 INFO L146 ILogger]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:22:39,769 INFO L146 ILogger]: Start minimizeSevpa. Operand 266 states. [2019-05-23 09:22:39,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 266 to 261. [2019-05-23 09:22:39,771 INFO L146 ILogger]: Start removeUnreachable. Operand 261 states. [2019-05-23 09:22:39,772 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-05-23 09:22:39,772 INFO L146 ILogger]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 254 [2019-05-23 09:22:39,772 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:39,772 INFO L146 ILogger]: Abstraction has 261 states and 261 transitions. [2019-05-23 09:22:39,773 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:22:39,773 INFO L146 ILogger]: Start isEmpty. Operand 261 states and 261 transitions. [2019-05-23 09:22:39,774 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 261 [2019-05-23 09:22:39,774 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:39,774 INFO L146 ILogger]: trace histogram [43, 43, 43, 43, 43, 43, 1, 1] [2019-05-23 09:22:39,774 INFO L146 ILogger]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:39,775 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:39,775 INFO L146 ILogger]: Analyzing trace with hash 1190748740, now seen corresponding path program 43 times [2019-05-23 09:22:39,775 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:39,788 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:39,790 INFO L146 ILogger]: Trace formula consists of 349 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:22:39,793 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:41,091 INFO L146 ILogger]: Checked inductivity of 5461 backedges. 0 proven. 5461 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:41,091 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:41,091 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:22:41,092 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:22:41,092 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:22:41,093 INFO L146 ILogger]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:22:41,093 INFO L146 ILogger]: Start difference. First operand 261 states and 261 transitions. Second operand 46 states. [2019-05-23 09:22:41,293 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:41,294 INFO L146 ILogger]: Finished difference Result 272 states and 272 transitions. [2019-05-23 09:22:41,294 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:22:41,294 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 260 [2019-05-23 09:22:41,295 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:41,296 INFO L146 ILogger]: With dead ends: 272 [2019-05-23 09:22:41,296 INFO L146 ILogger]: Without dead ends: 272 [2019-05-23 09:22:41,297 INFO L146 ILogger]: 0 DeclaredPredicates, 259 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:22:41,298 INFO L146 ILogger]: Start minimizeSevpa. Operand 272 states. [2019-05-23 09:22:41,300 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 272 to 267. [2019-05-23 09:22:41,300 INFO L146 ILogger]: Start removeUnreachable. Operand 267 states. [2019-05-23 09:22:41,301 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-05-23 09:22:41,301 INFO L146 ILogger]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 260 [2019-05-23 09:22:41,301 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:41,301 INFO L146 ILogger]: Abstraction has 267 states and 267 transitions. [2019-05-23 09:22:41,301 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:22:41,301 INFO L146 ILogger]: Start isEmpty. Operand 267 states and 267 transitions. [2019-05-23 09:22:41,302 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 267 [2019-05-23 09:22:41,302 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:41,302 INFO L146 ILogger]: trace histogram [44, 44, 44, 44, 44, 44, 1, 1] [2019-05-23 09:22:41,303 INFO L146 ILogger]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:41,303 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:41,303 INFO L146 ILogger]: Analyzing trace with hash -677816127, now seen corresponding path program 44 times [2019-05-23 09:22:41,303 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:41,318 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:41,320 INFO L146 ILogger]: Trace formula consists of 357 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:22:41,323 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:42,308 INFO L146 ILogger]: Checked inductivity of 5720 backedges. 0 proven. 5720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:42,308 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:42,308 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:22:42,308 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:22:42,309 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:22:42,309 INFO L146 ILogger]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:42,309 INFO L146 ILogger]: Start difference. First operand 267 states and 267 transitions. Second operand 47 states. [2019-05-23 09:22:42,506 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:42,506 INFO L146 ILogger]: Finished difference Result 278 states and 278 transitions. [2019-05-23 09:22:42,506 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:22:42,507 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 266 [2019-05-23 09:22:42,507 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:42,509 INFO L146 ILogger]: With dead ends: 278 [2019-05-23 09:22:42,509 INFO L146 ILogger]: Without dead ends: 278 [2019-05-23 09:22:42,509 INFO L146 ILogger]: 0 DeclaredPredicates, 265 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:22:42,510 INFO L146 ILogger]: Start minimizeSevpa. Operand 278 states. [2019-05-23 09:22:42,512 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 278 to 273. [2019-05-23 09:22:42,512 INFO L146 ILogger]: Start removeUnreachable. Operand 273 states. [2019-05-23 09:22:42,513 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-05-23 09:22:42,513 INFO L146 ILogger]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 266 [2019-05-23 09:22:42,513 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:42,513 INFO L146 ILogger]: Abstraction has 273 states and 273 transitions. [2019-05-23 09:22:42,514 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:22:42,514 INFO L146 ILogger]: Start isEmpty. Operand 273 states and 273 transitions. [2019-05-23 09:22:42,515 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 273 [2019-05-23 09:22:42,515 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:42,515 INFO L146 ILogger]: trace histogram [45, 45, 45, 45, 45, 45, 1, 1] [2019-05-23 09:22:42,515 INFO L146 ILogger]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:42,515 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:42,515 INFO L146 ILogger]: Analyzing trace with hash 1179893118, now seen corresponding path program 45 times [2019-05-23 09:22:42,516 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:42,530 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:42,532 INFO L146 ILogger]: Trace formula consists of 365 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 09:22:42,534 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:43,565 INFO L146 ILogger]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:43,565 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:43,565 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:22:43,566 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:22:43,566 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:22:43,567 INFO L146 ILogger]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:22:43,567 INFO L146 ILogger]: Start difference. First operand 273 states and 273 transitions. Second operand 48 states. [2019-05-23 09:22:43,779 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:43,779 INFO L146 ILogger]: Finished difference Result 284 states and 284 transitions. [2019-05-23 09:22:43,779 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:22:43,780 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 272 [2019-05-23 09:22:43,780 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:43,781 INFO L146 ILogger]: With dead ends: 284 [2019-05-23 09:22:43,782 INFO L146 ILogger]: Without dead ends: 284 [2019-05-23 09:22:43,782 INFO L146 ILogger]: 0 DeclaredPredicates, 271 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:22:43,783 INFO L146 ILogger]: Start minimizeSevpa. Operand 284 states. [2019-05-23 09:22:43,785 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 284 to 279. [2019-05-23 09:22:43,785 INFO L146 ILogger]: Start removeUnreachable. Operand 279 states. [2019-05-23 09:22:43,786 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-05-23 09:22:43,786 INFO L146 ILogger]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 272 [2019-05-23 09:22:43,786 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:43,786 INFO L146 ILogger]: Abstraction has 279 states and 279 transitions. [2019-05-23 09:22:43,787 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:22:43,787 INFO L146 ILogger]: Start isEmpty. Operand 279 states and 279 transitions. [2019-05-23 09:22:43,788 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 279 [2019-05-23 09:22:43,788 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:43,788 INFO L146 ILogger]: trace histogram [46, 46, 46, 46, 46, 46, 1, 1] [2019-05-23 09:22:43,788 INFO L146 ILogger]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:43,789 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:43,789 INFO L146 ILogger]: Analyzing trace with hash 1051517051, now seen corresponding path program 46 times [2019-05-23 09:22:43,789 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:43,803 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:43,805 INFO L146 ILogger]: Trace formula consists of 373 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:22:43,808 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:44,879 INFO L146 ILogger]: Checked inductivity of 6256 backedges. 0 proven. 6256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:44,880 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:44,880 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:22:44,880 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:22:44,881 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:22:44,881 INFO L146 ILogger]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:44,881 INFO L146 ILogger]: Start difference. First operand 279 states and 279 transitions. Second operand 49 states. [2019-05-23 09:22:45,187 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:45,187 INFO L146 ILogger]: Finished difference Result 290 states and 290 transitions. [2019-05-23 09:22:45,187 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:22:45,188 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 278 [2019-05-23 09:22:45,188 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:45,189 INFO L146 ILogger]: With dead ends: 290 [2019-05-23 09:22:45,190 INFO L146 ILogger]: Without dead ends: 290 [2019-05-23 09:22:45,190 INFO L146 ILogger]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:22:45,190 INFO L146 ILogger]: Start minimizeSevpa. Operand 290 states. [2019-05-23 09:22:45,192 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 290 to 285. [2019-05-23 09:22:45,192 INFO L146 ILogger]: Start removeUnreachable. Operand 285 states. [2019-05-23 09:22:45,193 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-05-23 09:22:45,193 INFO L146 ILogger]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 278 [2019-05-23 09:22:45,193 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:45,194 INFO L146 ILogger]: Abstraction has 285 states and 285 transitions. [2019-05-23 09:22:45,194 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:22:45,194 INFO L146 ILogger]: Start isEmpty. Operand 285 states and 285 transitions. [2019-05-23 09:22:45,195 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 285 [2019-05-23 09:22:45,195 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:45,195 INFO L146 ILogger]: trace histogram [47, 47, 47, 47, 47, 47, 1, 1] [2019-05-23 09:22:45,196 INFO L146 ILogger]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:45,196 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:45,196 INFO L146 ILogger]: Analyzing trace with hash -1414721096, now seen corresponding path program 47 times [2019-05-23 09:22:45,197 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:45,210 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:45,212 INFO L146 ILogger]: Trace formula consists of 381 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 09:22:45,214 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:46,119 INFO L146 ILogger]: Checked inductivity of 6533 backedges. 0 proven. 6533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:46,120 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:46,120 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:22:46,120 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:22:46,121 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:22:46,121 INFO L146 ILogger]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:22:46,121 INFO L146 ILogger]: Start difference. First operand 285 states and 285 transitions. Second operand 50 states. [2019-05-23 09:22:46,421 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:46,421 INFO L146 ILogger]: Finished difference Result 296 states and 296 transitions. [2019-05-23 09:22:46,421 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:22:46,422 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 284 [2019-05-23 09:22:46,422 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:46,423 INFO L146 ILogger]: With dead ends: 296 [2019-05-23 09:22:46,424 INFO L146 ILogger]: Without dead ends: 296 [2019-05-23 09:22:46,424 INFO L146 ILogger]: 0 DeclaredPredicates, 283 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:22:46,425 INFO L146 ILogger]: Start minimizeSevpa. Operand 296 states. [2019-05-23 09:22:46,427 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 296 to 291. [2019-05-23 09:22:46,428 INFO L146 ILogger]: Start removeUnreachable. Operand 291 states. [2019-05-23 09:22:46,428 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-05-23 09:22:46,428 INFO L146 ILogger]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 284 [2019-05-23 09:22:46,428 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:46,428 INFO L146 ILogger]: Abstraction has 291 states and 291 transitions. [2019-05-23 09:22:46,429 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:22:46,429 INFO L146 ILogger]: Start isEmpty. Operand 291 states and 291 transitions. [2019-05-23 09:22:46,429 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 291 [2019-05-23 09:22:46,430 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:46,430 INFO L146 ILogger]: trace histogram [48, 48, 48, 48, 48, 48, 1, 1] [2019-05-23 09:22:46,430 INFO L146 ILogger]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:46,430 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:46,430 INFO L146 ILogger]: Analyzing trace with hash 81830197, now seen corresponding path program 48 times [2019-05-23 09:22:46,431 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:46,447 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:46,449 INFO L146 ILogger]: Trace formula consists of 389 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:22:46,452 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:47,582 INFO L146 ILogger]: Checked inductivity of 6816 backedges. 0 proven. 6816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:47,583 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:47,583 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:22:47,583 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:22:47,584 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:22:47,584 INFO L146 ILogger]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:47,584 INFO L146 ILogger]: Start difference. First operand 291 states and 291 transitions. Second operand 51 states. [2019-05-23 09:22:47,800 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:47,800 INFO L146 ILogger]: Finished difference Result 302 states and 302 transitions. [2019-05-23 09:22:47,801 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:22:47,801 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 290 [2019-05-23 09:22:47,802 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:47,803 INFO L146 ILogger]: With dead ends: 302 [2019-05-23 09:22:47,804 INFO L146 ILogger]: Without dead ends: 302 [2019-05-23 09:22:47,804 INFO L146 ILogger]: 0 DeclaredPredicates, 289 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:22:47,804 INFO L146 ILogger]: Start minimizeSevpa. Operand 302 states. [2019-05-23 09:22:47,807 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 302 to 297. [2019-05-23 09:22:47,807 INFO L146 ILogger]: Start removeUnreachable. Operand 297 states. [2019-05-23 09:22:47,807 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-05-23 09:22:47,807 INFO L146 ILogger]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 290 [2019-05-23 09:22:47,808 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:47,808 INFO L146 ILogger]: Abstraction has 297 states and 297 transitions. [2019-05-23 09:22:47,808 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:22:47,808 INFO L146 ILogger]: Start isEmpty. Operand 297 states and 297 transitions. [2019-05-23 09:22:47,809 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 297 [2019-05-23 09:22:47,809 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:47,809 INFO L146 ILogger]: trace histogram [49, 49, 49, 49, 49, 49, 1, 1] [2019-05-23 09:22:47,809 INFO L146 ILogger]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:47,810 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:47,810 INFO L146 ILogger]: Analyzing trace with hash -614998286, now seen corresponding path program 49 times [2019-05-23 09:22:47,810 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:47,825 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:47,827 INFO L146 ILogger]: Trace formula consists of 397 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:22:47,830 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:48,833 INFO L146 ILogger]: Checked inductivity of 7105 backedges. 0 proven. 7105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:48,833 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:48,833 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:22:48,834 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:22:48,834 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:22:48,834 INFO L146 ILogger]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:22:48,834 INFO L146 ILogger]: Start difference. First operand 297 states and 297 transitions. Second operand 52 states. [2019-05-23 09:22:49,055 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:49,055 INFO L146 ILogger]: Finished difference Result 308 states and 308 transitions. [2019-05-23 09:22:49,055 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:22:49,056 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 296 [2019-05-23 09:22:49,056 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:49,057 INFO L146 ILogger]: With dead ends: 308 [2019-05-23 09:22:49,058 INFO L146 ILogger]: Without dead ends: 308 [2019-05-23 09:22:49,058 INFO L146 ILogger]: 0 DeclaredPredicates, 295 GetRequests, 245 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:22:49,059 INFO L146 ILogger]: Start minimizeSevpa. Operand 308 states. [2019-05-23 09:22:49,061 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 308 to 303. [2019-05-23 09:22:49,061 INFO L146 ILogger]: Start removeUnreachable. Operand 303 states. [2019-05-23 09:22:49,062 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-05-23 09:22:49,062 INFO L146 ILogger]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 296 [2019-05-23 09:22:49,062 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:49,063 INFO L146 ILogger]: Abstraction has 303 states and 303 transitions. [2019-05-23 09:22:49,063 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:22:49,063 INFO L146 ILogger]: Start isEmpty. Operand 303 states and 303 transitions. [2019-05-23 09:22:49,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 303 [2019-05-23 09:22:49,064 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:49,064 INFO L146 ILogger]: trace histogram [50, 50, 50, 50, 50, 50, 1, 1] [2019-05-23 09:22:49,065 INFO L146 ILogger]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:49,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:49,065 INFO L146 ILogger]: Analyzing trace with hash -1498998033, now seen corresponding path program 50 times [2019-05-23 09:22:49,066 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:49,080 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:49,082 INFO L146 ILogger]: Trace formula consists of 405 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:22:49,085 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:50,286 INFO L146 ILogger]: Checked inductivity of 7400 backedges. 0 proven. 7400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:50,286 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:50,287 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:22:50,287 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:22:50,287 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:22:50,288 INFO L146 ILogger]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:50,288 INFO L146 ILogger]: Start difference. First operand 303 states and 303 transitions. Second operand 53 states. [2019-05-23 09:22:50,523 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:50,523 INFO L146 ILogger]: Finished difference Result 314 states and 314 transitions. [2019-05-23 09:22:50,524 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:22:50,524 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 302 [2019-05-23 09:22:50,525 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:50,526 INFO L146 ILogger]: With dead ends: 314 [2019-05-23 09:22:50,526 INFO L146 ILogger]: Without dead ends: 314 [2019-05-23 09:22:50,526 INFO L146 ILogger]: 0 DeclaredPredicates, 301 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:22:50,527 INFO L146 ILogger]: Start minimizeSevpa. Operand 314 states. [2019-05-23 09:22:50,528 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 314 to 309. [2019-05-23 09:22:50,528 INFO L146 ILogger]: Start removeUnreachable. Operand 309 states. [2019-05-23 09:22:50,529 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-05-23 09:22:50,529 INFO L146 ILogger]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 302 [2019-05-23 09:22:50,529 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:50,530 INFO L146 ILogger]: Abstraction has 309 states and 309 transitions. [2019-05-23 09:22:50,530 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:22:50,530 INFO L146 ILogger]: Start isEmpty. Operand 309 states and 309 transitions. [2019-05-23 09:22:50,531 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 309 [2019-05-23 09:22:50,531 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:50,531 INFO L146 ILogger]: trace histogram [51, 51, 51, 51, 51, 51, 1, 1] [2019-05-23 09:22:50,532 INFO L146 ILogger]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:50,532 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:50,532 INFO L146 ILogger]: Analyzing trace with hash -773413588, now seen corresponding path program 51 times [2019-05-23 09:22:50,533 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:50,547 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:50,550 INFO L146 ILogger]: Trace formula consists of 413 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 09:22:50,553 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:51,857 INFO L146 ILogger]: Checked inductivity of 7701 backedges. 0 proven. 7701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:51,857 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:51,858 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:22:51,858 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:22:51,858 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:22:51,858 INFO L146 ILogger]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:22:51,859 INFO L146 ILogger]: Start difference. First operand 309 states and 309 transitions. Second operand 54 states. [2019-05-23 09:22:52,084 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:52,084 INFO L146 ILogger]: Finished difference Result 320 states and 320 transitions. [2019-05-23 09:22:52,085 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:22:52,085 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 308 [2019-05-23 09:22:52,086 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:52,087 INFO L146 ILogger]: With dead ends: 320 [2019-05-23 09:22:52,087 INFO L146 ILogger]: Without dead ends: 320 [2019-05-23 09:22:52,088 INFO L146 ILogger]: 0 DeclaredPredicates, 307 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:22:52,088 INFO L146 ILogger]: Start minimizeSevpa. Operand 320 states. [2019-05-23 09:22:52,091 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 320 to 315. [2019-05-23 09:22:52,091 INFO L146 ILogger]: Start removeUnreachable. Operand 315 states. [2019-05-23 09:22:52,092 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-05-23 09:22:52,092 INFO L146 ILogger]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 308 [2019-05-23 09:22:52,092 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:52,092 INFO L146 ILogger]: Abstraction has 315 states and 315 transitions. [2019-05-23 09:22:52,092 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:22:52,093 INFO L146 ILogger]: Start isEmpty. Operand 315 states and 315 transitions. [2019-05-23 09:22:52,094 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 315 [2019-05-23 09:22:52,094 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:52,094 INFO L146 ILogger]: trace histogram [52, 52, 52, 52, 52, 52, 1, 1] [2019-05-23 09:22:52,094 INFO L146 ILogger]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:52,094 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:52,094 INFO L146 ILogger]: Analyzing trace with hash 145935785, now seen corresponding path program 52 times [2019-05-23 09:22:52,095 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:52,108 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:52,110 INFO L146 ILogger]: Trace formula consists of 421 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:22:52,113 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:53,244 INFO L146 ILogger]: Checked inductivity of 8008 backedges. 0 proven. 8008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:53,244 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:53,244 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:22:53,244 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:22:53,245 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:22:53,245 INFO L146 ILogger]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:22:53,245 INFO L146 ILogger]: Start difference. First operand 315 states and 315 transitions. Second operand 55 states. [2019-05-23 09:22:53,477 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:53,477 INFO L146 ILogger]: Finished difference Result 326 states and 326 transitions. [2019-05-23 09:22:53,477 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:22:53,477 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 314 [2019-05-23 09:22:53,478 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:53,479 INFO L146 ILogger]: With dead ends: 326 [2019-05-23 09:22:53,479 INFO L146 ILogger]: Without dead ends: 326 [2019-05-23 09:22:53,480 INFO L146 ILogger]: 0 DeclaredPredicates, 313 GetRequests, 260 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:22:53,480 INFO L146 ILogger]: Start minimizeSevpa. Operand 326 states. [2019-05-23 09:22:53,483 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 326 to 321. [2019-05-23 09:22:53,483 INFO L146 ILogger]: Start removeUnreachable. Operand 321 states. [2019-05-23 09:22:53,483 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-05-23 09:22:53,484 INFO L146 ILogger]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 314 [2019-05-23 09:22:53,484 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:53,484 INFO L146 ILogger]: Abstraction has 321 states and 321 transitions. [2019-05-23 09:22:53,484 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:22:53,484 INFO L146 ILogger]: Start isEmpty. Operand 321 states and 321 transitions. [2019-05-23 09:22:53,486 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 321 [2019-05-23 09:22:53,486 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:53,486 INFO L146 ILogger]: trace histogram [53, 53, 53, 53, 53, 53, 1, 1] [2019-05-23 09:22:53,486 INFO L146 ILogger]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:53,486 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:53,487 INFO L146 ILogger]: Analyzing trace with hash -1003756442, now seen corresponding path program 53 times [2019-05-23 09:22:53,487 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:53,502 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:53,504 INFO L146 ILogger]: Trace formula consists of 429 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 09:22:53,508 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:54,892 INFO L146 ILogger]: Checked inductivity of 8321 backedges. 0 proven. 8321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:54,893 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:54,893 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:22:54,893 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:22:54,893 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:22:54,894 INFO L146 ILogger]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:22:54,894 INFO L146 ILogger]: Start difference. First operand 321 states and 321 transitions. Second operand 56 states. [2019-05-23 09:22:55,148 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:55,148 INFO L146 ILogger]: Finished difference Result 332 states and 332 transitions. [2019-05-23 09:22:55,149 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:22:55,149 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 320 [2019-05-23 09:22:55,149 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:55,151 INFO L146 ILogger]: With dead ends: 332 [2019-05-23 09:22:55,151 INFO L146 ILogger]: Without dead ends: 332 [2019-05-23 09:22:55,151 INFO L146 ILogger]: 0 DeclaredPredicates, 319 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:22:55,152 INFO L146 ILogger]: Start minimizeSevpa. Operand 332 states. [2019-05-23 09:22:55,154 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 332 to 327. [2019-05-23 09:22:55,154 INFO L146 ILogger]: Start removeUnreachable. Operand 327 states. [2019-05-23 09:22:55,155 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-05-23 09:22:55,155 INFO L146 ILogger]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 320 [2019-05-23 09:22:55,155 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:55,155 INFO L146 ILogger]: Abstraction has 327 states and 327 transitions. [2019-05-23 09:22:55,156 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:22:55,156 INFO L146 ILogger]: Start isEmpty. Operand 327 states and 327 transitions. [2019-05-23 09:22:55,157 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 327 [2019-05-23 09:22:55,157 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:55,157 INFO L146 ILogger]: trace histogram [54, 54, 54, 54, 54, 54, 1, 1] [2019-05-23 09:22:55,158 INFO L146 ILogger]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:55,158 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:55,158 INFO L146 ILogger]: Analyzing trace with hash 402012515, now seen corresponding path program 54 times [2019-05-23 09:22:55,159 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:55,175 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:55,177 INFO L146 ILogger]: Trace formula consists of 437 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:22:55,181 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:56,378 INFO L146 ILogger]: Checked inductivity of 8640 backedges. 0 proven. 8640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:56,378 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:56,379 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:22:56,379 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:22:56,379 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:22:56,380 INFO L146 ILogger]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:56,380 INFO L146 ILogger]: Start difference. First operand 327 states and 327 transitions. Second operand 57 states. [2019-05-23 09:22:56,624 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:56,624 INFO L146 ILogger]: Finished difference Result 338 states and 338 transitions. [2019-05-23 09:22:56,624 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:22:56,624 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 326 [2019-05-23 09:22:56,625 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:56,627 INFO L146 ILogger]: With dead ends: 338 [2019-05-23 09:22:56,627 INFO L146 ILogger]: Without dead ends: 338 [2019-05-23 09:22:56,627 INFO L146 ILogger]: 0 DeclaredPredicates, 325 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:22:56,628 INFO L146 ILogger]: Start minimizeSevpa. Operand 338 states. [2019-05-23 09:22:56,629 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-05-23 09:22:56,630 INFO L146 ILogger]: Start removeUnreachable. Operand 333 states. [2019-05-23 09:22:56,630 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-05-23 09:22:56,630 INFO L146 ILogger]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 326 [2019-05-23 09:22:56,630 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:56,630 INFO L146 ILogger]: Abstraction has 333 states and 333 transitions. [2019-05-23 09:22:56,630 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:22:56,630 INFO L146 ILogger]: Start isEmpty. Operand 333 states and 333 transitions. [2019-05-23 09:22:56,632 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 333 [2019-05-23 09:22:56,632 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:56,632 INFO L146 ILogger]: trace histogram [55, 55, 55, 55, 55, 55, 1, 1] [2019-05-23 09:22:56,632 INFO L146 ILogger]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:56,633 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:56,633 INFO L146 ILogger]: Analyzing trace with hash -1086710624, now seen corresponding path program 55 times [2019-05-23 09:22:56,633 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:56,650 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:56,652 INFO L146 ILogger]: Trace formula consists of 445 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:22:56,655 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:57,970 INFO L146 ILogger]: Checked inductivity of 8965 backedges. 0 proven. 8965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:57,971 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:57,971 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:22:57,971 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:22:57,971 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:22:57,972 INFO L146 ILogger]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:22:57,972 INFO L146 ILogger]: Start difference. First operand 333 states and 333 transitions. Second operand 58 states. [2019-05-23 09:22:58,224 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:22:58,224 INFO L146 ILogger]: Finished difference Result 344 states and 344 transitions. [2019-05-23 09:22:58,224 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:22:58,224 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 332 [2019-05-23 09:22:58,225 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:22:58,226 INFO L146 ILogger]: With dead ends: 344 [2019-05-23 09:22:58,226 INFO L146 ILogger]: Without dead ends: 344 [2019-05-23 09:22:58,227 INFO L146 ILogger]: 0 DeclaredPredicates, 331 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:22:58,227 INFO L146 ILogger]: Start minimizeSevpa. Operand 344 states. [2019-05-23 09:22:58,230 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 344 to 339. [2019-05-23 09:22:58,230 INFO L146 ILogger]: Start removeUnreachable. Operand 339 states. [2019-05-23 09:22:58,230 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-05-23 09:22:58,231 INFO L146 ILogger]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 332 [2019-05-23 09:22:58,231 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:22:58,231 INFO L146 ILogger]: Abstraction has 339 states and 339 transitions. [2019-05-23 09:22:58,231 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:22:58,231 INFO L146 ILogger]: Start isEmpty. Operand 339 states and 339 transitions. [2019-05-23 09:22:58,233 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 339 [2019-05-23 09:22:58,233 INFO L146 ILogger]: Found error trace [2019-05-23 09:22:58,233 INFO L146 ILogger]: trace histogram [56, 56, 56, 56, 56, 56, 1, 1] [2019-05-23 09:22:58,233 INFO L146 ILogger]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:22:58,233 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:22:58,233 INFO L146 ILogger]: Analyzing trace with hash 1772346909, now seen corresponding path program 56 times [2019-05-23 09:22:58,234 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:22:58,251 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:22:58,254 INFO L146 ILogger]: Trace formula consists of 453 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:22:58,257 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:22:59,697 INFO L146 ILogger]: Checked inductivity of 9296 backedges. 0 proven. 9296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:22:59,697 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:22:59,697 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:22:59,697 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:22:59,698 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:22:59,698 INFO L146 ILogger]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:22:59,698 INFO L146 ILogger]: Start difference. First operand 339 states and 339 transitions. Second operand 59 states. [2019-05-23 09:23:00,838 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:00,838 INFO L146 ILogger]: Finished difference Result 350 states and 350 transitions. [2019-05-23 09:23:00,839 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:23:00,839 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 338 [2019-05-23 09:23:00,839 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:00,841 INFO L146 ILogger]: With dead ends: 350 [2019-05-23 09:23:00,841 INFO L146 ILogger]: Without dead ends: 350 [2019-05-23 09:23:00,842 INFO L146 ILogger]: 0 DeclaredPredicates, 337 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:23:00,842 INFO L146 ILogger]: Start minimizeSevpa. Operand 350 states. [2019-05-23 09:23:00,845 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 350 to 345. [2019-05-23 09:23:00,845 INFO L146 ILogger]: Start removeUnreachable. Operand 345 states. [2019-05-23 09:23:00,845 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-05-23 09:23:00,845 INFO L146 ILogger]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 338 [2019-05-23 09:23:00,845 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:00,846 INFO L146 ILogger]: Abstraction has 345 states and 345 transitions. [2019-05-23 09:23:00,846 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:23:00,846 INFO L146 ILogger]: Start isEmpty. Operand 345 states and 345 transitions. [2019-05-23 09:23:00,847 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 345 [2019-05-23 09:23:00,847 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:00,847 INFO L146 ILogger]: trace histogram [57, 57, 57, 57, 57, 57, 1, 1] [2019-05-23 09:23:00,848 INFO L146 ILogger]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:00,848 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:00,848 INFO L146 ILogger]: Analyzing trace with hash 1214500314, now seen corresponding path program 57 times [2019-05-23 09:23:00,849 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:00,866 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:00,868 INFO L146 ILogger]: Trace formula consists of 461 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 09:23:00,871 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:02,695 INFO L146 ILogger]: Checked inductivity of 9633 backedges. 0 proven. 9633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:02,695 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:02,695 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:23:02,695 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:23:02,696 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:23:02,696 INFO L146 ILogger]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:23:02,696 INFO L146 ILogger]: Start difference. First operand 345 states and 345 transitions. Second operand 60 states. [2019-05-23 09:23:02,976 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:02,976 INFO L146 ILogger]: Finished difference Result 356 states and 356 transitions. [2019-05-23 09:23:02,977 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:23:02,977 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 344 [2019-05-23 09:23:02,978 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:02,979 INFO L146 ILogger]: With dead ends: 356 [2019-05-23 09:23:02,979 INFO L146 ILogger]: Without dead ends: 356 [2019-05-23 09:23:02,980 INFO L146 ILogger]: 0 DeclaredPredicates, 343 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:23:02,981 INFO L146 ILogger]: Start minimizeSevpa. Operand 356 states. [2019-05-23 09:23:02,983 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 356 to 351. [2019-05-23 09:23:02,983 INFO L146 ILogger]: Start removeUnreachable. Operand 351 states. [2019-05-23 09:23:02,984 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-05-23 09:23:02,984 INFO L146 ILogger]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 344 [2019-05-23 09:23:02,984 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:02,984 INFO L146 ILogger]: Abstraction has 351 states and 351 transitions. [2019-05-23 09:23:02,984 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:23:02,984 INFO L146 ILogger]: Start isEmpty. Operand 351 states and 351 transitions. [2019-05-23 09:23:02,985 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 351 [2019-05-23 09:23:02,985 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:02,986 INFO L146 ILogger]: trace histogram [58, 58, 58, 58, 58, 58, 1, 1] [2019-05-23 09:23:02,986 INFO L146 ILogger]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:02,986 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:02,986 INFO L146 ILogger]: Analyzing trace with hash -617727017, now seen corresponding path program 58 times [2019-05-23 09:23:02,987 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:03,001 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:03,003 INFO L146 ILogger]: Trace formula consists of 469 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:23:03,006 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:04,386 INFO L146 ILogger]: Checked inductivity of 9976 backedges. 0 proven. 9976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:04,387 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:04,387 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:23:04,387 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:23:04,388 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:23:04,388 INFO L146 ILogger]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:23:04,388 INFO L146 ILogger]: Start difference. First operand 351 states and 351 transitions. Second operand 61 states. [2019-05-23 09:23:04,651 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:04,651 INFO L146 ILogger]: Finished difference Result 362 states and 362 transitions. [2019-05-23 09:23:04,652 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:23:04,652 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 350 [2019-05-23 09:23:04,652 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:04,654 INFO L146 ILogger]: With dead ends: 362 [2019-05-23 09:23:04,654 INFO L146 ILogger]: Without dead ends: 362 [2019-05-23 09:23:04,655 INFO L146 ILogger]: 0 DeclaredPredicates, 349 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:23:04,655 INFO L146 ILogger]: Start minimizeSevpa. Operand 362 states. [2019-05-23 09:23:04,657 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 362 to 357. [2019-05-23 09:23:04,657 INFO L146 ILogger]: Start removeUnreachable. Operand 357 states. [2019-05-23 09:23:04,657 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-05-23 09:23:04,658 INFO L146 ILogger]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 350 [2019-05-23 09:23:04,658 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:04,658 INFO L146 ILogger]: Abstraction has 357 states and 357 transitions. [2019-05-23 09:23:04,658 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:23:04,658 INFO L146 ILogger]: Start isEmpty. Operand 357 states and 357 transitions. [2019-05-23 09:23:04,659 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 357 [2019-05-23 09:23:04,659 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:04,660 INFO L146 ILogger]: trace histogram [59, 59, 59, 59, 59, 59, 1, 1] [2019-05-23 09:23:04,660 INFO L146 ILogger]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:04,660 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:04,660 INFO L146 ILogger]: Analyzing trace with hash -46434284, now seen corresponding path program 59 times [2019-05-23 09:23:04,661 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:04,677 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:04,680 INFO L146 ILogger]: Trace formula consists of 477 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 09:23:04,683 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:06,077 INFO L146 ILogger]: Checked inductivity of 10325 backedges. 0 proven. 10325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:06,077 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:06,077 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:23:06,078 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:23:06,078 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:23:06,078 INFO L146 ILogger]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:23:06,078 INFO L146 ILogger]: Start difference. First operand 357 states and 357 transitions. Second operand 62 states. [2019-05-23 09:23:06,347 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:06,347 INFO L146 ILogger]: Finished difference Result 368 states and 368 transitions. [2019-05-23 09:23:06,348 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:23:06,348 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 356 [2019-05-23 09:23:06,348 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:06,350 INFO L146 ILogger]: With dead ends: 368 [2019-05-23 09:23:06,350 INFO L146 ILogger]: Without dead ends: 368 [2019-05-23 09:23:06,350 INFO L146 ILogger]: 0 DeclaredPredicates, 355 GetRequests, 295 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:23:06,351 INFO L146 ILogger]: Start minimizeSevpa. Operand 368 states. [2019-05-23 09:23:06,353 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 368 to 363. [2019-05-23 09:23:06,353 INFO L146 ILogger]: Start removeUnreachable. Operand 363 states. [2019-05-23 09:23:06,354 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2019-05-23 09:23:06,354 INFO L146 ILogger]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 356 [2019-05-23 09:23:06,354 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:06,354 INFO L146 ILogger]: Abstraction has 363 states and 363 transitions. [2019-05-23 09:23:06,354 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:23:06,354 INFO L146 ILogger]: Start isEmpty. Operand 363 states and 363 transitions. [2019-05-23 09:23:06,355 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 363 [2019-05-23 09:23:06,355 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:06,355 INFO L146 ILogger]: trace histogram [60, 60, 60, 60, 60, 60, 1, 1] [2019-05-23 09:23:06,356 INFO L146 ILogger]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:06,356 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:06,356 INFO L146 ILogger]: Analyzing trace with hash 843567761, now seen corresponding path program 60 times [2019-05-23 09:23:06,356 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:06,373 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:06,376 INFO L146 ILogger]: Trace formula consists of 485 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:23:06,379 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:08,483 INFO L146 ILogger]: Checked inductivity of 10680 backedges. 0 proven. 10680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:08,483 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:08,483 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:23:08,484 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:23:08,484 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:23:08,484 INFO L146 ILogger]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:23:08,484 INFO L146 ILogger]: Start difference. First operand 363 states and 363 transitions. Second operand 63 states. [2019-05-23 09:23:08,760 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:08,760 INFO L146 ILogger]: Finished difference Result 374 states and 374 transitions. [2019-05-23 09:23:08,760 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:23:08,761 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 362 [2019-05-23 09:23:08,761 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:08,763 INFO L146 ILogger]: With dead ends: 374 [2019-05-23 09:23:08,763 INFO L146 ILogger]: Without dead ends: 374 [2019-05-23 09:23:08,763 INFO L146 ILogger]: 0 DeclaredPredicates, 361 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:23:08,764 INFO L146 ILogger]: Start minimizeSevpa. Operand 374 states. [2019-05-23 09:23:08,767 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 374 to 369. [2019-05-23 09:23:08,767 INFO L146 ILogger]: Start removeUnreachable. Operand 369 states. [2019-05-23 09:23:08,768 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-05-23 09:23:08,768 INFO L146 ILogger]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 362 [2019-05-23 09:23:08,768 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:08,768 INFO L146 ILogger]: Abstraction has 369 states and 369 transitions. [2019-05-23 09:23:08,768 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:23:08,769 INFO L146 ILogger]: Start isEmpty. Operand 369 states and 369 transitions. [2019-05-23 09:23:08,770 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 369 [2019-05-23 09:23:08,770 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:08,770 INFO L146 ILogger]: trace histogram [61, 61, 61, 61, 61, 61, 1, 1] [2019-05-23 09:23:08,771 INFO L146 ILogger]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:08,771 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:08,771 INFO L146 ILogger]: Analyzing trace with hash 865311566, now seen corresponding path program 61 times [2019-05-23 09:23:08,772 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:08,787 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:08,790 INFO L146 ILogger]: Trace formula consists of 493 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:23:08,793 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:10,334 INFO L146 ILogger]: Checked inductivity of 11041 backedges. 0 proven. 11041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:10,334 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:10,335 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:23:10,335 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:23:10,335 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:23:10,336 INFO L146 ILogger]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:23:10,336 INFO L146 ILogger]: Start difference. First operand 369 states and 369 transitions. Second operand 64 states. [2019-05-23 09:23:10,658 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:10,658 INFO L146 ILogger]: Finished difference Result 380 states and 380 transitions. [2019-05-23 09:23:10,659 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:23:10,659 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 368 [2019-05-23 09:23:10,659 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:10,661 INFO L146 ILogger]: With dead ends: 380 [2019-05-23 09:23:10,661 INFO L146 ILogger]: Without dead ends: 380 [2019-05-23 09:23:10,662 INFO L146 ILogger]: 0 DeclaredPredicates, 367 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:23:10,662 INFO L146 ILogger]: Start minimizeSevpa. Operand 380 states. [2019-05-23 09:23:10,664 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 380 to 375. [2019-05-23 09:23:10,664 INFO L146 ILogger]: Start removeUnreachable. Operand 375 states. [2019-05-23 09:23:10,665 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2019-05-23 09:23:10,665 INFO L146 ILogger]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 368 [2019-05-23 09:23:10,665 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:10,665 INFO L146 ILogger]: Abstraction has 375 states and 375 transitions. [2019-05-23 09:23:10,665 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:23:10,665 INFO L146 ILogger]: Start isEmpty. Operand 375 states and 375 transitions. [2019-05-23 09:23:10,666 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 375 [2019-05-23 09:23:10,666 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:10,667 INFO L146 ILogger]: trace histogram [62, 62, 62, 62, 62, 62, 1, 1] [2019-05-23 09:23:10,667 INFO L146 ILogger]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:10,667 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:10,667 INFO L146 ILogger]: Analyzing trace with hash -1125965237, now seen corresponding path program 62 times [2019-05-23 09:23:10,668 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:10,683 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:10,686 INFO L146 ILogger]: Trace formula consists of 501 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:23:10,688 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:12,392 INFO L146 ILogger]: Checked inductivity of 11408 backedges. 0 proven. 11408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:12,392 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:12,393 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:23:12,393 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:23:12,393 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:23:12,394 INFO L146 ILogger]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:23:12,394 INFO L146 ILogger]: Start difference. First operand 375 states and 375 transitions. Second operand 65 states. [2019-05-23 09:23:12,676 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:12,676 INFO L146 ILogger]: Finished difference Result 386 states and 386 transitions. [2019-05-23 09:23:12,676 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:23:12,677 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 374 [2019-05-23 09:23:12,677 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:12,679 INFO L146 ILogger]: With dead ends: 386 [2019-05-23 09:23:12,679 INFO L146 ILogger]: Without dead ends: 386 [2019-05-23 09:23:12,680 INFO L146 ILogger]: 0 DeclaredPredicates, 373 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:23:12,680 INFO L146 ILogger]: Start minimizeSevpa. Operand 386 states. [2019-05-23 09:23:12,683 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 386 to 381. [2019-05-23 09:23:12,683 INFO L146 ILogger]: Start removeUnreachable. Operand 381 states. [2019-05-23 09:23:12,683 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-05-23 09:23:12,683 INFO L146 ILogger]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 374 [2019-05-23 09:23:12,683 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:12,683 INFO L146 ILogger]: Abstraction has 381 states and 381 transitions. [2019-05-23 09:23:12,684 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:23:12,684 INFO L146 ILogger]: Start isEmpty. Operand 381 states and 381 transitions. [2019-05-23 09:23:12,685 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 381 [2019-05-23 09:23:12,685 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:12,685 INFO L146 ILogger]: trace histogram [63, 63, 63, 63, 63, 63, 1, 1] [2019-05-23 09:23:12,685 INFO L146 ILogger]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:12,685 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:12,686 INFO L146 ILogger]: Analyzing trace with hash -1719748728, now seen corresponding path program 63 times [2019-05-23 09:23:12,686 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:12,700 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:12,703 INFO L146 ILogger]: Trace formula consists of 509 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 09:23:12,706 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:14,257 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:23:14,257 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:14,258 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:23:14,258 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:23:14,258 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:23:14,260 INFO L146 ILogger]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:23:14,260 INFO L146 ILogger]: Start difference. First operand 381 states and 381 transitions. Second operand 66 states. [2019-05-23 09:23:14,573 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:14,573 INFO L146 ILogger]: Finished difference Result 392 states and 392 transitions. [2019-05-23 09:23:14,574 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:23:14,574 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 380 [2019-05-23 09:23:14,575 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:14,576 INFO L146 ILogger]: With dead ends: 392 [2019-05-23 09:23:14,576 INFO L146 ILogger]: Without dead ends: 392 [2019-05-23 09:23:14,577 INFO L146 ILogger]: 0 DeclaredPredicates, 379 GetRequests, 315 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:23:14,577 INFO L146 ILogger]: Start minimizeSevpa. Operand 392 states. [2019-05-23 09:23:14,581 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 392 to 387. [2019-05-23 09:23:14,581 INFO L146 ILogger]: Start removeUnreachable. Operand 387 states. [2019-05-23 09:23:14,581 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-05-23 09:23:14,581 INFO L146 ILogger]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 380 [2019-05-23 09:23:14,582 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:14,582 INFO L146 ILogger]: Abstraction has 387 states and 387 transitions. [2019-05-23 09:23:14,582 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:23:14,582 INFO L146 ILogger]: Start isEmpty. Operand 387 states and 387 transitions. [2019-05-23 09:23:14,583 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 387 [2019-05-23 09:23:14,584 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:14,584 INFO L146 ILogger]: trace histogram [64, 64, 64, 64, 64, 64, 1, 1] [2019-05-23 09:23:14,584 INFO L146 ILogger]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:14,584 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:14,584 INFO L146 ILogger]: Analyzing trace with hash -248337659, now seen corresponding path program 64 times [2019-05-23 09:23:14,585 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:14,602 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:14,605 INFO L146 ILogger]: Trace formula consists of 517 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:23:14,607 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:16,213 INFO L146 ILogger]: Checked inductivity of 12160 backedges. 0 proven. 12160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:16,213 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:16,213 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:23:16,214 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:23:16,214 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:23:16,214 INFO L146 ILogger]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:23:16,214 INFO L146 ILogger]: Start difference. First operand 387 states and 387 transitions. Second operand 67 states. [2019-05-23 09:23:16,505 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:16,505 INFO L146 ILogger]: Finished difference Result 398 states and 398 transitions. [2019-05-23 09:23:16,505 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:23:16,506 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 386 [2019-05-23 09:23:16,506 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:16,507 INFO L146 ILogger]: With dead ends: 398 [2019-05-23 09:23:16,507 INFO L146 ILogger]: Without dead ends: 398 [2019-05-23 09:23:16,507 INFO L146 ILogger]: 0 DeclaredPredicates, 385 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:23:16,508 INFO L146 ILogger]: Start minimizeSevpa. Operand 398 states. [2019-05-23 09:23:16,510 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 398 to 393. [2019-05-23 09:23:16,510 INFO L146 ILogger]: Start removeUnreachable. Operand 393 states. [2019-05-23 09:23:16,510 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-05-23 09:23:16,510 INFO L146 ILogger]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 386 [2019-05-23 09:23:16,511 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:16,511 INFO L146 ILogger]: Abstraction has 393 states and 393 transitions. [2019-05-23 09:23:16,511 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:23:16,511 INFO L146 ILogger]: Start isEmpty. Operand 393 states and 393 transitions. [2019-05-23 09:23:16,512 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 393 [2019-05-23 09:23:16,512 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:16,512 INFO L146 ILogger]: trace histogram [65, 65, 65, 65, 65, 65, 1, 1] [2019-05-23 09:23:16,513 INFO L146 ILogger]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:16,513 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:16,513 INFO L146 ILogger]: Analyzing trace with hash -716223294, now seen corresponding path program 65 times [2019-05-23 09:23:16,513 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:16,527 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:16,529 INFO L146 ILogger]: Trace formula consists of 525 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 09:23:16,532 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:18,480 INFO L146 ILogger]: Checked inductivity of 12545 backedges. 0 proven. 12545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:18,480 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:18,480 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:23:18,480 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:23:18,481 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:23:18,481 INFO L146 ILogger]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:23:18,481 INFO L146 ILogger]: Start difference. First operand 393 states and 393 transitions. Second operand 68 states. [2019-05-23 09:23:18,782 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:18,782 INFO L146 ILogger]: Finished difference Result 404 states and 404 transitions. [2019-05-23 09:23:18,783 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:23:18,783 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 392 [2019-05-23 09:23:18,783 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:18,785 INFO L146 ILogger]: With dead ends: 404 [2019-05-23 09:23:18,785 INFO L146 ILogger]: Without dead ends: 404 [2019-05-23 09:23:18,786 INFO L146 ILogger]: 0 DeclaredPredicates, 391 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:23:18,786 INFO L146 ILogger]: Start minimizeSevpa. Operand 404 states. [2019-05-23 09:23:18,789 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 404 to 399. [2019-05-23 09:23:18,789 INFO L146 ILogger]: Start removeUnreachable. Operand 399 states. [2019-05-23 09:23:18,789 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2019-05-23 09:23:18,789 INFO L146 ILogger]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 392 [2019-05-23 09:23:18,790 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:18,790 INFO L146 ILogger]: Abstraction has 399 states and 399 transitions. [2019-05-23 09:23:18,790 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:23:18,790 INFO L146 ILogger]: Start isEmpty. Operand 399 states and 399 transitions. [2019-05-23 09:23:18,791 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 399 [2019-05-23 09:23:18,791 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:18,791 INFO L146 ILogger]: trace histogram [66, 66, 66, 66, 66, 66, 1, 1] [2019-05-23 09:23:18,791 INFO L146 ILogger]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:18,792 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:18,792 INFO L146 ILogger]: Analyzing trace with hash 229174463, now seen corresponding path program 66 times [2019-05-23 09:23:18,792 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:18,806 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:18,809 INFO L146 ILogger]: Trace formula consists of 533 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:23:18,811 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:20,472 INFO L146 ILogger]: Checked inductivity of 12936 backedges. 0 proven. 12936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:20,473 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:20,473 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:23:20,473 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:23:20,474 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:23:20,474 INFO L146 ILogger]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:23:20,474 INFO L146 ILogger]: Start difference. First operand 399 states and 399 transitions. Second operand 69 states. [2019-05-23 09:23:20,778 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:20,778 INFO L146 ILogger]: Finished difference Result 410 states and 410 transitions. [2019-05-23 09:23:20,779 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:23:20,779 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 398 [2019-05-23 09:23:20,779 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:20,781 INFO L146 ILogger]: With dead ends: 410 [2019-05-23 09:23:20,781 INFO L146 ILogger]: Without dead ends: 410 [2019-05-23 09:23:20,782 INFO L146 ILogger]: 0 DeclaredPredicates, 397 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:23:20,782 INFO L146 ILogger]: Start minimizeSevpa. Operand 410 states. [2019-05-23 09:23:20,785 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 410 to 405. [2019-05-23 09:23:20,785 INFO L146 ILogger]: Start removeUnreachable. Operand 405 states. [2019-05-23 09:23:20,785 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-05-23 09:23:20,785 INFO L146 ILogger]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 398 [2019-05-23 09:23:20,785 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:20,786 INFO L146 ILogger]: Abstraction has 405 states and 405 transitions. [2019-05-23 09:23:20,786 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:23:20,786 INFO L146 ILogger]: Start isEmpty. Operand 405 states and 405 transitions. [2019-05-23 09:23:20,787 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 405 [2019-05-23 09:23:20,787 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:20,787 INFO L146 ILogger]: trace histogram [67, 67, 67, 67, 67, 67, 1, 1] [2019-05-23 09:23:20,787 INFO L146 ILogger]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:20,788 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:20,788 INFO L146 ILogger]: Analyzing trace with hash 630708988, now seen corresponding path program 67 times [2019-05-23 09:23:20,788 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:20,804 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:20,807 INFO L146 ILogger]: Trace formula consists of 541 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:23:20,810 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:22,930 INFO L146 ILogger]: Checked inductivity of 13333 backedges. 0 proven. 13333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:22,931 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:22,931 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:23:22,931 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:23:22,932 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:23:22,932 INFO L146 ILogger]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:23:22,932 INFO L146 ILogger]: Start difference. First operand 405 states and 405 transitions. Second operand 70 states. [2019-05-23 09:23:23,244 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:23,244 INFO L146 ILogger]: Finished difference Result 416 states and 416 transitions. [2019-05-23 09:23:23,244 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:23:23,245 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 404 [2019-05-23 09:23:23,245 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:23,247 INFO L146 ILogger]: With dead ends: 416 [2019-05-23 09:23:23,247 INFO L146 ILogger]: Without dead ends: 416 [2019-05-23 09:23:23,247 INFO L146 ILogger]: 0 DeclaredPredicates, 403 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:23:23,248 INFO L146 ILogger]: Start minimizeSevpa. Operand 416 states. [2019-05-23 09:23:23,250 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 416 to 411. [2019-05-23 09:23:23,250 INFO L146 ILogger]: Start removeUnreachable. Operand 411 states. [2019-05-23 09:23:23,250 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-05-23 09:23:23,250 INFO L146 ILogger]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 404 [2019-05-23 09:23:23,251 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:23,251 INFO L146 ILogger]: Abstraction has 411 states and 411 transitions. [2019-05-23 09:23:23,251 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:23:23,251 INFO L146 ILogger]: Start isEmpty. Operand 411 states and 411 transitions. [2019-05-23 09:23:23,252 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 411 [2019-05-23 09:23:23,252 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:23,252 INFO L146 ILogger]: trace histogram [68, 68, 68, 68, 68, 68, 1, 1] [2019-05-23 09:23:23,253 INFO L146 ILogger]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:23,253 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:23,253 INFO L146 ILogger]: Analyzing trace with hash -1191680135, now seen corresponding path program 68 times [2019-05-23 09:23:23,253 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:23,269 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:23,273 INFO L146 ILogger]: Trace formula consists of 549 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:23:23,276 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:25,098 INFO L146 ILogger]: Checked inductivity of 13736 backedges. 0 proven. 13736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:25,099 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:25,099 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:23:25,099 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:23:25,100 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:23:25,100 INFO L146 ILogger]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:25,100 INFO L146 ILogger]: Start difference. First operand 411 states and 411 transitions. Second operand 71 states. [2019-05-23 09:23:25,427 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:25,427 INFO L146 ILogger]: Finished difference Result 422 states and 422 transitions. [2019-05-23 09:23:25,427 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:23:25,428 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 410 [2019-05-23 09:23:25,428 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:25,430 INFO L146 ILogger]: With dead ends: 422 [2019-05-23 09:23:25,430 INFO L146 ILogger]: Without dead ends: 422 [2019-05-23 09:23:25,431 INFO L146 ILogger]: 0 DeclaredPredicates, 409 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:23:25,431 INFO L146 ILogger]: Start minimizeSevpa. Operand 422 states. [2019-05-23 09:23:25,433 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 422 to 417. [2019-05-23 09:23:25,433 INFO L146 ILogger]: Start removeUnreachable. Operand 417 states. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 410 [2019-05-23 09:23:25,434 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Abstraction has 417 states and 417 transitions. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:23:25,434 INFO L146 ILogger]: Start isEmpty. Operand 417 states and 417 transitions. [2019-05-23 09:23:25,435 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 417 [2019-05-23 09:23:25,436 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:25,436 INFO L146 ILogger]: trace histogram [69, 69, 69, 69, 69, 69, 1, 1] [2019-05-23 09:23:25,436 INFO L146 ILogger]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:25,436 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:25,436 INFO L146 ILogger]: Analyzing trace with hash 19587638, now seen corresponding path program 69 times [2019-05-23 09:23:25,437 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:25,458 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:25,460 INFO L146 ILogger]: Trace formula consists of 557 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 09:23:25,462 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:27,316 INFO L146 ILogger]: Checked inductivity of 14145 backedges. 0 proven. 14145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:27,316 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:27,316 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:23:27,317 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:23:27,317 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:23:27,317 INFO L146 ILogger]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:23:27,317 INFO L146 ILogger]: Start difference. First operand 417 states and 417 transitions. Second operand 72 states. [2019-05-23 09:23:27,692 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:27,692 INFO L146 ILogger]: Finished difference Result 428 states and 428 transitions. [2019-05-23 09:23:27,692 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:23:27,693 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 416 [2019-05-23 09:23:27,693 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:27,694 INFO L146 ILogger]: With dead ends: 428 [2019-05-23 09:23:27,694 INFO L146 ILogger]: Without dead ends: 428 [2019-05-23 09:23:27,695 INFO L146 ILogger]: 0 DeclaredPredicates, 415 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:23:27,695 INFO L146 ILogger]: Start minimizeSevpa. Operand 428 states. [2019-05-23 09:23:27,697 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 428 to 423. [2019-05-23 09:23:27,697 INFO L146 ILogger]: Start removeUnreachable. Operand 423 states. [2019-05-23 09:23:27,698 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2019-05-23 09:23:27,698 INFO L146 ILogger]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 416 [2019-05-23 09:23:27,698 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:27,698 INFO L146 ILogger]: Abstraction has 423 states and 423 transitions. [2019-05-23 09:23:27,698 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:23:27,698 INFO L146 ILogger]: Start isEmpty. Operand 423 states and 423 transitions. [2019-05-23 09:23:27,700 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 423 [2019-05-23 09:23:27,700 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:27,700 INFO L146 ILogger]: trace histogram [70, 70, 70, 70, 70, 70, 1, 1] [2019-05-23 09:23:27,700 INFO L146 ILogger]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:27,700 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:27,700 INFO L146 ILogger]: Analyzing trace with hash -1575773389, now seen corresponding path program 70 times [2019-05-23 09:23:27,701 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:27,712 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:27,714 INFO L146 ILogger]: Trace formula consists of 565 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:23:27,718 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:29,820 INFO L146 ILogger]: Checked inductivity of 14560 backedges. 0 proven. 14560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:29,820 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:29,820 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:23:29,821 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:23:29,821 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:23:29,821 INFO L146 ILogger]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:29,822 INFO L146 ILogger]: Start difference. First operand 423 states and 423 transitions. Second operand 73 states. [2019-05-23 09:23:30,154 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:30,154 INFO L146 ILogger]: Finished difference Result 434 states and 434 transitions. [2019-05-23 09:23:30,155 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:23:30,155 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 422 [2019-05-23 09:23:30,155 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:30,157 INFO L146 ILogger]: With dead ends: 434 [2019-05-23 09:23:30,157 INFO L146 ILogger]: Without dead ends: 434 [2019-05-23 09:23:30,158 INFO L146 ILogger]: 0 DeclaredPredicates, 421 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:23:30,159 INFO L146 ILogger]: Start minimizeSevpa. Operand 434 states. [2019-05-23 09:23:30,161 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 434 to 429. [2019-05-23 09:23:30,161 INFO L146 ILogger]: Start removeUnreachable. Operand 429 states. [2019-05-23 09:23:30,162 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 429 states to 429 states and 429 transitions. [2019-05-23 09:23:30,162 INFO L146 ILogger]: Start accepts. Automaton has 429 states and 429 transitions. Word has length 422 [2019-05-23 09:23:30,162 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:30,162 INFO L146 ILogger]: Abstraction has 429 states and 429 transitions. [2019-05-23 09:23:30,162 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:23:30,162 INFO L146 ILogger]: Start isEmpty. Operand 429 states and 429 transitions. [2019-05-23 09:23:30,164 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 429 [2019-05-23 09:23:30,164 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:30,164 INFO L146 ILogger]: trace histogram [71, 71, 71, 71, 71, 71, 1, 1] [2019-05-23 09:23:30,164 INFO L146 ILogger]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:30,164 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:30,165 INFO L146 ILogger]: Analyzing trace with hash -1222974864, now seen corresponding path program 71 times [2019-05-23 09:23:30,165 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:30,179 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:30,183 INFO L146 ILogger]: Trace formula consists of 573 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 09:23:30,186 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:32,121 INFO L146 ILogger]: Checked inductivity of 14981 backedges. 0 proven. 14981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:32,122 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:32,122 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:23:32,122 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:23:32,123 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:23:32,123 INFO L146 ILogger]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:23:32,123 INFO L146 ILogger]: Start difference. First operand 429 states and 429 transitions. Second operand 74 states. [2019-05-23 09:23:32,471 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:32,472 INFO L146 ILogger]: Finished difference Result 440 states and 440 transitions. [2019-05-23 09:23:32,472 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:23:32,472 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 428 [2019-05-23 09:23:32,473 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:32,475 INFO L146 ILogger]: With dead ends: 440 [2019-05-23 09:23:32,475 INFO L146 ILogger]: Without dead ends: 440 [2019-05-23 09:23:32,475 INFO L146 ILogger]: 0 DeclaredPredicates, 427 GetRequests, 355 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:23:32,476 INFO L146 ILogger]: Start minimizeSevpa. Operand 440 states. [2019-05-23 09:23:32,479 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 440 to 435. [2019-05-23 09:23:32,479 INFO L146 ILogger]: Start removeUnreachable. Operand 435 states. [2019-05-23 09:23:32,479 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2019-05-23 09:23:32,479 INFO L146 ILogger]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 428 [2019-05-23 09:23:32,479 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:32,480 INFO L146 ILogger]: Abstraction has 435 states and 435 transitions. [2019-05-23 09:23:32,480 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:23:32,480 INFO L146 ILogger]: Start isEmpty. Operand 435 states and 435 transitions. [2019-05-23 09:23:32,481 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 435 [2019-05-23 09:23:32,481 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:32,481 INFO L146 ILogger]: trace histogram [72, 72, 72, 72, 72, 72, 1, 1] [2019-05-23 09:23:32,482 INFO L146 ILogger]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:32,482 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:32,482 INFO L146 ILogger]: Analyzing trace with hash 539822061, now seen corresponding path program 72 times [2019-05-23 09:23:32,482 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:32,501 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:32,504 INFO L146 ILogger]: Trace formula consists of 581 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:23:32,508 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:35,529 INFO L146 ILogger]: Checked inductivity of 15408 backedges. 0 proven. 15408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:35,529 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:35,530 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:23:35,530 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:23:35,530 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:23:35,531 INFO L146 ILogger]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:35,531 INFO L146 ILogger]: Start difference. First operand 435 states and 435 transitions. Second operand 75 states. [2019-05-23 09:23:35,868 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:35,868 INFO L146 ILogger]: Finished difference Result 446 states and 446 transitions. [2019-05-23 09:23:35,874 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:23:35,874 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 434 [2019-05-23 09:23:35,875 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:35,876 INFO L146 ILogger]: With dead ends: 446 [2019-05-23 09:23:35,876 INFO L146 ILogger]: Without dead ends: 446 [2019-05-23 09:23:35,877 INFO L146 ILogger]: 0 DeclaredPredicates, 433 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:23:35,877 INFO L146 ILogger]: Start minimizeSevpa. Operand 446 states. [2019-05-23 09:23:35,880 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-05-23 09:23:35,880 INFO L146 ILogger]: Start removeUnreachable. Operand 441 states. [2019-05-23 09:23:35,880 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2019-05-23 09:23:35,880 INFO L146 ILogger]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 434 [2019-05-23 09:23:35,880 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:35,880 INFO L146 ILogger]: Abstraction has 441 states and 441 transitions. [2019-05-23 09:23:35,881 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:23:35,881 INFO L146 ILogger]: Start isEmpty. Operand 441 states and 441 transitions. [2019-05-23 09:23:35,882 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 441 [2019-05-23 09:23:35,882 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:35,882 INFO L146 ILogger]: trace histogram [73, 73, 73, 73, 73, 73, 1, 1] [2019-05-23 09:23:35,882 INFO L146 ILogger]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:35,883 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:35,883 INFO L146 ILogger]: Analyzing trace with hash 247094186, now seen corresponding path program 73 times [2019-05-23 09:23:35,883 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:35,894 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:35,897 INFO L146 ILogger]: Trace formula consists of 589 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:23:35,899 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:38,187 INFO L146 ILogger]: Checked inductivity of 15841 backedges. 0 proven. 15841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:38,187 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:38,187 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:23:38,188 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:23:38,188 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:23:38,189 INFO L146 ILogger]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:23:38,189 INFO L146 ILogger]: Start difference. First operand 441 states and 441 transitions. Second operand 76 states. [2019-05-23 09:23:38,535 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:38,535 INFO L146 ILogger]: Finished difference Result 452 states and 452 transitions. [2019-05-23 09:23:38,535 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:23:38,535 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 440 [2019-05-23 09:23:38,536 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:38,538 INFO L146 ILogger]: With dead ends: 452 [2019-05-23 09:23:38,538 INFO L146 ILogger]: Without dead ends: 452 [2019-05-23 09:23:38,539 INFO L146 ILogger]: 0 DeclaredPredicates, 439 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:23:38,539 INFO L146 ILogger]: Start minimizeSevpa. Operand 452 states. [2019-05-23 09:23:38,542 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 452 to 447. [2019-05-23 09:23:38,542 INFO L146 ILogger]: Start removeUnreachable. Operand 447 states. [2019-05-23 09:23:38,542 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2019-05-23 09:23:38,542 INFO L146 ILogger]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 440 [2019-05-23 09:23:38,542 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:38,543 INFO L146 ILogger]: Abstraction has 447 states and 447 transitions. [2019-05-23 09:23:38,543 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:23:38,543 INFO L146 ILogger]: Start isEmpty. Operand 447 states and 447 transitions. [2019-05-23 09:23:38,544 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 447 [2019-05-23 09:23:38,544 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:38,544 INFO L146 ILogger]: trace histogram [74, 74, 74, 74, 74, 74, 1, 1] [2019-05-23 09:23:38,545 INFO L146 ILogger]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:38,545 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:38,545 INFO L146 ILogger]: Analyzing trace with hash -759747161, now seen corresponding path program 74 times [2019-05-23 09:23:38,546 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:38,558 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:38,561 INFO L146 ILogger]: Trace formula consists of 597 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:23:38,563 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:40,699 INFO L146 ILogger]: Checked inductivity of 16280 backedges. 0 proven. 16280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:40,699 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:40,700 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:23:40,700 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:23:40,700 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:23:40,701 INFO L146 ILogger]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:40,701 INFO L146 ILogger]: Start difference. First operand 447 states and 447 transitions. Second operand 77 states. [2019-05-23 09:23:41,070 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:41,071 INFO L146 ILogger]: Finished difference Result 458 states and 458 transitions. [2019-05-23 09:23:41,071 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:23:41,071 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 446 [2019-05-23 09:23:41,072 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:41,074 INFO L146 ILogger]: With dead ends: 458 [2019-05-23 09:23:41,074 INFO L146 ILogger]: Without dead ends: 458 [2019-05-23 09:23:41,074 INFO L146 ILogger]: 0 DeclaredPredicates, 445 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:23:41,075 INFO L146 ILogger]: Start minimizeSevpa. Operand 458 states. [2019-05-23 09:23:41,077 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 458 to 453. [2019-05-23 09:23:41,077 INFO L146 ILogger]: Start removeUnreachable. Operand 453 states. [2019-05-23 09:23:41,077 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2019-05-23 09:23:41,078 INFO L146 ILogger]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 446 [2019-05-23 09:23:41,078 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:41,078 INFO L146 ILogger]: Abstraction has 453 states and 453 transitions. [2019-05-23 09:23:41,078 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:23:41,078 INFO L146 ILogger]: Start isEmpty. Operand 453 states and 453 transitions. [2019-05-23 09:23:41,079 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 453 [2019-05-23 09:23:41,080 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:41,080 INFO L146 ILogger]: trace histogram [75, 75, 75, 75, 75, 75, 1, 1] [2019-05-23 09:23:41,080 INFO L146 ILogger]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:41,080 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:41,080 INFO L146 ILogger]: Analyzing trace with hash -409219612, now seen corresponding path program 75 times [2019-05-23 09:23:41,081 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:41,093 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:41,096 INFO L146 ILogger]: Trace formula consists of 605 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 09:23:41,100 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:43,376 INFO L146 ILogger]: Checked inductivity of 16725 backedges. 0 proven. 16725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:43,377 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:43,377 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:23:43,377 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:23:43,377 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:23:43,378 INFO L146 ILogger]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:23:43,378 INFO L146 ILogger]: Start difference. First operand 453 states and 453 transitions. Second operand 78 states. [2019-05-23 09:23:43,731 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:43,731 INFO L146 ILogger]: Finished difference Result 464 states and 464 transitions. [2019-05-23 09:23:43,731 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:23:43,732 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 452 [2019-05-23 09:23:43,732 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:43,734 INFO L146 ILogger]: With dead ends: 464 [2019-05-23 09:23:43,734 INFO L146 ILogger]: Without dead ends: 464 [2019-05-23 09:23:43,735 INFO L146 ILogger]: 0 DeclaredPredicates, 451 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:23:43,735 INFO L146 ILogger]: Start minimizeSevpa. Operand 464 states. [2019-05-23 09:23:43,738 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 464 to 459. [2019-05-23 09:23:43,738 INFO L146 ILogger]: Start removeUnreachable. Operand 459 states. [2019-05-23 09:23:43,738 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2019-05-23 09:23:43,738 INFO L146 ILogger]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 452 [2019-05-23 09:23:43,738 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:43,738 INFO L146 ILogger]: Abstraction has 459 states and 459 transitions. [2019-05-23 09:23:43,739 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:23:43,739 INFO L146 ILogger]: Start isEmpty. Operand 459 states and 459 transitions. [2019-05-23 09:23:43,740 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 459 [2019-05-23 09:23:43,740 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:43,741 INFO L146 ILogger]: trace histogram [76, 76, 76, 76, 76, 76, 1, 1] [2019-05-23 09:23:43,741 INFO L146 ILogger]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:43,741 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:43,741 INFO L146 ILogger]: Analyzing trace with hash 1097108577, now seen corresponding path program 76 times [2019-05-23 09:23:43,742 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:43,756 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:43,760 INFO L146 ILogger]: Trace formula consists of 613 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:23:43,764 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:46,026 INFO L146 ILogger]: Checked inductivity of 17176 backedges. 0 proven. 17176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:46,027 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:46,027 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:23:46,027 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:23:46,028 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:23:46,028 INFO L146 ILogger]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:46,028 INFO L146 ILogger]: Start difference. First operand 459 states and 459 transitions. Second operand 79 states. [2019-05-23 09:23:46,388 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:46,389 INFO L146 ILogger]: Finished difference Result 470 states and 470 transitions. [2019-05-23 09:23:46,389 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:23:46,389 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 458 [2019-05-23 09:23:46,389 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:46,390 INFO L146 ILogger]: With dead ends: 470 [2019-05-23 09:23:46,391 INFO L146 ILogger]: Without dead ends: 470 [2019-05-23 09:23:46,391 INFO L146 ILogger]: 0 DeclaredPredicates, 457 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:23:46,391 INFO L146 ILogger]: Start minimizeSevpa. Operand 470 states. [2019-05-23 09:23:46,394 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 470 to 465. [2019-05-23 09:23:46,394 INFO L146 ILogger]: Start removeUnreachable. Operand 465 states. [2019-05-23 09:23:46,394 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 465 states to 465 states and 465 transitions. [2019-05-23 09:23:46,395 INFO L146 ILogger]: Start accepts. Automaton has 465 states and 465 transitions. Word has length 458 [2019-05-23 09:23:46,395 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:46,395 INFO L146 ILogger]: Abstraction has 465 states and 465 transitions. [2019-05-23 09:23:46,395 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:23:46,395 INFO L146 ILogger]: Start isEmpty. Operand 465 states and 465 transitions. [2019-05-23 09:23:46,397 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 465 [2019-05-23 09:23:46,397 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:46,397 INFO L146 ILogger]: trace histogram [77, 77, 77, 77, 77, 77, 1, 1] [2019-05-23 09:23:46,397 INFO L146 ILogger]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:46,397 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:46,398 INFO L146 ILogger]: Analyzing trace with hash -644761314, now seen corresponding path program 77 times [2019-05-23 09:23:46,398 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:46,417 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:46,420 INFO L146 ILogger]: Trace formula consists of 621 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 09:23:46,423 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:48,837 INFO L146 ILogger]: Checked inductivity of 17633 backedges. 0 proven. 17633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:48,837 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:48,837 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:23:48,838 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:23:48,838 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:23:48,838 INFO L146 ILogger]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:23:48,839 INFO L146 ILogger]: Start difference. First operand 465 states and 465 transitions. Second operand 80 states. [2019-05-23 09:23:49,209 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:49,210 INFO L146 ILogger]: Finished difference Result 476 states and 476 transitions. [2019-05-23 09:23:49,210 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:23:49,210 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 464 [2019-05-23 09:23:49,211 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:49,213 INFO L146 ILogger]: With dead ends: 476 [2019-05-23 09:23:49,213 INFO L146 ILogger]: Without dead ends: 476 [2019-05-23 09:23:49,214 INFO L146 ILogger]: 0 DeclaredPredicates, 463 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:23:49,214 INFO L146 ILogger]: Start minimizeSevpa. Operand 476 states. [2019-05-23 09:23:49,217 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 476 to 471. [2019-05-23 09:23:49,217 INFO L146 ILogger]: Start removeUnreachable. Operand 471 states. [2019-05-23 09:23:49,226 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2019-05-23 09:23:49,226 INFO L146 ILogger]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 464 [2019-05-23 09:23:49,227 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:49,227 INFO L146 ILogger]: Abstraction has 471 states and 471 transitions. [2019-05-23 09:23:49,227 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:23:49,227 INFO L146 ILogger]: Start isEmpty. Operand 471 states and 471 transitions. [2019-05-23 09:23:49,228 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 471 [2019-05-23 09:23:49,228 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:49,229 INFO L146 ILogger]: trace histogram [78, 78, 78, 78, 78, 78, 1, 1] [2019-05-23 09:23:49,229 INFO L146 ILogger]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:49,229 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:49,229 INFO L146 ILogger]: Analyzing trace with hash 2082972699, now seen corresponding path program 78 times [2019-05-23 09:23:49,230 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:49,243 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:49,246 INFO L146 ILogger]: Trace formula consists of 629 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:23:49,249 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:51,552 INFO L146 ILogger]: Checked inductivity of 18096 backedges. 0 proven. 18096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:51,552 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:51,552 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:23:51,553 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:23:51,553 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:23:51,553 INFO L146 ILogger]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:51,553 INFO L146 ILogger]: Start difference. First operand 471 states and 471 transitions. Second operand 81 states. [2019-05-23 09:23:51,935 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:51,935 INFO L146 ILogger]: Finished difference Result 482 states and 482 transitions. [2019-05-23 09:23:51,935 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:23:51,936 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 470 [2019-05-23 09:23:51,936 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:51,938 INFO L146 ILogger]: With dead ends: 482 [2019-05-23 09:23:51,938 INFO L146 ILogger]: Without dead ends: 482 [2019-05-23 09:23:51,939 INFO L146 ILogger]: 0 DeclaredPredicates, 469 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:23:51,939 INFO L146 ILogger]: Start minimizeSevpa. Operand 482 states. [2019-05-23 09:23:51,942 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 482 to 477. [2019-05-23 09:23:51,942 INFO L146 ILogger]: Start removeUnreachable. Operand 477 states. [2019-05-23 09:23:51,942 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2019-05-23 09:23:51,942 INFO L146 ILogger]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 470 [2019-05-23 09:23:51,943 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:51,943 INFO L146 ILogger]: Abstraction has 477 states and 477 transitions. [2019-05-23 09:23:51,943 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:23:51,943 INFO L146 ILogger]: Start isEmpty. Operand 477 states and 477 transitions. [2019-05-23 09:23:51,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 477 [2019-05-23 09:23:51,944 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:51,945 INFO L146 ILogger]: trace histogram [79, 79, 79, 79, 79, 79, 1, 1] [2019-05-23 09:23:51,945 INFO L146 ILogger]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:51,945 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:51,945 INFO L146 ILogger]: Analyzing trace with hash -726753960, now seen corresponding path program 79 times [2019-05-23 09:23:51,945 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:51,958 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:51,961 INFO L146 ILogger]: Trace formula consists of 637 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:23:51,963 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:54,650 INFO L146 ILogger]: Checked inductivity of 18565 backedges. 0 proven. 18565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:54,651 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:54,651 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:23:54,651 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:23:54,652 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:23:54,652 INFO L146 ILogger]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:23:54,652 INFO L146 ILogger]: Start difference. First operand 477 states and 477 transitions. Second operand 82 states. [2019-05-23 09:23:55,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:55,043 INFO L146 ILogger]: Finished difference Result 488 states and 488 transitions. [2019-05-23 09:23:55,043 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:23:55,043 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 476 [2019-05-23 09:23:55,044 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:55,046 INFO L146 ILogger]: With dead ends: 488 [2019-05-23 09:23:55,046 INFO L146 ILogger]: Without dead ends: 488 [2019-05-23 09:23:55,047 INFO L146 ILogger]: 0 DeclaredPredicates, 475 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:23:55,047 INFO L146 ILogger]: Start minimizeSevpa. Operand 488 states. [2019-05-23 09:23:55,050 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 488 to 483. [2019-05-23 09:23:55,050 INFO L146 ILogger]: Start removeUnreachable. Operand 483 states. [2019-05-23 09:23:55,050 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2019-05-23 09:23:55,050 INFO L146 ILogger]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 476 [2019-05-23 09:23:55,051 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:55,051 INFO L146 ILogger]: Abstraction has 483 states and 483 transitions. [2019-05-23 09:23:55,051 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:23:55,051 INFO L146 ILogger]: Start isEmpty. Operand 483 states and 483 transitions. [2019-05-23 09:23:55,052 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 483 [2019-05-23 09:23:55,053 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:55,053 INFO L146 ILogger]: trace histogram [80, 80, 80, 80, 80, 80, 1, 1] [2019-05-23 09:23:55,053 INFO L146 ILogger]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:55,053 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:55,053 INFO L146 ILogger]: Analyzing trace with hash -1154288427, now seen corresponding path program 80 times [2019-05-23 09:23:55,054 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:55,073 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:55,077 INFO L146 ILogger]: Trace formula consists of 645 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:23:55,081 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:23:57,514 INFO L146 ILogger]: Checked inductivity of 19040 backedges. 0 proven. 19040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:23:57,514 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:23:57,514 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:23:57,515 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:23:57,515 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:23:57,515 INFO L146 ILogger]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:23:57,515 INFO L146 ILogger]: Start difference. First operand 483 states and 483 transitions. Second operand 83 states. [2019-05-23 09:23:57,904 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:23:57,905 INFO L146 ILogger]: Finished difference Result 494 states and 494 transitions. [2019-05-23 09:23:57,905 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:23:57,905 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 482 [2019-05-23 09:23:57,906 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:23:57,908 INFO L146 ILogger]: With dead ends: 494 [2019-05-23 09:23:57,908 INFO L146 ILogger]: Without dead ends: 494 [2019-05-23 09:23:57,909 INFO L146 ILogger]: 0 DeclaredPredicates, 481 GetRequests, 400 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:23:57,909 INFO L146 ILogger]: Start minimizeSevpa. Operand 494 states. [2019-05-23 09:23:57,912 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 494 to 489. [2019-05-23 09:23:57,912 INFO L146 ILogger]: Start removeUnreachable. Operand 489 states. [2019-05-23 09:23:57,913 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 489 states to 489 states and 489 transitions. [2019-05-23 09:23:57,913 INFO L146 ILogger]: Start accepts. Automaton has 489 states and 489 transitions. Word has length 482 [2019-05-23 09:23:57,913 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:23:57,913 INFO L146 ILogger]: Abstraction has 489 states and 489 transitions. [2019-05-23 09:23:57,913 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:23:57,913 INFO L146 ILogger]: Start isEmpty. Operand 489 states and 489 transitions. [2019-05-23 09:23:57,915 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 489 [2019-05-23 09:23:57,915 INFO L146 ILogger]: Found error trace [2019-05-23 09:23:57,915 INFO L146 ILogger]: trace histogram [81, 81, 81, 81, 81, 81, 1, 1] [2019-05-23 09:23:57,915 INFO L146 ILogger]: === Iteration 82 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:23:57,915 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:23:57,916 INFO L146 ILogger]: Analyzing trace with hash -1052444014, now seen corresponding path program 81 times [2019-05-23 09:23:57,916 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:23:57,935 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:23:57,938 INFO L146 ILogger]: Trace formula consists of 653 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 09:23:57,941 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:00,521 INFO L146 ILogger]: Checked inductivity of 19521 backedges. 0 proven. 19521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:00,522 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:00,522 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:24:00,522 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:24:00,522 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:24:00,523 INFO L146 ILogger]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:24:00,523 INFO L146 ILogger]: Start difference. First operand 489 states and 489 transitions. Second operand 84 states. [2019-05-23 09:24:00,925 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:00,925 INFO L146 ILogger]: Finished difference Result 500 states and 500 transitions. [2019-05-23 09:24:00,925 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:24:00,926 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 488 [2019-05-23 09:24:00,926 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:00,928 INFO L146 ILogger]: With dead ends: 500 [2019-05-23 09:24:00,928 INFO L146 ILogger]: Without dead ends: 500 [2019-05-23 09:24:00,929 INFO L146 ILogger]: 0 DeclaredPredicates, 487 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:24:00,930 INFO L146 ILogger]: Start minimizeSevpa. Operand 500 states. [2019-05-23 09:24:00,933 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 500 to 495. [2019-05-23 09:24:00,933 INFO L146 ILogger]: Start removeUnreachable. Operand 495 states. [2019-05-23 09:24:00,933 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 495 states to 495 states and 495 transitions. [2019-05-23 09:24:00,934 INFO L146 ILogger]: Start accepts. Automaton has 495 states and 495 transitions. Word has length 488 [2019-05-23 09:24:00,934 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:00,934 INFO L146 ILogger]: Abstraction has 495 states and 495 transitions. [2019-05-23 09:24:00,934 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:24:00,934 INFO L146 ILogger]: Start isEmpty. Operand 495 states and 495 transitions. [2019-05-23 09:24:00,936 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 495 [2019-05-23 09:24:00,936 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:00,936 INFO L146 ILogger]: trace histogram [82, 82, 82, 82, 82, 82, 1, 1] [2019-05-23 09:24:00,936 INFO L146 ILogger]: === Iteration 83 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:00,936 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:00,936 INFO L146 ILogger]: Analyzing trace with hash -17236337, now seen corresponding path program 82 times [2019-05-23 09:24:00,937 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:00,950 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:00,954 INFO L146 ILogger]: Trace formula consists of 661 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:24:00,958 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:03,603 INFO L146 ILogger]: Checked inductivity of 20008 backedges. 0 proven. 20008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:03,604 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:03,604 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:24:03,604 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:24:03,605 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:24:03,605 INFO L146 ILogger]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:24:03,605 INFO L146 ILogger]: Start difference. First operand 495 states and 495 transitions. Second operand 85 states. [2019-05-23 09:24:04,010 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:04,010 INFO L146 ILogger]: Finished difference Result 506 states and 506 transitions. [2019-05-23 09:24:04,010 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:24:04,011 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 494 [2019-05-23 09:24:04,011 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:04,013 INFO L146 ILogger]: With dead ends: 506 [2019-05-23 09:24:04,013 INFO L146 ILogger]: Without dead ends: 506 [2019-05-23 09:24:04,014 INFO L146 ILogger]: 0 DeclaredPredicates, 493 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:24:04,015 INFO L146 ILogger]: Start minimizeSevpa. Operand 506 states. [2019-05-23 09:24:04,017 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-05-23 09:24:04,017 INFO L146 ILogger]: Start removeUnreachable. Operand 501 states. [2019-05-23 09:24:04,018 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2019-05-23 09:24:04,018 INFO L146 ILogger]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 494 [2019-05-23 09:24:04,018 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:04,018 INFO L146 ILogger]: Abstraction has 501 states and 501 transitions. [2019-05-23 09:24:04,018 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:24:04,018 INFO L146 ILogger]: Start isEmpty. Operand 501 states and 501 transitions. [2019-05-23 09:24:04,020 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 501 [2019-05-23 09:24:04,020 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:04,020 INFO L146 ILogger]: trace histogram [83, 83, 83, 83, 83, 83, 1, 1] [2019-05-23 09:24:04,021 INFO L146 ILogger]: === Iteration 84 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:04,021 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:04,021 INFO L146 ILogger]: Analyzing trace with hash 535253196, now seen corresponding path program 83 times [2019-05-23 09:24:04,021 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:04,034 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:04,037 INFO L146 ILogger]: Trace formula consists of 669 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 09:24:04,040 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:06,694 INFO L146 ILogger]: Checked inductivity of 20501 backedges. 0 proven. 20501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:06,694 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:06,694 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:24:06,695 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:24:06,695 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:24:06,695 INFO L146 ILogger]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:24:06,695 INFO L146 ILogger]: Start difference. First operand 501 states and 501 transitions. Second operand 86 states. [2019-05-23 09:24:07,110 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:07,110 INFO L146 ILogger]: Finished difference Result 512 states and 512 transitions. [2019-05-23 09:24:07,111 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:24:07,111 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 500 [2019-05-23 09:24:07,112 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:07,114 INFO L146 ILogger]: With dead ends: 512 [2019-05-23 09:24:07,114 INFO L146 ILogger]: Without dead ends: 512 [2019-05-23 09:24:07,115 INFO L146 ILogger]: 0 DeclaredPredicates, 499 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:24:07,115 INFO L146 ILogger]: Start minimizeSevpa. Operand 512 states. [2019-05-23 09:24:07,118 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 512 to 507. [2019-05-23 09:24:07,118 INFO L146 ILogger]: Start removeUnreachable. Operand 507 states. [2019-05-23 09:24:07,118 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2019-05-23 09:24:07,118 INFO L146 ILogger]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 500 [2019-05-23 09:24:07,119 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:07,119 INFO L146 ILogger]: Abstraction has 507 states and 507 transitions. [2019-05-23 09:24:07,119 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:24:07,119 INFO L146 ILogger]: Start isEmpty. Operand 507 states and 507 transitions. [2019-05-23 09:24:07,121 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 507 [2019-05-23 09:24:07,121 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:07,121 INFO L146 ILogger]: trace histogram [84, 84, 84, 84, 84, 84, 1, 1] [2019-05-23 09:24:07,121 INFO L146 ILogger]: === Iteration 85 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:07,121 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:07,122 INFO L146 ILogger]: Analyzing trace with hash -1339276983, now seen corresponding path program 84 times [2019-05-23 09:24:07,122 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:07,136 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:07,139 INFO L146 ILogger]: Trace formula consists of 677 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:24:07,142 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:09,979 INFO L146 ILogger]: Checked inductivity of 21000 backedges. 0 proven. 21000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:09,979 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:09,979 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:24:09,980 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:24:09,981 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:24:09,981 INFO L146 ILogger]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:24:09,982 INFO L146 ILogger]: Start difference. First operand 507 states and 507 transitions. Second operand 87 states. [2019-05-23 09:24:10,408 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:10,409 INFO L146 ILogger]: Finished difference Result 518 states and 518 transitions. [2019-05-23 09:24:10,409 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:24:10,409 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 506 [2019-05-23 09:24:10,410 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:10,412 INFO L146 ILogger]: With dead ends: 518 [2019-05-23 09:24:10,412 INFO L146 ILogger]: Without dead ends: 518 [2019-05-23 09:24:10,412 INFO L146 ILogger]: 0 DeclaredPredicates, 505 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:24:10,412 INFO L146 ILogger]: Start minimizeSevpa. Operand 518 states. [2019-05-23 09:24:10,415 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 518 to 513. [2019-05-23 09:24:10,415 INFO L146 ILogger]: Start removeUnreachable. Operand 513 states. [2019-05-23 09:24:10,416 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2019-05-23 09:24:10,416 INFO L146 ILogger]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 506 [2019-05-23 09:24:10,417 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:10,417 INFO L146 ILogger]: Abstraction has 513 states and 513 transitions. [2019-05-23 09:24:10,417 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:24:10,417 INFO L146 ILogger]: Start isEmpty. Operand 513 states and 513 transitions. [2019-05-23 09:24:10,419 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 513 [2019-05-23 09:24:10,419 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:10,419 INFO L146 ILogger]: trace histogram [85, 85, 85, 85, 85, 85, 1, 1] [2019-05-23 09:24:10,420 INFO L146 ILogger]: === Iteration 86 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:10,420 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:10,420 INFO L146 ILogger]: Analyzing trace with hash -1452793850, now seen corresponding path program 85 times [2019-05-23 09:24:10,420 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:10,434 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:10,437 INFO L146 ILogger]: Trace formula consists of 685 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:24:10,440 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:13,130 INFO L146 ILogger]: Checked inductivity of 21505 backedges. 0 proven. 21505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:13,130 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:13,131 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:24:13,131 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:24:13,132 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:24:13,132 INFO L146 ILogger]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:24:13,132 INFO L146 ILogger]: Start difference. First operand 513 states and 513 transitions. Second operand 88 states. [2019-05-23 09:24:13,592 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:13,593 INFO L146 ILogger]: Finished difference Result 524 states and 524 transitions. [2019-05-23 09:24:13,593 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:24:13,593 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 512 [2019-05-23 09:24:13,594 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:13,596 INFO L146 ILogger]: With dead ends: 524 [2019-05-23 09:24:13,596 INFO L146 ILogger]: Without dead ends: 524 [2019-05-23 09:24:13,597 INFO L146 ILogger]: 0 DeclaredPredicates, 511 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:24:13,597 INFO L146 ILogger]: Start minimizeSevpa. Operand 524 states. [2019-05-23 09:24:13,600 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 524 to 519. [2019-05-23 09:24:13,601 INFO L146 ILogger]: Start removeUnreachable. Operand 519 states. [2019-05-23 09:24:13,601 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 519 states to 519 states and 519 transitions. [2019-05-23 09:24:13,601 INFO L146 ILogger]: Start accepts. Automaton has 519 states and 519 transitions. Word has length 512 [2019-05-23 09:24:13,601 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:13,602 INFO L146 ILogger]: Abstraction has 519 states and 519 transitions. [2019-05-23 09:24:13,602 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:24:13,602 INFO L146 ILogger]: Start isEmpty. Operand 519 states and 519 transitions. [2019-05-23 09:24:13,604 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 519 [2019-05-23 09:24:13,604 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:13,604 INFO L146 ILogger]: trace histogram [86, 86, 86, 86, 86, 86, 1, 1] [2019-05-23 09:24:13,604 INFO L146 ILogger]: === Iteration 87 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:13,604 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:13,604 INFO L146 ILogger]: Analyzing trace with hash 1069497603, now seen corresponding path program 86 times [2019-05-23 09:24:13,605 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:13,619 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:13,621 INFO L146 ILogger]: Trace formula consists of 693 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:24:13,624 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:16,493 INFO L146 ILogger]: Checked inductivity of 22016 backedges. 0 proven. 22016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:16,493 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:16,493 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:24:16,494 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:24:16,494 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:24:16,495 INFO L146 ILogger]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:24:16,495 INFO L146 ILogger]: Start difference. First operand 519 states and 519 transitions. Second operand 89 states. [2019-05-23 09:24:16,926 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:16,926 INFO L146 ILogger]: Finished difference Result 530 states and 530 transitions. [2019-05-23 09:24:16,926 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:24:16,926 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 518 [2019-05-23 09:24:16,927 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:16,929 INFO L146 ILogger]: With dead ends: 530 [2019-05-23 09:24:16,929 INFO L146 ILogger]: Without dead ends: 530 [2019-05-23 09:24:16,930 INFO L146 ILogger]: 0 DeclaredPredicates, 517 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:24:16,930 INFO L146 ILogger]: Start minimizeSevpa. Operand 530 states. [2019-05-23 09:24:16,933 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 530 to 525. [2019-05-23 09:24:16,933 INFO L146 ILogger]: Start removeUnreachable. Operand 525 states. [2019-05-23 09:24:16,933 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 525 states to 525 states and 525 transitions. [2019-05-23 09:24:16,933 INFO L146 ILogger]: Start accepts. Automaton has 525 states and 525 transitions. Word has length 518 [2019-05-23 09:24:16,934 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:16,934 INFO L146 ILogger]: Abstraction has 525 states and 525 transitions. [2019-05-23 09:24:16,934 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:24:16,934 INFO L146 ILogger]: Start isEmpty. Operand 525 states and 525 transitions. [2019-05-23 09:24:16,936 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 525 [2019-05-23 09:24:16,936 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:16,936 INFO L146 ILogger]: trace histogram [87, 87, 87, 87, 87, 87, 1, 1] [2019-05-23 09:24:16,936 INFO L146 ILogger]: === Iteration 88 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:16,936 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:16,937 INFO L146 ILogger]: Analyzing trace with hash -287709120, now seen corresponding path program 87 times [2019-05-23 09:24:16,937 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:16,958 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:16,963 INFO L146 ILogger]: Trace formula consists of 701 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 09:24:16,967 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:20,130 INFO L146 ILogger]: Checked inductivity of 22533 backedges. 0 proven. 22533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:20,130 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:20,130 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:24:20,131 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:24:20,131 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:24:20,132 INFO L146 ILogger]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:24:20,132 INFO L146 ILogger]: Start difference. First operand 525 states and 525 transitions. Second operand 90 states. [2019-05-23 09:24:20,570 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:20,570 INFO L146 ILogger]: Finished difference Result 536 states and 536 transitions. [2019-05-23 09:24:20,570 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:24:20,570 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 524 [2019-05-23 09:24:20,571 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:20,573 INFO L146 ILogger]: With dead ends: 536 [2019-05-23 09:24:20,573 INFO L146 ILogger]: Without dead ends: 536 [2019-05-23 09:24:20,574 INFO L146 ILogger]: 0 DeclaredPredicates, 523 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:24:20,574 INFO L146 ILogger]: Start minimizeSevpa. Operand 536 states. [2019-05-23 09:24:20,577 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 536 to 531. [2019-05-23 09:24:20,577 INFO L146 ILogger]: Start removeUnreachable. Operand 531 states. [2019-05-23 09:24:20,578 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 531 states to 531 states and 531 transitions. [2019-05-23 09:24:20,578 INFO L146 ILogger]: Start accepts. Automaton has 531 states and 531 transitions. Word has length 524 [2019-05-23 09:24:20,578 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:20,578 INFO L146 ILogger]: Abstraction has 531 states and 531 transitions. [2019-05-23 09:24:20,578 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:24:20,578 INFO L146 ILogger]: Start isEmpty. Operand 531 states and 531 transitions. [2019-05-23 09:24:20,580 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 531 [2019-05-23 09:24:20,580 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:20,580 INFO L146 ILogger]: trace histogram [88, 88, 88, 88, 88, 88, 1, 1] [2019-05-23 09:24:20,581 INFO L146 ILogger]: === Iteration 89 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:20,581 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:20,581 INFO L146 ILogger]: Analyzing trace with hash -958107203, now seen corresponding path program 88 times [2019-05-23 09:24:20,582 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:20,596 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:20,599 INFO L146 ILogger]: Trace formula consists of 709 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:24:20,602 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:23,510 INFO L146 ILogger]: Checked inductivity of 23056 backedges. 0 proven. 23056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:23,511 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:23,511 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:24:23,511 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:24:23,512 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:24:23,512 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:24:23,512 INFO L146 ILogger]: Start difference. First operand 531 states and 531 transitions. Second operand 91 states. [2019-05-23 09:24:24,023 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:24,024 INFO L146 ILogger]: Finished difference Result 542 states and 542 transitions. [2019-05-23 09:24:24,024 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:24:24,024 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 530 [2019-05-23 09:24:24,024 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:24,026 INFO L146 ILogger]: With dead ends: 542 [2019-05-23 09:24:24,026 INFO L146 ILogger]: Without dead ends: 542 [2019-05-23 09:24:24,027 INFO L146 ILogger]: 0 DeclaredPredicates, 529 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:24:24,027 INFO L146 ILogger]: Start minimizeSevpa. Operand 542 states. [2019-05-23 09:24:24,030 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 542 to 537. [2019-05-23 09:24:24,030 INFO L146 ILogger]: Start removeUnreachable. Operand 537 states. [2019-05-23 09:24:24,031 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 537 states to 537 states and 537 transitions. [2019-05-23 09:24:24,031 INFO L146 ILogger]: Start accepts. Automaton has 537 states and 537 transitions. Word has length 530 [2019-05-23 09:24:24,031 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:24,031 INFO L146 ILogger]: Abstraction has 537 states and 537 transitions. [2019-05-23 09:24:24,031 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:24:24,031 INFO L146 ILogger]: Start isEmpty. Operand 537 states and 537 transitions. [2019-05-23 09:24:24,033 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 537 [2019-05-23 09:24:24,033 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:24,034 INFO L146 ILogger]: trace histogram [89, 89, 89, 89, 89, 89, 1, 1] [2019-05-23 09:24:24,034 INFO L146 ILogger]: === Iteration 90 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:24,034 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:24,034 INFO L146 ILogger]: Analyzing trace with hash -108058246, now seen corresponding path program 89 times [2019-05-23 09:24:24,035 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:24,049 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:24,052 INFO L146 ILogger]: Trace formula consists of 717 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 09:24:24,055 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:27,053 INFO L146 ILogger]: Checked inductivity of 23585 backedges. 0 proven. 23585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:27,053 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:27,053 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:24:27,054 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:24:27,054 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:24:27,055 INFO L146 ILogger]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:24:27,055 INFO L146 ILogger]: Start difference. First operand 537 states and 537 transitions. Second operand 92 states. [2019-05-23 09:24:27,509 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:27,509 INFO L146 ILogger]: Finished difference Result 548 states and 548 transitions. [2019-05-23 09:24:27,509 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:24:27,509 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 536 [2019-05-23 09:24:27,510 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:27,512 INFO L146 ILogger]: With dead ends: 548 [2019-05-23 09:24:27,512 INFO L146 ILogger]: Without dead ends: 548 [2019-05-23 09:24:27,513 INFO L146 ILogger]: 0 DeclaredPredicates, 535 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:24:27,513 INFO L146 ILogger]: Start minimizeSevpa. Operand 548 states. [2019-05-23 09:24:27,516 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 548 to 543. [2019-05-23 09:24:27,516 INFO L146 ILogger]: Start removeUnreachable. Operand 543 states. [2019-05-23 09:24:27,516 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2019-05-23 09:24:27,516 INFO L146 ILogger]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 536 [2019-05-23 09:24:27,517 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:27,517 INFO L146 ILogger]: Abstraction has 543 states and 543 transitions. [2019-05-23 09:24:27,517 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:24:27,517 INFO L146 ILogger]: Start isEmpty. Operand 543 states and 543 transitions. [2019-05-23 09:24:27,519 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 543 [2019-05-23 09:24:27,519 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:27,519 INFO L146 ILogger]: trace histogram [90, 90, 90, 90, 90, 90, 1, 1] [2019-05-23 09:24:27,519 INFO L146 ILogger]: === Iteration 91 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:27,519 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:27,520 INFO L146 ILogger]: Analyzing trace with hash -1492230281, now seen corresponding path program 90 times [2019-05-23 09:24:27,520 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:27,535 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:27,538 INFO L146 ILogger]: Trace formula consists of 725 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:24:27,541 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:30,819 INFO L146 ILogger]: Checked inductivity of 24120 backedges. 0 proven. 24120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:30,819 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:30,820 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:24:30,820 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:24:30,820 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:24:30,821 INFO L146 ILogger]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:24:30,821 INFO L146 ILogger]: Start difference. First operand 543 states and 543 transitions. Second operand 93 states. [2019-05-23 09:24:31,275 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:31,275 INFO L146 ILogger]: Finished difference Result 554 states and 554 transitions. [2019-05-23 09:24:31,276 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:24:31,276 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 542 [2019-05-23 09:24:31,276 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:31,278 INFO L146 ILogger]: With dead ends: 554 [2019-05-23 09:24:31,278 INFO L146 ILogger]: Without dead ends: 554 [2019-05-23 09:24:31,278 INFO L146 ILogger]: 0 DeclaredPredicates, 541 GetRequests, 450 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:24:31,279 INFO L146 ILogger]: Start minimizeSevpa. Operand 554 states. [2019-05-23 09:24:31,282 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 554 to 549. [2019-05-23 09:24:31,282 INFO L146 ILogger]: Start removeUnreachable. Operand 549 states. [2019-05-23 09:24:31,282 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 549 states to 549 states and 549 transitions. [2019-05-23 09:24:31,282 INFO L146 ILogger]: Start accepts. Automaton has 549 states and 549 transitions. Word has length 542 [2019-05-23 09:24:31,282 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:31,283 INFO L146 ILogger]: Abstraction has 549 states and 549 transitions. [2019-05-23 09:24:31,283 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:24:31,283 INFO L146 ILogger]: Start isEmpty. Operand 549 states and 549 transitions. [2019-05-23 09:24:31,285 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 549 [2019-05-23 09:24:31,285 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:31,285 INFO L146 ILogger]: trace histogram [91, 91, 91, 91, 91, 91, 1, 1] [2019-05-23 09:24:31,285 INFO L146 ILogger]: === Iteration 92 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:31,285 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:31,286 INFO L146 ILogger]: Analyzing trace with hash -350592076, now seen corresponding path program 91 times [2019-05-23 09:24:31,286 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:31,301 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:31,305 INFO L146 ILogger]: Trace formula consists of 733 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:24:31,307 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:34,656 INFO L146 ILogger]: Checked inductivity of 24661 backedges. 0 proven. 24661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:34,656 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:34,656 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:24:34,657 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:24:34,657 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:24:34,657 INFO L146 ILogger]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:24:34,658 INFO L146 ILogger]: Start difference. First operand 549 states and 549 transitions. Second operand 94 states. [2019-05-23 09:24:35,128 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:35,129 INFO L146 ILogger]: Finished difference Result 560 states and 560 transitions. [2019-05-23 09:24:35,129 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:24:35,129 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 548 [2019-05-23 09:24:35,129 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:35,131 INFO L146 ILogger]: With dead ends: 560 [2019-05-23 09:24:35,131 INFO L146 ILogger]: Without dead ends: 560 [2019-05-23 09:24:35,132 INFO L146 ILogger]: 0 DeclaredPredicates, 547 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:24:35,133 INFO L146 ILogger]: Start minimizeSevpa. Operand 560 states. [2019-05-23 09:24:35,136 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 560 to 555. [2019-05-23 09:24:35,136 INFO L146 ILogger]: Start removeUnreachable. Operand 555 states. [2019-05-23 09:24:35,137 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 555 states to 555 states and 555 transitions. [2019-05-23 09:24:35,137 INFO L146 ILogger]: Start accepts. Automaton has 555 states and 555 transitions. Word has length 548 [2019-05-23 09:24:35,137 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:35,137 INFO L146 ILogger]: Abstraction has 555 states and 555 transitions. [2019-05-23 09:24:35,137 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:24:35,137 INFO L146 ILogger]: Start isEmpty. Operand 555 states and 555 transitions. [2019-05-23 09:24:35,139 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 555 [2019-05-23 09:24:35,140 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:35,140 INFO L146 ILogger]: trace histogram [92, 92, 92, 92, 92, 92, 1, 1] [2019-05-23 09:24:35,140 INFO L146 ILogger]: === Iteration 93 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:35,140 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:35,140 INFO L146 ILogger]: Analyzing trace with hash 703563313, now seen corresponding path program 92 times [2019-05-23 09:24:35,141 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:35,156 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:35,160 INFO L146 ILogger]: Trace formula consists of 741 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:24:35,163 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:38,750 INFO L146 ILogger]: Checked inductivity of 25208 backedges. 0 proven. 25208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:38,750 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:38,750 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:24:38,751 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:24:38,751 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:24:38,752 INFO L146 ILogger]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:38,752 INFO L146 ILogger]: Start difference. First operand 555 states and 555 transitions. Second operand 95 states. [2019-05-23 09:24:39,299 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:39,299 INFO L146 ILogger]: Finished difference Result 566 states and 566 transitions. [2019-05-23 09:24:39,300 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:24:39,300 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 554 [2019-05-23 09:24:39,300 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:39,303 INFO L146 ILogger]: With dead ends: 566 [2019-05-23 09:24:39,303 INFO L146 ILogger]: Without dead ends: 566 [2019-05-23 09:24:39,304 INFO L146 ILogger]: 0 DeclaredPredicates, 553 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:24:39,305 INFO L146 ILogger]: Start minimizeSevpa. Operand 566 states. [2019-05-23 09:24:39,309 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 566 to 561. [2019-05-23 09:24:39,309 INFO L146 ILogger]: Start removeUnreachable. Operand 561 states. [2019-05-23 09:24:39,309 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 561 states to 561 states and 561 transitions. [2019-05-23 09:24:39,309 INFO L146 ILogger]: Start accepts. Automaton has 561 states and 561 transitions. Word has length 554 [2019-05-23 09:24:39,309 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:39,310 INFO L146 ILogger]: Abstraction has 561 states and 561 transitions. [2019-05-23 09:24:39,310 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:24:39,310 INFO L146 ILogger]: Start isEmpty. Operand 561 states and 561 transitions. [2019-05-23 09:24:39,312 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 561 [2019-05-23 09:24:39,312 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:39,312 INFO L146 ILogger]: trace histogram [93, 93, 93, 93, 93, 93, 1, 1] [2019-05-23 09:24:39,312 INFO L146 ILogger]: === Iteration 94 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:39,312 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:39,312 INFO L146 ILogger]: Analyzing trace with hash -1655826706, now seen corresponding path program 93 times [2019-05-23 09:24:39,313 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:39,328 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:39,331 INFO L146 ILogger]: Trace formula consists of 749 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 09:24:39,334 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:42,550 INFO L146 ILogger]: Checked inductivity of 25761 backedges. 0 proven. 25761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:42,550 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:42,550 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:24:42,551 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:24:42,551 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:24:42,552 INFO L146 ILogger]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:24:42,552 INFO L146 ILogger]: Start difference. First operand 561 states and 561 transitions. Second operand 96 states. [2019-05-23 09:24:43,028 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:43,028 INFO L146 ILogger]: Finished difference Result 572 states and 572 transitions. [2019-05-23 09:24:43,028 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:24:43,029 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 560 [2019-05-23 09:24:43,029 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:43,032 INFO L146 ILogger]: With dead ends: 572 [2019-05-23 09:24:43,032 INFO L146 ILogger]: Without dead ends: 572 [2019-05-23 09:24:43,032 INFO L146 ILogger]: 0 DeclaredPredicates, 559 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:24:43,032 INFO L146 ILogger]: Start minimizeSevpa. Operand 572 states. [2019-05-23 09:24:43,035 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 572 to 567. [2019-05-23 09:24:43,035 INFO L146 ILogger]: Start removeUnreachable. Operand 567 states. [2019-05-23 09:24:43,036 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 567 states to 567 states and 567 transitions. [2019-05-23 09:24:43,036 INFO L146 ILogger]: Start accepts. Automaton has 567 states and 567 transitions. Word has length 560 [2019-05-23 09:24:43,036 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:43,036 INFO L146 ILogger]: Abstraction has 567 states and 567 transitions. [2019-05-23 09:24:43,036 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:24:43,037 INFO L146 ILogger]: Start isEmpty. Operand 567 states and 567 transitions. [2019-05-23 09:24:43,039 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 567 [2019-05-23 09:24:43,039 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:43,039 INFO L146 ILogger]: trace histogram [94, 94, 94, 94, 94, 94, 1, 1] [2019-05-23 09:24:43,039 INFO L146 ILogger]: === Iteration 95 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:43,039 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:43,039 INFO L146 ILogger]: Analyzing trace with hash 561669611, now seen corresponding path program 94 times [2019-05-23 09:24:43,040 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:43,055 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:43,058 INFO L146 ILogger]: Trace formula consists of 757 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:24:43,061 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:46,601 INFO L146 ILogger]: Checked inductivity of 26320 backedges. 0 proven. 26320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:46,602 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:46,602 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:24:46,602 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:24:46,603 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:24:46,603 INFO L146 ILogger]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:46,603 INFO L146 ILogger]: Start difference. First operand 567 states and 567 transitions. Second operand 97 states. [2019-05-23 09:24:47,108 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:47,108 INFO L146 ILogger]: Finished difference Result 578 states and 578 transitions. [2019-05-23 09:24:47,109 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:24:47,109 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 566 [2019-05-23 09:24:47,110 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:47,112 INFO L146 ILogger]: With dead ends: 578 [2019-05-23 09:24:47,112 INFO L146 ILogger]: Without dead ends: 578 [2019-05-23 09:24:47,113 INFO L146 ILogger]: 0 DeclaredPredicates, 565 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:24:47,113 INFO L146 ILogger]: Start minimizeSevpa. Operand 578 states. [2019-05-23 09:24:47,116 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 578 to 573. [2019-05-23 09:24:47,116 INFO L146 ILogger]: Start removeUnreachable. Operand 573 states. [2019-05-23 09:24:47,117 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 573 states to 573 states and 573 transitions. [2019-05-23 09:24:47,117 INFO L146 ILogger]: Start accepts. Automaton has 573 states and 573 transitions. Word has length 566 [2019-05-23 09:24:47,117 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:47,117 INFO L146 ILogger]: Abstraction has 573 states and 573 transitions. [2019-05-23 09:24:47,117 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:24:47,117 INFO L146 ILogger]: Start isEmpty. Operand 573 states and 573 transitions. [2019-05-23 09:24:47,119 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 573 [2019-05-23 09:24:47,120 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:47,120 INFO L146 ILogger]: trace histogram [95, 95, 95, 95, 95, 95, 1, 1] [2019-05-23 09:24:47,120 INFO L146 ILogger]: === Iteration 96 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:47,120 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:47,120 INFO L146 ILogger]: Analyzing trace with hash 1111278376, now seen corresponding path program 95 times [2019-05-23 09:24:47,121 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:47,137 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:47,140 INFO L146 ILogger]: Trace formula consists of 765 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 09:24:47,143 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:50,723 INFO L146 ILogger]: Checked inductivity of 26885 backedges. 0 proven. 26885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:50,723 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:50,723 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:24:50,724 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:24:50,724 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:24:50,725 INFO L146 ILogger]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:24:50,725 INFO L146 ILogger]: Start difference. First operand 573 states and 573 transitions. Second operand 98 states. [2019-05-23 09:24:51,219 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:51,220 INFO L146 ILogger]: Finished difference Result 584 states and 584 transitions. [2019-05-23 09:24:51,220 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:24:51,220 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 572 [2019-05-23 09:24:51,221 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:51,222 INFO L146 ILogger]: With dead ends: 584 [2019-05-23 09:24:51,222 INFO L146 ILogger]: Without dead ends: 584 [2019-05-23 09:24:51,223 INFO L146 ILogger]: 0 DeclaredPredicates, 571 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:24:51,223 INFO L146 ILogger]: Start minimizeSevpa. Operand 584 states. [2019-05-23 09:24:51,226 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 584 to 579. [2019-05-23 09:24:51,226 INFO L146 ILogger]: Start removeUnreachable. Operand 579 states. [2019-05-23 09:24:51,227 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 579 states to 579 states and 579 transitions. [2019-05-23 09:24:51,227 INFO L146 ILogger]: Start accepts. Automaton has 579 states and 579 transitions. Word has length 572 [2019-05-23 09:24:51,227 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:51,227 INFO L146 ILogger]: Abstraction has 579 states and 579 transitions. [2019-05-23 09:24:51,227 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:24:51,228 INFO L146 ILogger]: Start isEmpty. Operand 579 states and 579 transitions. [2019-05-23 09:24:51,230 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 579 [2019-05-23 09:24:51,230 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:51,230 INFO L146 ILogger]: trace histogram [96, 96, 96, 96, 96, 96, 1, 1] [2019-05-23 09:24:51,231 INFO L146 ILogger]: === Iteration 97 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:51,231 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:51,231 INFO L146 ILogger]: Analyzing trace with hash -2015265115, now seen corresponding path program 96 times [2019-05-23 09:24:51,231 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:51,251 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:51,255 INFO L146 ILogger]: Trace formula consists of 773 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:24:51,258 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:54,970 INFO L146 ILogger]: Checked inductivity of 27456 backedges. 0 proven. 27456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:54,971 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:54,971 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:24:54,971 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:24:54,972 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:24:54,972 INFO L146 ILogger]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:54,972 INFO L146 ILogger]: Start difference. First operand 579 states and 579 transitions. Second operand 99 states. [2019-05-23 09:24:55,491 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:55,491 INFO L146 ILogger]: Finished difference Result 590 states and 590 transitions. [2019-05-23 09:24:55,491 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:24:55,492 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 578 [2019-05-23 09:24:55,492 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:55,495 INFO L146 ILogger]: With dead ends: 590 [2019-05-23 09:24:55,495 INFO L146 ILogger]: Without dead ends: 590 [2019-05-23 09:24:55,496 INFO L146 ILogger]: 0 DeclaredPredicates, 577 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:24:55,497 INFO L146 ILogger]: Start minimizeSevpa. Operand 590 states. [2019-05-23 09:24:55,500 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 590 to 585. [2019-05-23 09:24:55,500 INFO L146 ILogger]: Start removeUnreachable. Operand 585 states. [2019-05-23 09:24:55,500 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 585 states to 585 states and 585 transitions. [2019-05-23 09:24:55,500 INFO L146 ILogger]: Start accepts. Automaton has 585 states and 585 transitions. Word has length 578 [2019-05-23 09:24:55,501 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:55,501 INFO L146 ILogger]: Abstraction has 585 states and 585 transitions. [2019-05-23 09:24:55,501 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:24:55,501 INFO L146 ILogger]: Start isEmpty. Operand 585 states and 585 transitions. [2019-05-23 09:24:55,503 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 585 [2019-05-23 09:24:55,503 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:55,504 INFO L146 ILogger]: trace histogram [97, 97, 97, 97, 97, 97, 1, 1] [2019-05-23 09:24:55,504 INFO L146 ILogger]: === Iteration 98 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:55,504 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:55,504 INFO L146 ILogger]: Analyzing trace with hash 70838370, now seen corresponding path program 97 times [2019-05-23 09:24:55,505 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:55,521 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:55,526 INFO L146 ILogger]: Trace formula consists of 781 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:24:55,530 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:24:59,035 INFO L146 ILogger]: Checked inductivity of 28033 backedges. 0 proven. 28033 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:24:59,035 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:24:59,035 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:24:59,036 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:24:59,036 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:24:59,036 INFO L146 ILogger]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:24:59,037 INFO L146 ILogger]: Start difference. First operand 585 states and 585 transitions. Second operand 100 states. [2019-05-23 09:24:59,576 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:24:59,576 INFO L146 ILogger]: Finished difference Result 596 states and 596 transitions. [2019-05-23 09:24:59,576 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:24:59,577 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 584 [2019-05-23 09:24:59,577 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:24:59,579 INFO L146 ILogger]: With dead ends: 596 [2019-05-23 09:24:59,579 INFO L146 ILogger]: Without dead ends: 596 [2019-05-23 09:24:59,580 INFO L146 ILogger]: 0 DeclaredPredicates, 583 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:24:59,580 INFO L146 ILogger]: Start minimizeSevpa. Operand 596 states. [2019-05-23 09:24:59,583 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 596 to 591. [2019-05-23 09:24:59,584 INFO L146 ILogger]: Start removeUnreachable. Operand 591 states. [2019-05-23 09:24:59,584 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2019-05-23 09:24:59,584 INFO L146 ILogger]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 584 [2019-05-23 09:24:59,584 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:24:59,584 INFO L146 ILogger]: Abstraction has 591 states and 591 transitions. [2019-05-23 09:24:59,585 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:24:59,585 INFO L146 ILogger]: Start isEmpty. Operand 591 states and 591 transitions. [2019-05-23 09:24:59,587 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 591 [2019-05-23 09:24:59,587 INFO L146 ILogger]: Found error trace [2019-05-23 09:24:59,587 INFO L146 ILogger]: trace histogram [98, 98, 98, 98, 98, 98, 1, 1] [2019-05-23 09:24:59,587 INFO L146 ILogger]: === Iteration 99 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:24:59,588 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:24:59,588 INFO L146 ILogger]: Analyzing trace with hash 530010207, now seen corresponding path program 98 times [2019-05-23 09:24:59,588 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:24:59,606 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:24:59,609 INFO L146 ILogger]: Trace formula consists of 789 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:24:59,612 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:03,229 INFO L146 ILogger]: Checked inductivity of 28616 backedges. 0 proven. 28616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:03,229 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:03,230 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:25:03,230 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:25:03,231 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:25:03,231 INFO L146 ILogger]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:25:03,231 INFO L146 ILogger]: Start difference. First operand 591 states and 591 transitions. Second operand 101 states. [2019-05-23 09:25:03,756 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:03,757 INFO L146 ILogger]: Finished difference Result 602 states and 602 transitions. [2019-05-23 09:25:03,757 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 09:25:03,757 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 590 [2019-05-23 09:25:03,757 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:03,760 INFO L146 ILogger]: With dead ends: 602 [2019-05-23 09:25:03,761 INFO L146 ILogger]: Without dead ends: 602 [2019-05-23 09:25:03,761 INFO L146 ILogger]: 0 DeclaredPredicates, 589 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:25:03,762 INFO L146 ILogger]: Start minimizeSevpa. Operand 602 states. [2019-05-23 09:25:03,766 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 602 to 597. [2019-05-23 09:25:03,766 INFO L146 ILogger]: Start removeUnreachable. Operand 597 states. [2019-05-23 09:25:03,767 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 597 states to 597 states and 597 transitions. [2019-05-23 09:25:03,767 INFO L146 ILogger]: Start accepts. Automaton has 597 states and 597 transitions. Word has length 590 [2019-05-23 09:25:03,767 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:03,767 INFO L146 ILogger]: Abstraction has 597 states and 597 transitions. [2019-05-23 09:25:03,768 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:25:03,768 INFO L146 ILogger]: Start isEmpty. Operand 597 states and 597 transitions. [2019-05-23 09:25:03,784 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 597 [2019-05-23 09:25:03,784 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:03,785 INFO L146 ILogger]: trace histogram [99, 99, 99, 99, 99, 99, 1, 1] [2019-05-23 09:25:03,785 INFO L146 ILogger]: === Iteration 100 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:03,785 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:03,785 INFO L146 ILogger]: Analyzing trace with hash -1512765796, now seen corresponding path program 99 times [2019-05-23 09:25:03,786 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:03,804 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:03,808 INFO L146 ILogger]: Trace formula consists of 797 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 09:25:03,811 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:07,736 INFO L146 ILogger]: Checked inductivity of 29205 backedges. 0 proven. 29205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:07,736 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:07,736 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:25:07,737 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:25:07,737 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:25:07,738 INFO L146 ILogger]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:25:07,738 INFO L146 ILogger]: Start difference. First operand 597 states and 597 transitions. Second operand 102 states. [2019-05-23 09:25:08,299 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:08,299 INFO L146 ILogger]: Finished difference Result 608 states and 608 transitions. [2019-05-23 09:25:08,299 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:25:08,300 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 596 [2019-05-23 09:25:08,300 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:08,303 INFO L146 ILogger]: With dead ends: 608 [2019-05-23 09:25:08,303 INFO L146 ILogger]: Without dead ends: 608 [2019-05-23 09:25:08,304 INFO L146 ILogger]: 0 DeclaredPredicates, 595 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:25:08,304 INFO L146 ILogger]: Start minimizeSevpa. Operand 608 states. [2019-05-23 09:25:08,308 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 608 to 603. [2019-05-23 09:25:08,309 INFO L146 ILogger]: Start removeUnreachable. Operand 603 states. [2019-05-23 09:25:08,309 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 603 states to 603 states and 603 transitions. [2019-05-23 09:25:08,309 INFO L146 ILogger]: Start accepts. Automaton has 603 states and 603 transitions. Word has length 596 [2019-05-23 09:25:08,310 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:08,310 INFO L146 ILogger]: Abstraction has 603 states and 603 transitions. [2019-05-23 09:25:08,310 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:25:08,310 INFO L146 ILogger]: Start isEmpty. Operand 603 states and 603 transitions. [2019-05-23 09:25:08,313 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 603 [2019-05-23 09:25:08,313 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:08,313 INFO L146 ILogger]: trace histogram [100, 100, 100, 100, 100, 100, 1, 1] [2019-05-23 09:25:08,314 INFO L146 ILogger]: === Iteration 101 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:08,314 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:08,314 INFO L146 ILogger]: Analyzing trace with hash 323902233, now seen corresponding path program 100 times [2019-05-23 09:25:08,314 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:08,338 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:08,343 INFO L146 ILogger]: Trace formula consists of 805 conjuncts, 102 conjunts are in the unsatisfiable core [2019-05-23 09:25:08,347 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:12,319 INFO L146 ILogger]: Checked inductivity of 29800 backedges. 0 proven. 29800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:12,319 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:12,319 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:25:12,320 INFO L146 ILogger]: Interpolant automaton has 103 states [2019-05-23 09:25:12,320 INFO L146 ILogger]: Constructing interpolant automaton starting with 103 interpolants. [2019-05-23 09:25:12,321 INFO L146 ILogger]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:25:12,321 INFO L146 ILogger]: Start difference. First operand 603 states and 603 transitions. Second operand 103 states. [2019-05-23 09:25:12,861 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:12,862 INFO L146 ILogger]: Finished difference Result 614 states and 614 transitions. [2019-05-23 09:25:12,862 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-05-23 09:25:12,862 INFO L146 ILogger]: Start accepts. Automaton has 103 states. Word has length 602 [2019-05-23 09:25:12,863 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:12,865 INFO L146 ILogger]: With dead ends: 614 [2019-05-23 09:25:12,866 INFO L146 ILogger]: Without dead ends: 614 [2019-05-23 09:25:12,867 INFO L146 ILogger]: 0 DeclaredPredicates, 601 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-05-23 09:25:12,867 INFO L146 ILogger]: Start minimizeSevpa. Operand 614 states. [2019-05-23 09:25:12,871 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 614 to 609. [2019-05-23 09:25:12,871 INFO L146 ILogger]: Start removeUnreachable. Operand 609 states. [2019-05-23 09:25:12,872 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 609 states to 609 states and 609 transitions. [2019-05-23 09:25:12,872 INFO L146 ILogger]: Start accepts. Automaton has 609 states and 609 transitions. Word has length 602 [2019-05-23 09:25:12,873 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:12,873 INFO L146 ILogger]: Abstraction has 609 states and 609 transitions. [2019-05-23 09:25:12,873 INFO L146 ILogger]: Interpolant automaton has 103 states. [2019-05-23 09:25:12,873 INFO L146 ILogger]: Start isEmpty. Operand 609 states and 609 transitions. [2019-05-23 09:25:12,876 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 609 [2019-05-23 09:25:12,876 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:12,877 INFO L146 ILogger]: trace histogram [101, 101, 101, 101, 101, 101, 1, 1] [2019-05-23 09:25:12,877 INFO L146 ILogger]: === Iteration 102 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:12,877 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:12,877 INFO L146 ILogger]: Analyzing trace with hash 568565206, now seen corresponding path program 101 times [2019-05-23 09:25:12,878 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:12,902 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:12,907 INFO L146 ILogger]: Trace formula consists of 813 conjuncts, 103 conjunts are in the unsatisfiable core [2019-05-23 09:25:12,933 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:17,031 INFO L146 ILogger]: Checked inductivity of 30401 backedges. 0 proven. 30401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:17,031 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:17,031 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-05-23 09:25:17,032 INFO L146 ILogger]: Interpolant automaton has 104 states [2019-05-23 09:25:17,033 INFO L146 ILogger]: Constructing interpolant automaton starting with 104 interpolants. [2019-05-23 09:25:17,033 INFO L146 ILogger]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:25:17,033 INFO L146 ILogger]: Start difference. First operand 609 states and 609 transitions. Second operand 104 states. [2019-05-23 09:25:17,558 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:17,558 INFO L146 ILogger]: Finished difference Result 620 states and 620 transitions. [2019-05-23 09:25:17,558 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-05-23 09:25:17,559 INFO L146 ILogger]: Start accepts. Automaton has 104 states. Word has length 608 [2019-05-23 09:25:17,559 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:17,560 INFO L146 ILogger]: With dead ends: 620 [2019-05-23 09:25:17,560 INFO L146 ILogger]: Without dead ends: 620 [2019-05-23 09:25:17,561 INFO L146 ILogger]: 0 DeclaredPredicates, 607 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-05-23 09:25:17,562 INFO L146 ILogger]: Start minimizeSevpa. Operand 620 states. [2019-05-23 09:25:17,566 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 620 to 615. [2019-05-23 09:25:17,566 INFO L146 ILogger]: Start removeUnreachable. Operand 615 states. [2019-05-23 09:25:17,566 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 615 states to 615 states and 615 transitions. [2019-05-23 09:25:17,567 INFO L146 ILogger]: Start accepts. Automaton has 615 states and 615 transitions. Word has length 608 [2019-05-23 09:25:17,567 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:17,567 INFO L146 ILogger]: Abstraction has 615 states and 615 transitions. [2019-05-23 09:25:17,567 INFO L146 ILogger]: Interpolant automaton has 104 states. [2019-05-23 09:25:17,567 INFO L146 ILogger]: Start isEmpty. Operand 615 states and 615 transitions. [2019-05-23 09:25:17,570 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 615 [2019-05-23 09:25:17,570 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:17,571 INFO L146 ILogger]: trace histogram [102, 102, 102, 102, 102, 102, 1, 1] [2019-05-23 09:25:17,571 INFO L146 ILogger]: === Iteration 103 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:17,571 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:17,571 INFO L146 ILogger]: Analyzing trace with hash -1778835757, now seen corresponding path program 102 times [2019-05-23 09:25:17,572 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:17,589 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:17,594 INFO L146 ILogger]: Trace formula consists of 821 conjuncts, 104 conjunts are in the unsatisfiable core [2019-05-23 09:25:17,598 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:21,639 INFO L146 ILogger]: Checked inductivity of 31008 backedges. 0 proven. 31008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:21,639 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:21,639 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-05-23 09:25:21,640 INFO L146 ILogger]: Interpolant automaton has 105 states [2019-05-23 09:25:21,640 INFO L146 ILogger]: Constructing interpolant automaton starting with 105 interpolants. [2019-05-23 09:25:21,641 INFO L146 ILogger]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:25:21,641 INFO L146 ILogger]: Start difference. First operand 615 states and 615 transitions. Second operand 105 states. [2019-05-23 09:25:22,171 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:22,172 INFO L146 ILogger]: Finished difference Result 626 states and 626 transitions. [2019-05-23 09:25:22,172 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-05-23 09:25:22,172 INFO L146 ILogger]: Start accepts. Automaton has 105 states. Word has length 614 [2019-05-23 09:25:22,173 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:22,174 INFO L146 ILogger]: With dead ends: 626 [2019-05-23 09:25:22,174 INFO L146 ILogger]: Without dead ends: 626 [2019-05-23 09:25:22,174 INFO L146 ILogger]: 0 DeclaredPredicates, 613 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-05-23 09:25:22,175 INFO L146 ILogger]: Start minimizeSevpa. Operand 626 states. [2019-05-23 09:25:22,178 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 626 to 621. [2019-05-23 09:25:22,179 INFO L146 ILogger]: Start removeUnreachable. Operand 621 states. [2019-05-23 09:25:22,179 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 621 states to 621 states and 621 transitions. [2019-05-23 09:25:22,180 INFO L146 ILogger]: Start accepts. Automaton has 621 states and 621 transitions. Word has length 614 [2019-05-23 09:25:22,180 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:22,180 INFO L146 ILogger]: Abstraction has 621 states and 621 transitions. [2019-05-23 09:25:22,180 INFO L146 ILogger]: Interpolant automaton has 105 states. [2019-05-23 09:25:22,180 INFO L146 ILogger]: Start isEmpty. Operand 621 states and 621 transitions. [2019-05-23 09:25:22,183 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 621 [2019-05-23 09:25:22,184 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:22,184 INFO L146 ILogger]: trace histogram [103, 103, 103, 103, 103, 103, 1, 1] [2019-05-23 09:25:22,184 INFO L146 ILogger]: === Iteration 104 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:22,184 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:22,185 INFO L146 ILogger]: Analyzing trace with hash 1266101776, now seen corresponding path program 103 times [2019-05-23 09:25:22,185 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:22,212 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:22,217 INFO L146 ILogger]: Trace formula consists of 829 conjuncts, 105 conjunts are in the unsatisfiable core [2019-05-23 09:25:22,221 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:26,400 INFO L146 ILogger]: Checked inductivity of 31621 backedges. 0 proven. 31621 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:26,400 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:26,400 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-05-23 09:25:26,401 INFO L146 ILogger]: Interpolant automaton has 106 states [2019-05-23 09:25:26,401 INFO L146 ILogger]: Constructing interpolant automaton starting with 106 interpolants. [2019-05-23 09:25:26,402 INFO L146 ILogger]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:25:26,402 INFO L146 ILogger]: Start difference. First operand 621 states and 621 transitions. Second operand 106 states. [2019-05-23 09:25:26,933 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:26,934 INFO L146 ILogger]: Finished difference Result 632 states and 632 transitions. [2019-05-23 09:25:26,934 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-05-23 09:25:26,934 INFO L146 ILogger]: Start accepts. Automaton has 106 states. Word has length 620 [2019-05-23 09:25:26,935 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:26,936 INFO L146 ILogger]: With dead ends: 632 [2019-05-23 09:25:26,936 INFO L146 ILogger]: Without dead ends: 632 [2019-05-23 09:25:26,937 INFO L146 ILogger]: 0 DeclaredPredicates, 619 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-05-23 09:25:26,937 INFO L146 ILogger]: Start minimizeSevpa. Operand 632 states. [2019-05-23 09:25:26,941 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 632 to 627. [2019-05-23 09:25:26,941 INFO L146 ILogger]: Start removeUnreachable. Operand 627 states. [2019-05-23 09:25:26,941 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 627 states to 627 states and 627 transitions. [2019-05-23 09:25:26,942 INFO L146 ILogger]: Start accepts. Automaton has 627 states and 627 transitions. Word has length 620 [2019-05-23 09:25:26,942 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:26,942 INFO L146 ILogger]: Abstraction has 627 states and 627 transitions. [2019-05-23 09:25:26,942 INFO L146 ILogger]: Interpolant automaton has 106 states. [2019-05-23 09:25:26,942 INFO L146 ILogger]: Start isEmpty. Operand 627 states and 627 transitions. [2019-05-23 09:25:26,945 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 627 [2019-05-23 09:25:26,945 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:26,946 INFO L146 ILogger]: trace histogram [104, 104, 104, 104, 104, 104, 1, 1] [2019-05-23 09:25:26,946 INFO L146 ILogger]: === Iteration 105 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:26,946 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:26,946 INFO L146 ILogger]: Analyzing trace with hash -2100683891, now seen corresponding path program 104 times [2019-05-23 09:25:26,947 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:26,968 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:26,973 INFO L146 ILogger]: Trace formula consists of 837 conjuncts, 106 conjunts are in the unsatisfiable core [2019-05-23 09:25:26,976 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:31,126 INFO L146 ILogger]: Checked inductivity of 32240 backedges. 0 proven. 32240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:31,126 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:31,126 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-05-23 09:25:31,127 INFO L146 ILogger]: Interpolant automaton has 107 states [2019-05-23 09:25:31,127 INFO L146 ILogger]: Constructing interpolant automaton starting with 107 interpolants. [2019-05-23 09:25:31,128 INFO L146 ILogger]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:25:31,128 INFO L146 ILogger]: Start difference. First operand 627 states and 627 transitions. Second operand 107 states. [2019-05-23 09:25:31,666 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:31,666 INFO L146 ILogger]: Finished difference Result 638 states and 638 transitions. [2019-05-23 09:25:31,667 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-05-23 09:25:31,667 INFO L146 ILogger]: Start accepts. Automaton has 107 states. Word has length 626 [2019-05-23 09:25:31,668 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:31,669 INFO L146 ILogger]: With dead ends: 638 [2019-05-23 09:25:31,669 INFO L146 ILogger]: Without dead ends: 638 [2019-05-23 09:25:31,669 INFO L146 ILogger]: 0 DeclaredPredicates, 625 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-05-23 09:25:31,670 INFO L146 ILogger]: Start minimizeSevpa. Operand 638 states. [2019-05-23 09:25:31,673 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 638 to 633. [2019-05-23 09:25:31,673 INFO L146 ILogger]: Start removeUnreachable. Operand 633 states. [2019-05-23 09:25:31,673 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 633 states to 633 states and 633 transitions. [2019-05-23 09:25:31,673 INFO L146 ILogger]: Start accepts. Automaton has 633 states and 633 transitions. Word has length 626 [2019-05-23 09:25:31,674 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:31,674 INFO L146 ILogger]: Abstraction has 633 states and 633 transitions. [2019-05-23 09:25:31,674 INFO L146 ILogger]: Interpolant automaton has 107 states. [2019-05-23 09:25:31,674 INFO L146 ILogger]: Start isEmpty. Operand 633 states and 633 transitions. [2019-05-23 09:25:31,676 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 633 [2019-05-23 09:25:31,676 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:31,676 INFO L146 ILogger]: trace histogram [105, 105, 105, 105, 105, 105, 1, 1] [2019-05-23 09:25:31,677 INFO L146 ILogger]: === Iteration 106 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:31,677 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:31,677 INFO L146 ILogger]: Analyzing trace with hash 1843541834, now seen corresponding path program 105 times [2019-05-23 09:25:31,677 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:31,695 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:31,698 INFO L146 ILogger]: Trace formula consists of 845 conjuncts, 107 conjunts are in the unsatisfiable core [2019-05-23 09:25:31,700 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:35,992 INFO L146 ILogger]: Checked inductivity of 32865 backedges. 0 proven. 32865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:35,992 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:35,992 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-05-23 09:25:35,993 INFO L146 ILogger]: Interpolant automaton has 108 states [2019-05-23 09:25:35,993 INFO L146 ILogger]: Constructing interpolant automaton starting with 108 interpolants. [2019-05-23 09:25:35,994 INFO L146 ILogger]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:25:35,994 INFO L146 ILogger]: Start difference. First operand 633 states and 633 transitions. Second operand 108 states. [2019-05-23 09:25:36,535 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:36,536 INFO L146 ILogger]: Finished difference Result 644 states and 644 transitions. [2019-05-23 09:25:36,536 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-05-23 09:25:36,536 INFO L146 ILogger]: Start accepts. Automaton has 108 states. Word has length 632 [2019-05-23 09:25:36,537 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:36,538 INFO L146 ILogger]: With dead ends: 644 [2019-05-23 09:25:36,538 INFO L146 ILogger]: Without dead ends: 644 [2019-05-23 09:25:36,538 INFO L146 ILogger]: 0 DeclaredPredicates, 631 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-05-23 09:25:36,538 INFO L146 ILogger]: Start minimizeSevpa. Operand 644 states. [2019-05-23 09:25:36,541 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 644 to 639. [2019-05-23 09:25:36,541 INFO L146 ILogger]: Start removeUnreachable. Operand 639 states. [2019-05-23 09:25:36,541 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 639 states to 639 states and 639 transitions. [2019-05-23 09:25:36,541 INFO L146 ILogger]: Start accepts. Automaton has 639 states and 639 transitions. Word has length 632 [2019-05-23 09:25:36,542 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:36,542 INFO L146 ILogger]: Abstraction has 639 states and 639 transitions. [2019-05-23 09:25:36,542 INFO L146 ILogger]: Interpolant automaton has 108 states. [2019-05-23 09:25:36,542 INFO L146 ILogger]: Start isEmpty. Operand 639 states and 639 transitions. [2019-05-23 09:25:36,544 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 639 [2019-05-23 09:25:36,544 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:36,544 INFO L146 ILogger]: trace histogram [106, 106, 106, 106, 106, 106, 1, 1] [2019-05-23 09:25:36,544 INFO L146 ILogger]: === Iteration 107 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:36,545 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:36,545 INFO L146 ILogger]: Analyzing trace with hash -46935737, now seen corresponding path program 106 times [2019-05-23 09:25:36,545 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:36,563 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:36,567 INFO L146 ILogger]: Trace formula consists of 853 conjuncts, 108 conjunts are in the unsatisfiable core [2019-05-23 09:25:36,570 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:40,642 INFO L146 ILogger]: Checked inductivity of 33496 backedges. 0 proven. 33496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:40,642 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:40,642 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-05-23 09:25:40,643 INFO L146 ILogger]: Interpolant automaton has 109 states [2019-05-23 09:25:40,643 INFO L146 ILogger]: Constructing interpolant automaton starting with 109 interpolants. [2019-05-23 09:25:40,644 INFO L146 ILogger]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:25:40,644 INFO L146 ILogger]: Start difference. First operand 639 states and 639 transitions. Second operand 109 states. [2019-05-23 09:25:41,249 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:41,249 INFO L146 ILogger]: Finished difference Result 650 states and 650 transitions. [2019-05-23 09:25:41,250 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-05-23 09:25:41,250 INFO L146 ILogger]: Start accepts. Automaton has 109 states. Word has length 638 [2019-05-23 09:25:41,250 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:41,251 INFO L146 ILogger]: With dead ends: 650 [2019-05-23 09:25:41,251 INFO L146 ILogger]: Without dead ends: 650 [2019-05-23 09:25:41,252 INFO L146 ILogger]: 0 DeclaredPredicates, 637 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-05-23 09:25:41,252 INFO L146 ILogger]: Start minimizeSevpa. Operand 650 states. [2019-05-23 09:25:41,254 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 650 to 645. [2019-05-23 09:25:41,254 INFO L146 ILogger]: Start removeUnreachable. Operand 645 states. [2019-05-23 09:25:41,255 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 645 states to 645 states and 645 transitions. [2019-05-23 09:25:41,255 INFO L146 ILogger]: Start accepts. Automaton has 645 states and 645 transitions. Word has length 638 [2019-05-23 09:25:41,255 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:41,255 INFO L146 ILogger]: Abstraction has 645 states and 645 transitions. [2019-05-23 09:25:41,255 INFO L146 ILogger]: Interpolant automaton has 109 states. [2019-05-23 09:25:41,255 INFO L146 ILogger]: Start isEmpty. Operand 645 states and 645 transitions. [2019-05-23 09:25:41,258 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 645 [2019-05-23 09:25:41,258 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:41,258 INFO L146 ILogger]: trace histogram [107, 107, 107, 107, 107, 107, 1, 1] [2019-05-23 09:25:41,258 INFO L146 ILogger]: === Iteration 108 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:41,258 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:41,258 INFO L146 ILogger]: Analyzing trace with hash -323536508, now seen corresponding path program 107 times [2019-05-23 09:25:41,259 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:41,277 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:41,280 INFO L146 ILogger]: Trace formula consists of 861 conjuncts, 109 conjunts are in the unsatisfiable core [2019-05-23 09:25:41,283 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:45,519 INFO L146 ILogger]: Checked inductivity of 34133 backedges. 0 proven. 34133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:45,520 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:45,520 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-05-23 09:25:45,520 INFO L146 ILogger]: Interpolant automaton has 110 states [2019-05-23 09:25:45,521 INFO L146 ILogger]: Constructing interpolant automaton starting with 110 interpolants. [2019-05-23 09:25:45,521 INFO L146 ILogger]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:25:45,521 INFO L146 ILogger]: Start difference. First operand 645 states and 645 transitions. Second operand 110 states. [2019-05-23 09:25:46,147 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:46,148 INFO L146 ILogger]: Finished difference Result 656 states and 656 transitions. [2019-05-23 09:25:46,148 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-05-23 09:25:46,148 INFO L146 ILogger]: Start accepts. Automaton has 110 states. Word has length 644 [2019-05-23 09:25:46,149 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:46,149 INFO L146 ILogger]: With dead ends: 656 [2019-05-23 09:25:46,150 INFO L146 ILogger]: Without dead ends: 656 [2019-05-23 09:25:46,150 INFO L146 ILogger]: 0 DeclaredPredicates, 643 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-05-23 09:25:46,150 INFO L146 ILogger]: Start minimizeSevpa. Operand 656 states. [2019-05-23 09:25:46,153 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 656 to 651. [2019-05-23 09:25:46,153 INFO L146 ILogger]: Start removeUnreachable. Operand 651 states. [2019-05-23 09:25:46,153 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 651 states to 651 states and 651 transitions. [2019-05-23 09:25:46,153 INFO L146 ILogger]: Start accepts. Automaton has 651 states and 651 transitions. Word has length 644 [2019-05-23 09:25:46,154 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:46,154 INFO L146 ILogger]: Abstraction has 651 states and 651 transitions. [2019-05-23 09:25:46,154 INFO L146 ILogger]: Interpolant automaton has 110 states. [2019-05-23 09:25:46,154 INFO L146 ILogger]: Start isEmpty. Operand 651 states and 651 transitions. [2019-05-23 09:25:46,156 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 651 [2019-05-23 09:25:46,156 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:46,156 INFO L146 ILogger]: trace histogram [108, 108, 108, 108, 108, 108, 1, 1] [2019-05-23 09:25:46,157 INFO L146 ILogger]: === Iteration 109 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:46,157 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:46,157 INFO L146 ILogger]: Analyzing trace with hash 283688961, now seen corresponding path program 108 times [2019-05-23 09:25:46,157 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:46,175 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:46,180 INFO L146 ILogger]: Trace formula consists of 869 conjuncts, 110 conjunts are in the unsatisfiable core [2019-05-23 09:25:46,182 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:50,495 INFO L146 ILogger]: Checked inductivity of 34776 backedges. 0 proven. 34776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:50,495 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:50,496 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-05-23 09:25:50,496 INFO L146 ILogger]: Interpolant automaton has 111 states [2019-05-23 09:25:50,497 INFO L146 ILogger]: Constructing interpolant automaton starting with 111 interpolants. [2019-05-23 09:25:50,497 INFO L146 ILogger]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:25:50,497 INFO L146 ILogger]: Start difference. First operand 651 states and 651 transitions. Second operand 111 states. [2019-05-23 09:25:51,158 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:51,158 INFO L146 ILogger]: Finished difference Result 662 states and 662 transitions. [2019-05-23 09:25:51,159 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-05-23 09:25:51,159 INFO L146 ILogger]: Start accepts. Automaton has 111 states. Word has length 650 [2019-05-23 09:25:51,159 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:51,160 INFO L146 ILogger]: With dead ends: 662 [2019-05-23 09:25:51,160 INFO L146 ILogger]: Without dead ends: 662 [2019-05-23 09:25:51,161 INFO L146 ILogger]: 0 DeclaredPredicates, 649 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-05-23 09:25:51,161 INFO L146 ILogger]: Start minimizeSevpa. Operand 662 states. [2019-05-23 09:25:51,164 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 662 to 657. [2019-05-23 09:25:51,165 INFO L146 ILogger]: Start removeUnreachable. Operand 657 states. [2019-05-23 09:25:51,165 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 657 states to 657 states and 657 transitions. [2019-05-23 09:25:51,165 INFO L146 ILogger]: Start accepts. Automaton has 657 states and 657 transitions. Word has length 650 [2019-05-23 09:25:51,165 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:51,166 INFO L146 ILogger]: Abstraction has 657 states and 657 transitions. [2019-05-23 09:25:51,166 INFO L146 ILogger]: Interpolant automaton has 111 states. [2019-05-23 09:25:51,166 INFO L146 ILogger]: Start isEmpty. Operand 657 states and 657 transitions. [2019-05-23 09:25:51,168 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 657 [2019-05-23 09:25:51,168 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:51,168 INFO L146 ILogger]: trace histogram [109, 109, 109, 109, 109, 109, 1, 1] [2019-05-23 09:25:51,168 INFO L146 ILogger]: === Iteration 110 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:51,169 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:51,169 INFO L146 ILogger]: Analyzing trace with hash -473385794, now seen corresponding path program 109 times [2019-05-23 09:25:51,169 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:51,187 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:51,192 INFO L146 ILogger]: Trace formula consists of 877 conjuncts, 111 conjunts are in the unsatisfiable core [2019-05-23 09:25:51,194 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:25:55,502 INFO L146 ILogger]: Checked inductivity of 35425 backedges. 0 proven. 35425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:25:55,502 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:25:55,502 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-05-23 09:25:55,503 INFO L146 ILogger]: Interpolant automaton has 112 states [2019-05-23 09:25:55,503 INFO L146 ILogger]: Constructing interpolant automaton starting with 112 interpolants. [2019-05-23 09:25:55,504 INFO L146 ILogger]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:25:55,504 INFO L146 ILogger]: Start difference. First operand 657 states and 657 transitions. Second operand 112 states. [2019-05-23 09:25:56,145 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:25:56,145 INFO L146 ILogger]: Finished difference Result 668 states and 668 transitions. [2019-05-23 09:25:56,146 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-05-23 09:25:56,146 INFO L146 ILogger]: Start accepts. Automaton has 112 states. Word has length 656 [2019-05-23 09:25:56,146 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:25:56,147 INFO L146 ILogger]: With dead ends: 668 [2019-05-23 09:25:56,147 INFO L146 ILogger]: Without dead ends: 668 [2019-05-23 09:25:56,148 INFO L146 ILogger]: 0 DeclaredPredicates, 655 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-05-23 09:25:56,148 INFO L146 ILogger]: Start minimizeSevpa. Operand 668 states. [2019-05-23 09:25:56,151 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 668 to 663. [2019-05-23 09:25:56,151 INFO L146 ILogger]: Start removeUnreachable. Operand 663 states. [2019-05-23 09:25:56,152 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 663 states to 663 states and 663 transitions. [2019-05-23 09:25:56,152 INFO L146 ILogger]: Start accepts. Automaton has 663 states and 663 transitions. Word has length 656 [2019-05-23 09:25:56,152 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:25:56,152 INFO L146 ILogger]: Abstraction has 663 states and 663 transitions. [2019-05-23 09:25:56,152 INFO L146 ILogger]: Interpolant automaton has 112 states. [2019-05-23 09:25:56,152 INFO L146 ILogger]: Start isEmpty. Operand 663 states and 663 transitions. [2019-05-23 09:25:56,155 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 663 [2019-05-23 09:25:56,155 INFO L146 ILogger]: Found error trace [2019-05-23 09:25:56,155 INFO L146 ILogger]: trace histogram [110, 110, 110, 110, 110, 110, 1, 1] [2019-05-23 09:25:56,155 INFO L146 ILogger]: === Iteration 111 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:25:56,155 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:25:56,156 INFO L146 ILogger]: Analyzing trace with hash 1373333435, now seen corresponding path program 110 times [2019-05-23 09:25:56,156 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:25:56,174 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:25:56,179 INFO L146 ILogger]: Trace formula consists of 885 conjuncts, 112 conjunts are in the unsatisfiable core [2019-05-23 09:25:56,182 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:00,577 INFO L146 ILogger]: Checked inductivity of 36080 backedges. 0 proven. 36080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:00,577 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:00,578 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-05-23 09:26:00,578 INFO L146 ILogger]: Interpolant automaton has 113 states [2019-05-23 09:26:00,579 INFO L146 ILogger]: Constructing interpolant automaton starting with 113 interpolants. [2019-05-23 09:26:00,579 INFO L146 ILogger]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:26:00,579 INFO L146 ILogger]: Start difference. First operand 663 states and 663 transitions. Second operand 113 states. [2019-05-23 09:26:01,221 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:01,221 INFO L146 ILogger]: Finished difference Result 674 states and 674 transitions. [2019-05-23 09:26:01,221 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-05-23 09:26:01,221 INFO L146 ILogger]: Start accepts. Automaton has 113 states. Word has length 662 [2019-05-23 09:26:01,222 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:01,222 INFO L146 ILogger]: With dead ends: 674 [2019-05-23 09:26:01,223 INFO L146 ILogger]: Without dead ends: 674 [2019-05-23 09:26:01,223 INFO L146 ILogger]: 0 DeclaredPredicates, 661 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-05-23 09:26:01,224 INFO L146 ILogger]: Start minimizeSevpa. Operand 674 states. [2019-05-23 09:26:01,227 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 674 to 669. [2019-05-23 09:26:01,227 INFO L146 ILogger]: Start removeUnreachable. Operand 669 states. [2019-05-23 09:26:01,227 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 669 states to 669 states and 669 transitions. [2019-05-23 09:26:01,227 INFO L146 ILogger]: Start accepts. Automaton has 669 states and 669 transitions. Word has length 662 [2019-05-23 09:26:01,228 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:01,228 INFO L146 ILogger]: Abstraction has 669 states and 669 transitions. [2019-05-23 09:26:01,228 INFO L146 ILogger]: Interpolant automaton has 113 states. [2019-05-23 09:26:01,228 INFO L146 ILogger]: Start isEmpty. Operand 669 states and 669 transitions. [2019-05-23 09:26:01,230 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 669 [2019-05-23 09:26:01,230 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:01,231 INFO L146 ILogger]: trace histogram [111, 111, 111, 111, 111, 111, 1, 1] [2019-05-23 09:26:01,231 INFO L146 ILogger]: === Iteration 112 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:01,231 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:01,231 INFO L146 ILogger]: Analyzing trace with hash -953603848, now seen corresponding path program 111 times [2019-05-23 09:26:01,232 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:01,250 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:01,254 INFO L146 ILogger]: Trace formula consists of 893 conjuncts, 113 conjunts are in the unsatisfiable core [2019-05-23 09:26:01,256 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:05,759 INFO L146 ILogger]: Checked inductivity of 36741 backedges. 0 proven. 36741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:05,759 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:05,759 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-05-23 09:26:05,760 INFO L146 ILogger]: Interpolant automaton has 114 states [2019-05-23 09:26:05,760 INFO L146 ILogger]: Constructing interpolant automaton starting with 114 interpolants. [2019-05-23 09:26:05,761 INFO L146 ILogger]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:26:05,761 INFO L146 ILogger]: Start difference. First operand 669 states and 669 transitions. Second operand 114 states. [2019-05-23 09:26:06,428 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:06,429 INFO L146 ILogger]: Finished difference Result 680 states and 680 transitions. [2019-05-23 09:26:06,429 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-05-23 09:26:06,429 INFO L146 ILogger]: Start accepts. Automaton has 114 states. Word has length 668 [2019-05-23 09:26:06,430 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:06,431 INFO L146 ILogger]: With dead ends: 680 [2019-05-23 09:26:06,431 INFO L146 ILogger]: Without dead ends: 680 [2019-05-23 09:26:06,432 INFO L146 ILogger]: 0 DeclaredPredicates, 667 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-05-23 09:26:06,432 INFO L146 ILogger]: Start minimizeSevpa. Operand 680 states. [2019-05-23 09:26:06,434 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 680 to 675. [2019-05-23 09:26:06,435 INFO L146 ILogger]: Start removeUnreachable. Operand 675 states. [2019-05-23 09:26:06,435 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2019-05-23 09:26:06,435 INFO L146 ILogger]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 668 [2019-05-23 09:26:06,435 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:06,436 INFO L146 ILogger]: Abstraction has 675 states and 675 transitions. [2019-05-23 09:26:06,436 INFO L146 ILogger]: Interpolant automaton has 114 states. [2019-05-23 09:26:06,436 INFO L146 ILogger]: Start isEmpty. Operand 675 states and 675 transitions. [2019-05-23 09:26:06,438 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 675 [2019-05-23 09:26:06,438 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:06,438 INFO L146 ILogger]: trace histogram [112, 112, 112, 112, 112, 112, 1, 1] [2019-05-23 09:26:06,438 INFO L146 ILogger]: === Iteration 113 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:06,439 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:06,439 INFO L146 ILogger]: Analyzing trace with hash 2084456565, now seen corresponding path program 112 times [2019-05-23 09:26:06,439 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:06,457 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:06,461 INFO L146 ILogger]: Trace formula consists of 901 conjuncts, 114 conjunts are in the unsatisfiable core [2019-05-23 09:26:06,463 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:10,991 INFO L146 ILogger]: Checked inductivity of 37408 backedges. 0 proven. 37408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:10,992 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:10,992 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-05-23 09:26:10,992 INFO L146 ILogger]: Interpolant automaton has 115 states [2019-05-23 09:26:10,993 INFO L146 ILogger]: Constructing interpolant automaton starting with 115 interpolants. [2019-05-23 09:26:10,993 INFO L146 ILogger]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:26:10,994 INFO L146 ILogger]: Start difference. First operand 675 states and 675 transitions. Second operand 115 states. [2019-05-23 09:26:11,714 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:11,714 INFO L146 ILogger]: Finished difference Result 686 states and 686 transitions. [2019-05-23 09:26:11,715 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-05-23 09:26:11,715 INFO L146 ILogger]: Start accepts. Automaton has 115 states. Word has length 674 [2019-05-23 09:26:11,716 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:11,717 INFO L146 ILogger]: With dead ends: 686 [2019-05-23 09:26:11,717 INFO L146 ILogger]: Without dead ends: 686 [2019-05-23 09:26:11,718 INFO L146 ILogger]: 0 DeclaredPredicates, 673 GetRequests, 560 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-05-23 09:26:11,719 INFO L146 ILogger]: Start minimizeSevpa. Operand 686 states. [2019-05-23 09:26:11,722 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 686 to 681. [2019-05-23 09:26:11,723 INFO L146 ILogger]: Start removeUnreachable. Operand 681 states. [2019-05-23 09:26:11,723 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 681 states to 681 states and 681 transitions. [2019-05-23 09:26:11,723 INFO L146 ILogger]: Start accepts. Automaton has 681 states and 681 transitions. Word has length 674 [2019-05-23 09:26:11,724 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:11,724 INFO L146 ILogger]: Abstraction has 681 states and 681 transitions. [2019-05-23 09:26:11,724 INFO L146 ILogger]: Interpolant automaton has 115 states. [2019-05-23 09:26:11,724 INFO L146 ILogger]: Start isEmpty. Operand 681 states and 681 transitions. [2019-05-23 09:26:11,737 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 681 [2019-05-23 09:26:11,737 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:11,737 INFO L146 ILogger]: trace histogram [113, 113, 113, 113, 113, 113, 1, 1] [2019-05-23 09:26:11,737 INFO L146 ILogger]: === Iteration 114 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:11,737 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:11,738 INFO L146 ILogger]: Analyzing trace with hash 53155378, now seen corresponding path program 113 times [2019-05-23 09:26:11,738 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:11,756 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:11,760 INFO L146 ILogger]: Trace formula consists of 909 conjuncts, 115 conjunts are in the unsatisfiable core [2019-05-23 09:26:11,762 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:16,374 INFO L146 ILogger]: Checked inductivity of 38081 backedges. 0 proven. 38081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:16,374 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:16,375 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-05-23 09:26:16,375 INFO L146 ILogger]: Interpolant automaton has 116 states [2019-05-23 09:26:16,376 INFO L146 ILogger]: Constructing interpolant automaton starting with 116 interpolants. [2019-05-23 09:26:16,376 INFO L146 ILogger]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:26:16,376 INFO L146 ILogger]: Start difference. First operand 681 states and 681 transitions. Second operand 116 states. [2019-05-23 09:26:17,054 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:17,054 INFO L146 ILogger]: Finished difference Result 692 states and 692 transitions. [2019-05-23 09:26:17,054 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-05-23 09:26:17,055 INFO L146 ILogger]: Start accepts. Automaton has 116 states. Word has length 680 [2019-05-23 09:26:17,055 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:17,057 INFO L146 ILogger]: With dead ends: 692 [2019-05-23 09:26:17,057 INFO L146 ILogger]: Without dead ends: 692 [2019-05-23 09:26:17,058 INFO L146 ILogger]: 0 DeclaredPredicates, 679 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-05-23 09:26:17,058 INFO L146 ILogger]: Start minimizeSevpa. Operand 692 states. [2019-05-23 09:26:17,061 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 692 to 687. [2019-05-23 09:26:17,061 INFO L146 ILogger]: Start removeUnreachable. Operand 687 states. [2019-05-23 09:26:17,062 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 687 states to 687 states and 687 transitions. [2019-05-23 09:26:17,062 INFO L146 ILogger]: Start accepts. Automaton has 687 states and 687 transitions. Word has length 680 [2019-05-23 09:26:17,062 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:17,062 INFO L146 ILogger]: Abstraction has 687 states and 687 transitions. [2019-05-23 09:26:17,062 INFO L146 ILogger]: Interpolant automaton has 116 states. [2019-05-23 09:26:17,062 INFO L146 ILogger]: Start isEmpty. Operand 687 states and 687 transitions. [2019-05-23 09:26:17,065 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 687 [2019-05-23 09:26:17,065 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:17,065 INFO L146 ILogger]: trace histogram [114, 114, 114, 114, 114, 114, 1, 1] [2019-05-23 09:26:17,065 INFO L146 ILogger]: === Iteration 115 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:17,065 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:17,065 INFO L146 ILogger]: Analyzing trace with hash 344187439, now seen corresponding path program 114 times [2019-05-23 09:26:17,066 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:17,084 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:17,088 INFO L146 ILogger]: Trace formula consists of 917 conjuncts, 116 conjunts are in the unsatisfiable core [2019-05-23 09:26:17,090 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:22,264 INFO L146 ILogger]: Checked inductivity of 38760 backedges. 0 proven. 38760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:22,264 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:22,264 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-05-23 09:26:22,265 INFO L146 ILogger]: Interpolant automaton has 117 states [2019-05-23 09:26:22,265 INFO L146 ILogger]: Constructing interpolant automaton starting with 117 interpolants. [2019-05-23 09:26:22,266 INFO L146 ILogger]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:26:22,266 INFO L146 ILogger]: Start difference. First operand 687 states and 687 transitions. Second operand 117 states. [2019-05-23 09:26:22,863 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:22,864 INFO L146 ILogger]: Finished difference Result 698 states and 698 transitions. [2019-05-23 09:26:22,864 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-05-23 09:26:22,864 INFO L146 ILogger]: Start accepts. Automaton has 117 states. Word has length 686 [2019-05-23 09:26:22,865 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:22,866 INFO L146 ILogger]: With dead ends: 698 [2019-05-23 09:26:22,866 INFO L146 ILogger]: Without dead ends: 698 [2019-05-23 09:26:22,867 INFO L146 ILogger]: 0 DeclaredPredicates, 685 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-05-23 09:26:22,868 INFO L146 ILogger]: Start minimizeSevpa. Operand 698 states. [2019-05-23 09:26:22,871 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 698 to 693. [2019-05-23 09:26:22,871 INFO L146 ILogger]: Start removeUnreachable. Operand 693 states. [2019-05-23 09:26:22,872 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 693 states to 693 states and 693 transitions. [2019-05-23 09:26:22,872 INFO L146 ILogger]: Start accepts. Automaton has 693 states and 693 transitions. Word has length 686 [2019-05-23 09:26:22,873 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:22,873 INFO L146 ILogger]: Abstraction has 693 states and 693 transitions. [2019-05-23 09:26:22,873 INFO L146 ILogger]: Interpolant automaton has 117 states. [2019-05-23 09:26:22,873 INFO L146 ILogger]: Start isEmpty. Operand 693 states and 693 transitions. [2019-05-23 09:26:22,876 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 693 [2019-05-23 09:26:22,877 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:22,877 INFO L146 ILogger]: trace histogram [115, 115, 115, 115, 115, 115, 1, 1] [2019-05-23 09:26:22,877 INFO L146 ILogger]: === Iteration 116 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:22,877 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:22,877 INFO L146 ILogger]: Analyzing trace with hash -1671365524, now seen corresponding path program 115 times [2019-05-23 09:26:22,878 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:22,909 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:22,915 INFO L146 ILogger]: Trace formula consists of 925 conjuncts, 117 conjunts are in the unsatisfiable core [2019-05-23 09:26:22,918 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:28,047 INFO L146 ILogger]: Checked inductivity of 39445 backedges. 0 proven. 39445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:28,048 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:28,048 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-05-23 09:26:28,048 INFO L146 ILogger]: Interpolant automaton has 118 states [2019-05-23 09:26:28,049 INFO L146 ILogger]: Constructing interpolant automaton starting with 118 interpolants. [2019-05-23 09:26:28,049 INFO L146 ILogger]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:26:28,049 INFO L146 ILogger]: Start difference. First operand 693 states and 693 transitions. Second operand 118 states. [2019-05-23 09:26:28,676 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:28,676 INFO L146 ILogger]: Finished difference Result 704 states and 704 transitions. [2019-05-23 09:26:28,676 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-05-23 09:26:28,676 INFO L146 ILogger]: Start accepts. Automaton has 118 states. Word has length 692 [2019-05-23 09:26:28,677 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:28,678 INFO L146 ILogger]: With dead ends: 704 [2019-05-23 09:26:28,678 INFO L146 ILogger]: Without dead ends: 704 [2019-05-23 09:26:28,679 INFO L146 ILogger]: 0 DeclaredPredicates, 691 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-05-23 09:26:28,680 INFO L146 ILogger]: Start minimizeSevpa. Operand 704 states. [2019-05-23 09:26:28,683 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 704 to 699. [2019-05-23 09:26:28,684 INFO L146 ILogger]: Start removeUnreachable. Operand 699 states. [2019-05-23 09:26:28,684 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 699 states to 699 states and 699 transitions. [2019-05-23 09:26:28,685 INFO L146 ILogger]: Start accepts. Automaton has 699 states and 699 transitions. Word has length 692 [2019-05-23 09:26:28,685 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:28,685 INFO L146 ILogger]: Abstraction has 699 states and 699 transitions. [2019-05-23 09:26:28,685 INFO L146 ILogger]: Interpolant automaton has 118 states. [2019-05-23 09:26:28,685 INFO L146 ILogger]: Start isEmpty. Operand 699 states and 699 transitions. [2019-05-23 09:26:28,689 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 699 [2019-05-23 09:26:28,689 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:28,689 INFO L146 ILogger]: trace histogram [116, 116, 116, 116, 116, 116, 1, 1] [2019-05-23 09:26:28,690 INFO L146 ILogger]: === Iteration 117 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:28,690 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:28,690 INFO L146 ILogger]: Analyzing trace with hash 123647209, now seen corresponding path program 116 times [2019-05-23 09:26:28,690 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:28,726 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:28,734 INFO L146 ILogger]: Trace formula consists of 933 conjuncts, 118 conjunts are in the unsatisfiable core [2019-05-23 09:26:28,740 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:33,842 INFO L146 ILogger]: Checked inductivity of 40136 backedges. 0 proven. 40136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:33,842 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:33,843 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-05-23 09:26:33,843 INFO L146 ILogger]: Interpolant automaton has 119 states [2019-05-23 09:26:33,844 INFO L146 ILogger]: Constructing interpolant automaton starting with 119 interpolants. [2019-05-23 09:26:33,844 INFO L146 ILogger]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:26:33,844 INFO L146 ILogger]: Start difference. First operand 699 states and 699 transitions. Second operand 119 states. [2019-05-23 09:26:34,482 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:34,483 INFO L146 ILogger]: Finished difference Result 710 states and 710 transitions. [2019-05-23 09:26:34,483 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-05-23 09:26:34,483 INFO L146 ILogger]: Start accepts. Automaton has 119 states. Word has length 698 [2019-05-23 09:26:34,484 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:34,485 INFO L146 ILogger]: With dead ends: 710 [2019-05-23 09:26:34,485 INFO L146 ILogger]: Without dead ends: 710 [2019-05-23 09:26:34,486 INFO L146 ILogger]: 0 DeclaredPredicates, 697 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-05-23 09:26:34,487 INFO L146 ILogger]: Start minimizeSevpa. Operand 710 states. [2019-05-23 09:26:34,490 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 710 to 705. [2019-05-23 09:26:34,491 INFO L146 ILogger]: Start removeUnreachable. Operand 705 states. [2019-05-23 09:26:34,491 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 705 states to 705 states and 705 transitions. [2019-05-23 09:26:34,492 INFO L146 ILogger]: Start accepts. Automaton has 705 states and 705 transitions. Word has length 698 [2019-05-23 09:26:34,492 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:34,492 INFO L146 ILogger]: Abstraction has 705 states and 705 transitions. [2019-05-23 09:26:34,492 INFO L146 ILogger]: Interpolant automaton has 119 states. [2019-05-23 09:26:34,492 INFO L146 ILogger]: Start isEmpty. Operand 705 states and 705 transitions. [2019-05-23 09:26:34,496 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 705 [2019-05-23 09:26:34,496 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:34,496 INFO L146 ILogger]: trace histogram [117, 117, 117, 117, 117, 117, 1, 1] [2019-05-23 09:26:34,496 INFO L146 ILogger]: === Iteration 118 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:34,497 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:34,497 INFO L146 ILogger]: Analyzing trace with hash -811770970, now seen corresponding path program 117 times [2019-05-23 09:26:34,497 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:34,530 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:34,536 INFO L146 ILogger]: Trace formula consists of 941 conjuncts, 119 conjunts are in the unsatisfiable core [2019-05-23 09:26:34,540 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:39,643 INFO L146 ILogger]: Checked inductivity of 40833 backedges. 0 proven. 40833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:39,643 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:39,643 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-05-23 09:26:39,644 INFO L146 ILogger]: Interpolant automaton has 120 states [2019-05-23 09:26:39,644 INFO L146 ILogger]: Constructing interpolant automaton starting with 120 interpolants. [2019-05-23 09:26:39,645 INFO L146 ILogger]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:26:39,645 INFO L146 ILogger]: Start difference. First operand 705 states and 705 transitions. Second operand 120 states. [2019-05-23 09:26:40,276 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:40,276 INFO L146 ILogger]: Finished difference Result 716 states and 716 transitions. [2019-05-23 09:26:40,277 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-05-23 09:26:40,277 INFO L146 ILogger]: Start accepts. Automaton has 120 states. Word has length 704 [2019-05-23 09:26:40,278 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:40,279 INFO L146 ILogger]: With dead ends: 716 [2019-05-23 09:26:40,279 INFO L146 ILogger]: Without dead ends: 716 [2019-05-23 09:26:40,280 INFO L146 ILogger]: 0 DeclaredPredicates, 703 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-05-23 09:26:40,280 INFO L146 ILogger]: Start minimizeSevpa. Operand 716 states. [2019-05-23 09:26:40,284 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 716 to 711. [2019-05-23 09:26:40,284 INFO L146 ILogger]: Start removeUnreachable. Operand 711 states. [2019-05-23 09:26:40,285 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 711 states to 711 states and 711 transitions. [2019-05-23 09:26:40,285 INFO L146 ILogger]: Start accepts. Automaton has 711 states and 711 transitions. Word has length 704 [2019-05-23 09:26:40,285 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:40,285 INFO L146 ILogger]: Abstraction has 711 states and 711 transitions. [2019-05-23 09:26:40,286 INFO L146 ILogger]: Interpolant automaton has 120 states. [2019-05-23 09:26:40,286 INFO L146 ILogger]: Start isEmpty. Operand 711 states and 711 transitions. [2019-05-23 09:26:40,289 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 711 [2019-05-23 09:26:40,290 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:40,290 INFO L146 ILogger]: trace histogram [118, 118, 118, 118, 118, 118, 1, 1] [2019-05-23 09:26:40,290 INFO L146 ILogger]: === Iteration 119 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:40,290 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:40,290 INFO L146 ILogger]: Analyzing trace with hash 1237401763, now seen corresponding path program 118 times [2019-05-23 09:26:40,291 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:40,327 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:40,337 INFO L146 ILogger]: Trace formula consists of 949 conjuncts, 120 conjunts are in the unsatisfiable core [2019-05-23 09:26:40,342 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:45,661 INFO L146 ILogger]: Checked inductivity of 41536 backedges. 0 proven. 41536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:45,662 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:45,662 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-05-23 09:26:45,662 INFO L146 ILogger]: Interpolant automaton has 121 states [2019-05-23 09:26:45,663 INFO L146 ILogger]: Constructing interpolant automaton starting with 121 interpolants. [2019-05-23 09:26:45,664 INFO L146 ILogger]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:26:45,664 INFO L146 ILogger]: Start difference. First operand 711 states and 711 transitions. Second operand 121 states. [2019-05-23 09:26:46,321 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:46,322 INFO L146 ILogger]: Finished difference Result 722 states and 722 transitions. [2019-05-23 09:26:46,322 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-05-23 09:26:46,322 INFO L146 ILogger]: Start accepts. Automaton has 121 states. Word has length 710 [2019-05-23 09:26:46,322 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:46,323 INFO L146 ILogger]: With dead ends: 722 [2019-05-23 09:26:46,323 INFO L146 ILogger]: Without dead ends: 722 [2019-05-23 09:26:46,324 INFO L146 ILogger]: 0 DeclaredPredicates, 709 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2019-05-23 09:26:46,324 INFO L146 ILogger]: Start minimizeSevpa. Operand 722 states. [2019-05-23 09:26:46,327 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 722 to 717. [2019-05-23 09:26:46,327 INFO L146 ILogger]: Start removeUnreachable. Operand 717 states. [2019-05-23 09:26:46,328 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 717 states to 717 states and 717 transitions. [2019-05-23 09:26:46,328 INFO L146 ILogger]: Start accepts. Automaton has 717 states and 717 transitions. Word has length 710 [2019-05-23 09:26:46,328 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:46,328 INFO L146 ILogger]: Abstraction has 717 states and 717 transitions. [2019-05-23 09:26:46,328 INFO L146 ILogger]: Interpolant automaton has 121 states. [2019-05-23 09:26:46,328 INFO L146 ILogger]: Start isEmpty. Operand 717 states and 717 transitions. [2019-05-23 09:26:46,331 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 717 [2019-05-23 09:26:46,331 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:46,331 INFO L146 ILogger]: trace histogram [119, 119, 119, 119, 119, 119, 1, 1] [2019-05-23 09:26:46,332 INFO L146 ILogger]: === Iteration 120 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:46,332 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:46,332 INFO L146 ILogger]: Analyzing trace with hash -1309494304, now seen corresponding path program 119 times [2019-05-23 09:26:46,332 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:46,352 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:46,356 INFO L146 ILogger]: Trace formula consists of 957 conjuncts, 121 conjunts are in the unsatisfiable core [2019-05-23 09:26:46,359 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:51,769 INFO L146 ILogger]: Checked inductivity of 42245 backedges. 0 proven. 42245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:51,769 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:51,769 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2019-05-23 09:26:51,770 INFO L146 ILogger]: Interpolant automaton has 122 states [2019-05-23 09:26:51,770 INFO L146 ILogger]: Constructing interpolant automaton starting with 122 interpolants. [2019-05-23 09:26:51,771 INFO L146 ILogger]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:26:51,771 INFO L146 ILogger]: Start difference. First operand 717 states and 717 transitions. Second operand 122 states. [2019-05-23 09:26:52,443 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:52,444 INFO L146 ILogger]: Finished difference Result 728 states and 728 transitions. [2019-05-23 09:26:52,444 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-05-23 09:26:52,444 INFO L146 ILogger]: Start accepts. Automaton has 122 states. Word has length 716 [2019-05-23 09:26:52,445 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:52,446 INFO L146 ILogger]: With dead ends: 728 [2019-05-23 09:26:52,446 INFO L146 ILogger]: Without dead ends: 728 [2019-05-23 09:26:52,447 INFO L146 ILogger]: 0 DeclaredPredicates, 715 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-05-23 09:26:52,448 INFO L146 ILogger]: Start minimizeSevpa. Operand 728 states. [2019-05-23 09:26:52,451 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 728 to 723. [2019-05-23 09:26:52,451 INFO L146 ILogger]: Start removeUnreachable. Operand 723 states. [2019-05-23 09:26:52,452 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 723 states to 723 states and 723 transitions. [2019-05-23 09:26:52,452 INFO L146 ILogger]: Start accepts. Automaton has 723 states and 723 transitions. Word has length 716 [2019-05-23 09:26:52,453 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:52,453 INFO L146 ILogger]: Abstraction has 723 states and 723 transitions. [2019-05-23 09:26:52,453 INFO L146 ILogger]: Interpolant automaton has 122 states. [2019-05-23 09:26:52,453 INFO L146 ILogger]: Start isEmpty. Operand 723 states and 723 transitions. [2019-05-23 09:26:52,457 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 723 [2019-05-23 09:26:52,457 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:52,457 INFO L146 ILogger]: trace histogram [120, 120, 120, 120, 120, 120, 1, 1] [2019-05-23 09:26:52,457 INFO L146 ILogger]: === Iteration 121 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:52,457 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:52,458 INFO L146 ILogger]: Analyzing trace with hash 2027816285, now seen corresponding path program 120 times [2019-05-23 09:26:52,458 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:52,492 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:52,501 INFO L146 ILogger]: Trace formula consists of 965 conjuncts, 122 conjunts are in the unsatisfiable core [2019-05-23 09:26:52,507 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:26:57,853 INFO L146 ILogger]: Checked inductivity of 42960 backedges. 0 proven. 42960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:26:57,854 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:26:57,854 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2019-05-23 09:26:57,854 INFO L146 ILogger]: Interpolant automaton has 123 states [2019-05-23 09:26:57,855 INFO L146 ILogger]: Constructing interpolant automaton starting with 123 interpolants. [2019-05-23 09:26:57,856 INFO L146 ILogger]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:26:57,856 INFO L146 ILogger]: Start difference. First operand 723 states and 723 transitions. Second operand 123 states. [2019-05-23 09:26:58,540 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:26:58,541 INFO L146 ILogger]: Finished difference Result 734 states and 734 transitions. [2019-05-23 09:26:58,541 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-05-23 09:26:58,541 INFO L146 ILogger]: Start accepts. Automaton has 123 states. Word has length 722 [2019-05-23 09:26:58,542 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:26:58,543 INFO L146 ILogger]: With dead ends: 734 [2019-05-23 09:26:58,543 INFO L146 ILogger]: Without dead ends: 734 [2019-05-23 09:26:58,544 INFO L146 ILogger]: 0 DeclaredPredicates, 721 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2019-05-23 09:26:58,544 INFO L146 ILogger]: Start minimizeSevpa. Operand 734 states. [2019-05-23 09:26:58,548 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 734 to 729. [2019-05-23 09:26:58,548 INFO L146 ILogger]: Start removeUnreachable. Operand 729 states. [2019-05-23 09:26:58,549 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 729 states to 729 states and 729 transitions. [2019-05-23 09:26:58,549 INFO L146 ILogger]: Start accepts. Automaton has 729 states and 729 transitions. Word has length 722 [2019-05-23 09:26:58,550 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:26:58,550 INFO L146 ILogger]: Abstraction has 729 states and 729 transitions. [2019-05-23 09:26:58,550 INFO L146 ILogger]: Interpolant automaton has 123 states. [2019-05-23 09:26:58,550 INFO L146 ILogger]: Start isEmpty. Operand 729 states and 729 transitions. [2019-05-23 09:26:58,554 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 729 [2019-05-23 09:26:58,554 INFO L146 ILogger]: Found error trace [2019-05-23 09:26:58,554 INFO L146 ILogger]: trace histogram [121, 121, 121, 121, 121, 121, 1, 1] [2019-05-23 09:26:58,554 INFO L146 ILogger]: === Iteration 122 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:26:58,555 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:26:58,555 INFO L146 ILogger]: Analyzing trace with hash -793541350, now seen corresponding path program 121 times [2019-05-23 09:26:58,555 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:26:58,592 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:26:58,602 INFO L146 ILogger]: Trace formula consists of 973 conjuncts, 123 conjunts are in the unsatisfiable core [2019-05-23 09:26:58,607 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:04,320 INFO L146 ILogger]: Checked inductivity of 43681 backedges. 0 proven. 43681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:04,320 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:04,321 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-05-23 09:27:04,321 INFO L146 ILogger]: Interpolant automaton has 124 states [2019-05-23 09:27:04,322 INFO L146 ILogger]: Constructing interpolant automaton starting with 124 interpolants. [2019-05-23 09:27:04,322 INFO L146 ILogger]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 09:27:04,322 INFO L146 ILogger]: Start difference. First operand 729 states and 729 transitions. Second operand 124 states. [2019-05-23 09:27:04,985 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:04,986 INFO L146 ILogger]: Finished difference Result 740 states and 740 transitions. [2019-05-23 09:27:04,986 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-05-23 09:27:04,986 INFO L146 ILogger]: Start accepts. Automaton has 124 states. Word has length 728 [2019-05-23 09:27:04,987 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:04,989 INFO L146 ILogger]: With dead ends: 740 [2019-05-23 09:27:04,989 INFO L146 ILogger]: Without dead ends: 740 [2019-05-23 09:27:04,990 INFO L146 ILogger]: 0 DeclaredPredicates, 727 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-05-23 09:27:04,990 INFO L146 ILogger]: Start minimizeSevpa. Operand 740 states. [2019-05-23 09:27:04,994 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 740 to 735. [2019-05-23 09:27:04,994 INFO L146 ILogger]: Start removeUnreachable. Operand 735 states. [2019-05-23 09:27:04,995 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 735 states to 735 states and 735 transitions. [2019-05-23 09:27:04,995 INFO L146 ILogger]: Start accepts. Automaton has 735 states and 735 transitions. Word has length 728 [2019-05-23 09:27:04,995 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:04,995 INFO L146 ILogger]: Abstraction has 735 states and 735 transitions. [2019-05-23 09:27:04,996 INFO L146 ILogger]: Interpolant automaton has 124 states. [2019-05-23 09:27:04,996 INFO L146 ILogger]: Start isEmpty. Operand 735 states and 735 transitions. [2019-05-23 09:27:05,000 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 735 [2019-05-23 09:27:05,000 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:05,000 INFO L146 ILogger]: trace histogram [122, 122, 122, 122, 122, 122, 1, 1] [2019-05-23 09:27:05,000 INFO L146 ILogger]: === Iteration 123 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:05,001 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:05,001 INFO L146 ILogger]: Analyzing trace with hash 2049409815, now seen corresponding path program 122 times [2019-05-23 09:27:05,001 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:05,036 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:05,043 INFO L146 ILogger]: Trace formula consists of 981 conjuncts, 124 conjunts are in the unsatisfiable core [2019-05-23 09:27:05,047 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:10,706 INFO L146 ILogger]: Checked inductivity of 44408 backedges. 0 proven. 44408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:10,707 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:10,707 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-05-23 09:27:10,707 INFO L146 ILogger]: Interpolant automaton has 125 states [2019-05-23 09:27:10,708 INFO L146 ILogger]: Constructing interpolant automaton starting with 125 interpolants. [2019-05-23 09:27:10,708 INFO L146 ILogger]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:27:10,708 INFO L146 ILogger]: Start difference. First operand 735 states and 735 transitions. Second operand 125 states. [2019-05-23 09:27:11,387 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:11,388 INFO L146 ILogger]: Finished difference Result 746 states and 746 transitions. [2019-05-23 09:27:11,388 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-05-23 09:27:11,388 INFO L146 ILogger]: Start accepts. Automaton has 125 states. Word has length 734 [2019-05-23 09:27:11,389 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:11,390 INFO L146 ILogger]: With dead ends: 746 [2019-05-23 09:27:11,390 INFO L146 ILogger]: Without dead ends: 746 [2019-05-23 09:27:11,390 INFO L146 ILogger]: 0 DeclaredPredicates, 733 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2019-05-23 09:27:11,391 INFO L146 ILogger]: Start minimizeSevpa. Operand 746 states. [2019-05-23 09:27:11,393 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 746 to 741. [2019-05-23 09:27:11,393 INFO L146 ILogger]: Start removeUnreachable. Operand 741 states. [2019-05-23 09:27:11,394 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 741 states to 741 states and 741 transitions. [2019-05-23 09:27:11,394 INFO L146 ILogger]: Start accepts. Automaton has 741 states and 741 transitions. Word has length 734 [2019-05-23 09:27:11,394 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:11,394 INFO L146 ILogger]: Abstraction has 741 states and 741 transitions. [2019-05-23 09:27:11,394 INFO L146 ILogger]: Interpolant automaton has 125 states. [2019-05-23 09:27:11,395 INFO L146 ILogger]: Start isEmpty. Operand 741 states and 741 transitions. [2019-05-23 09:27:11,397 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 741 [2019-05-23 09:27:11,398 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:11,398 INFO L146 ILogger]: trace histogram [123, 123, 123, 123, 123, 123, 1, 1] [2019-05-23 09:27:11,398 INFO L146 ILogger]: === Iteration 124 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:11,398 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:11,398 INFO L146 ILogger]: Analyzing trace with hash -781037740, now seen corresponding path program 123 times [2019-05-23 09:27:11,399 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:11,419 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:11,423 INFO L146 ILogger]: Trace formula consists of 989 conjuncts, 125 conjunts are in the unsatisfiable core [2019-05-23 09:27:11,426 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:17,051 INFO L146 ILogger]: Checked inductivity of 45141 backedges. 0 proven. 45141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:17,052 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:17,052 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2019-05-23 09:27:17,052 INFO L146 ILogger]: Interpolant automaton has 126 states [2019-05-23 09:27:17,053 INFO L146 ILogger]: Constructing interpolant automaton starting with 126 interpolants. [2019-05-23 09:27:17,053 INFO L146 ILogger]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 09:27:17,053 INFO L146 ILogger]: Start difference. First operand 741 states and 741 transitions. Second operand 126 states. [2019-05-23 09:27:17,771 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:17,771 INFO L146 ILogger]: Finished difference Result 752 states and 752 transitions. [2019-05-23 09:27:17,772 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-05-23 09:27:17,772 INFO L146 ILogger]: Start accepts. Automaton has 126 states. Word has length 740 [2019-05-23 09:27:17,773 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:17,773 INFO L146 ILogger]: With dead ends: 752 [2019-05-23 09:27:17,773 INFO L146 ILogger]: Without dead ends: 752 [2019-05-23 09:27:17,774 INFO L146 ILogger]: 0 DeclaredPredicates, 739 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-05-23 09:27:17,775 INFO L146 ILogger]: Start minimizeSevpa. Operand 752 states. [2019-05-23 09:27:17,778 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 752 to 747. [2019-05-23 09:27:17,778 INFO L146 ILogger]: Start removeUnreachable. Operand 747 states. [2019-05-23 09:27:17,779 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 747 states to 747 states and 747 transitions. [2019-05-23 09:27:17,779 INFO L146 ILogger]: Start accepts. Automaton has 747 states and 747 transitions. Word has length 740 [2019-05-23 09:27:17,779 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:17,780 INFO L146 ILogger]: Abstraction has 747 states and 747 transitions. [2019-05-23 09:27:17,780 INFO L146 ILogger]: Interpolant automaton has 126 states. [2019-05-23 09:27:17,780 INFO L146 ILogger]: Start isEmpty. Operand 747 states and 747 transitions. [2019-05-23 09:27:17,784 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 747 [2019-05-23 09:27:17,784 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:17,784 INFO L146 ILogger]: trace histogram [124, 124, 124, 124, 124, 124, 1, 1] [2019-05-23 09:27:17,785 INFO L146 ILogger]: === Iteration 125 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:17,785 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:17,785 INFO L146 ILogger]: Analyzing trace with hash 458242513, now seen corresponding path program 124 times [2019-05-23 09:27:17,785 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:17,825 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:17,836 INFO L146 ILogger]: Trace formula consists of 997 conjuncts, 126 conjunts are in the unsatisfiable core [2019-05-23 09:27:17,842 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:23,863 INFO L146 ILogger]: Checked inductivity of 45880 backedges. 0 proven. 45880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:23,863 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:23,864 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2019-05-23 09:27:23,864 INFO L146 ILogger]: Interpolant automaton has 127 states [2019-05-23 09:27:23,865 INFO L146 ILogger]: Constructing interpolant automaton starting with 127 interpolants. [2019-05-23 09:27:23,865 INFO L146 ILogger]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:27:23,865 INFO L146 ILogger]: Start difference. First operand 747 states and 747 transitions. Second operand 127 states. [2019-05-23 09:27:24,560 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:24,560 INFO L146 ILogger]: Finished difference Result 758 states and 758 transitions. [2019-05-23 09:27:24,560 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-05-23 09:27:24,560 INFO L146 ILogger]: Start accepts. Automaton has 127 states. Word has length 746 [2019-05-23 09:27:24,561 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:24,561 INFO L146 ILogger]: With dead ends: 758 [2019-05-23 09:27:24,561 INFO L146 ILogger]: Without dead ends: 758 [2019-05-23 09:27:24,562 INFO L146 ILogger]: 0 DeclaredPredicates, 745 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2019-05-23 09:27:24,562 INFO L146 ILogger]: Start minimizeSevpa. Operand 758 states. [2019-05-23 09:27:24,565 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 758 to 753. [2019-05-23 09:27:24,565 INFO L146 ILogger]: Start removeUnreachable. Operand 753 states. [2019-05-23 09:27:24,566 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 753 states to 753 states and 753 transitions. [2019-05-23 09:27:24,566 INFO L146 ILogger]: Start accepts. Automaton has 753 states and 753 transitions. Word has length 746 [2019-05-23 09:27:24,566 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:24,566 INFO L146 ILogger]: Abstraction has 753 states and 753 transitions. [2019-05-23 09:27:24,566 INFO L146 ILogger]: Interpolant automaton has 127 states. [2019-05-23 09:27:24,566 INFO L146 ILogger]: Start isEmpty. Operand 753 states and 753 transitions. [2019-05-23 09:27:24,570 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 753 [2019-05-23 09:27:24,570 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:24,570 INFO L146 ILogger]: trace histogram [125, 125, 125, 125, 125, 125, 1, 1] [2019-05-23 09:27:24,570 INFO L146 ILogger]: === Iteration 126 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:24,570 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:24,570 INFO L146 ILogger]: Analyzing trace with hash 302092942, now seen corresponding path program 125 times [2019-05-23 09:27:24,571 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:24,592 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:24,597 INFO L146 ILogger]: Trace formula consists of 1005 conjuncts, 127 conjunts are in the unsatisfiable core [2019-05-23 09:27:24,599 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:30,379 INFO L146 ILogger]: Checked inductivity of 46625 backedges. 0 proven. 46625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:30,380 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:30,380 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2019-05-23 09:27:30,380 INFO L146 ILogger]: Interpolant automaton has 128 states [2019-05-23 09:27:30,381 INFO L146 ILogger]: Constructing interpolant automaton starting with 128 interpolants. [2019-05-23 09:27:30,382 INFO L146 ILogger]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:27:30,382 INFO L146 ILogger]: Start difference. First operand 753 states and 753 transitions. Second operand 128 states. [2019-05-23 09:27:31,130 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:31,130 INFO L146 ILogger]: Finished difference Result 764 states and 764 transitions. [2019-05-23 09:27:31,130 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-05-23 09:27:31,130 INFO L146 ILogger]: Start accepts. Automaton has 128 states. Word has length 752 [2019-05-23 09:27:31,131 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:31,131 INFO L146 ILogger]: With dead ends: 764 [2019-05-23 09:27:31,131 INFO L146 ILogger]: Without dead ends: 764 [2019-05-23 09:27:31,132 INFO L146 ILogger]: 0 DeclaredPredicates, 751 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-05-23 09:27:31,133 INFO L146 ILogger]: Start minimizeSevpa. Operand 764 states. [2019-05-23 09:27:31,136 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 764 to 759. [2019-05-23 09:27:31,136 INFO L146 ILogger]: Start removeUnreachable. Operand 759 states. [2019-05-23 09:27:31,137 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2019-05-23 09:27:31,137 INFO L146 ILogger]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 752 [2019-05-23 09:27:31,137 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:31,137 INFO L146 ILogger]: Abstraction has 759 states and 759 transitions. [2019-05-23 09:27:31,137 INFO L146 ILogger]: Interpolant automaton has 128 states. [2019-05-23 09:27:31,137 INFO L146 ILogger]: Start isEmpty. Operand 759 states and 759 transitions. [2019-05-23 09:27:31,140 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 759 [2019-05-23 09:27:31,140 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:31,140 INFO L146 ILogger]: trace histogram [126, 126, 126, 126, 126, 126, 1, 1] [2019-05-23 09:27:31,141 INFO L146 ILogger]: === Iteration 127 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:31,141 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:31,141 INFO L146 ILogger]: Analyzing trace with hash -1303729781, now seen corresponding path program 126 times [2019-05-23 09:27:31,142 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:31,163 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:31,168 INFO L146 ILogger]: Trace formula consists of 1013 conjuncts, 128 conjunts are in the unsatisfiable core [2019-05-23 09:27:31,171 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:37,211 INFO L146 ILogger]: Checked inductivity of 47376 backedges. 0 proven. 47376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:37,211 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:37,211 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2019-05-23 09:27:37,212 INFO L146 ILogger]: Interpolant automaton has 129 states [2019-05-23 09:27:37,213 INFO L146 ILogger]: Constructing interpolant automaton starting with 129 interpolants. [2019-05-23 09:27:37,213 INFO L146 ILogger]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:27:37,213 INFO L146 ILogger]: Start difference. First operand 759 states and 759 transitions. Second operand 129 states. [2019-05-23 09:27:37,927 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:37,928 INFO L146 ILogger]: Finished difference Result 770 states and 770 transitions. [2019-05-23 09:27:37,928 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-05-23 09:27:37,928 INFO L146 ILogger]: Start accepts. Automaton has 129 states. Word has length 758 [2019-05-23 09:27:37,929 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:37,929 INFO L146 ILogger]: With dead ends: 770 [2019-05-23 09:27:37,929 INFO L146 ILogger]: Without dead ends: 770 [2019-05-23 09:27:37,930 INFO L146 ILogger]: 0 DeclaredPredicates, 757 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2019-05-23 09:27:37,930 INFO L146 ILogger]: Start minimizeSevpa. Operand 770 states. [2019-05-23 09:27:37,933 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 770 to 765. [2019-05-23 09:27:37,933 INFO L146 ILogger]: Start removeUnreachable. Operand 765 states. [2019-05-23 09:27:37,934 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 765 states to 765 states and 765 transitions. [2019-05-23 09:27:37,934 INFO L146 ILogger]: Start accepts. Automaton has 765 states and 765 transitions. Word has length 758 [2019-05-23 09:27:37,934 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:37,934 INFO L146 ILogger]: Abstraction has 765 states and 765 transitions. [2019-05-23 09:27:37,934 INFO L146 ILogger]: Interpolant automaton has 129 states. [2019-05-23 09:27:37,935 INFO L146 ILogger]: Start isEmpty. Operand 765 states and 765 transitions. [2019-05-23 09:27:37,938 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 765 [2019-05-23 09:27:37,938 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:37,938 INFO L146 ILogger]: trace histogram [127, 127, 127, 127, 127, 127, 1, 1] [2019-05-23 09:27:37,938 INFO L146 ILogger]: === Iteration 128 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:37,939 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:37,939 INFO L146 ILogger]: Analyzing trace with hash 1215549128, now seen corresponding path program 127 times [2019-05-23 09:27:37,939 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:37,965 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:37,970 INFO L146 ILogger]: Trace formula consists of 1021 conjuncts, 129 conjunts are in the unsatisfiable core [2019-05-23 09:27:37,974 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:44,100 INFO L146 ILogger]: Checked inductivity of 48133 backedges. 0 proven. 48133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:44,100 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:44,101 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2019-05-23 09:27:44,102 INFO L146 ILogger]: Interpolant automaton has 130 states [2019-05-23 09:27:44,103 INFO L146 ILogger]: Constructing interpolant automaton starting with 130 interpolants. [2019-05-23 09:27:44,103 INFO L146 ILogger]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 09:27:44,103 INFO L146 ILogger]: Start difference. First operand 765 states and 765 transitions. Second operand 130 states. [2019-05-23 09:27:44,838 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:44,839 INFO L146 ILogger]: Finished difference Result 776 states and 776 transitions. [2019-05-23 09:27:44,839 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-05-23 09:27:44,839 INFO L146 ILogger]: Start accepts. Automaton has 130 states. Word has length 764 [2019-05-23 09:27:44,840 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:44,841 INFO L146 ILogger]: With dead ends: 776 [2019-05-23 09:27:44,841 INFO L146 ILogger]: Without dead ends: 776 [2019-05-23 09:27:44,842 INFO L146 ILogger]: 0 DeclaredPredicates, 763 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-05-23 09:27:44,842 INFO L146 ILogger]: Start minimizeSevpa. Operand 776 states. [2019-05-23 09:27:44,847 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 776 to 771. [2019-05-23 09:27:44,847 INFO L146 ILogger]: Start removeUnreachable. Operand 771 states. [2019-05-23 09:27:44,848 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 771 states to 771 states and 771 transitions. [2019-05-23 09:27:44,848 INFO L146 ILogger]: Start accepts. Automaton has 771 states and 771 transitions. Word has length 764 [2019-05-23 09:27:44,848 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:44,848 INFO L146 ILogger]: Abstraction has 771 states and 771 transitions. [2019-05-23 09:27:44,849 INFO L146 ILogger]: Interpolant automaton has 130 states. [2019-05-23 09:27:44,849 INFO L146 ILogger]: Start isEmpty. Operand 771 states and 771 transitions. [2019-05-23 09:27:44,853 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 771 [2019-05-23 09:27:44,853 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:44,854 INFO L146 ILogger]: trace histogram [128, 128, 128, 128, 128, 128, 1, 1] [2019-05-23 09:27:44,854 INFO L146 ILogger]: === Iteration 129 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:44,854 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:44,854 INFO L146 ILogger]: Analyzing trace with hash -1119268283, now seen corresponding path program 128 times [2019-05-23 09:27:44,855 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:44,895 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:44,905 INFO L146 ILogger]: Trace formula consists of 1029 conjuncts, 130 conjunts are in the unsatisfiable core [2019-05-23 09:27:44,911 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:51,150 INFO L146 ILogger]: Checked inductivity of 48896 backedges. 0 proven. 48896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:51,150 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:51,151 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2019-05-23 09:27:51,151 INFO L146 ILogger]: Interpolant automaton has 131 states [2019-05-23 09:27:51,152 INFO L146 ILogger]: Constructing interpolant automaton starting with 131 interpolants. [2019-05-23 09:27:51,153 INFO L146 ILogger]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:27:51,153 INFO L146 ILogger]: Start difference. First operand 771 states and 771 transitions. Second operand 131 states. [2019-05-23 09:27:51,905 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:51,905 INFO L146 ILogger]: Finished difference Result 782 states and 782 transitions. [2019-05-23 09:27:51,906 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-05-23 09:27:51,906 INFO L146 ILogger]: Start accepts. Automaton has 131 states. Word has length 770 [2019-05-23 09:27:51,907 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:51,907 INFO L146 ILogger]: With dead ends: 782 [2019-05-23 09:27:51,908 INFO L146 ILogger]: Without dead ends: 782 [2019-05-23 09:27:51,909 INFO L146 ILogger]: 0 DeclaredPredicates, 769 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2019-05-23 09:27:51,909 INFO L146 ILogger]: Start minimizeSevpa. Operand 782 states. [2019-05-23 09:27:51,912 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 782 to 777. [2019-05-23 09:27:51,912 INFO L146 ILogger]: Start removeUnreachable. Operand 777 states. [2019-05-23 09:27:51,913 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 777 states to 777 states and 777 transitions. [2019-05-23 09:27:51,913 INFO L146 ILogger]: Start accepts. Automaton has 777 states and 777 transitions. Word has length 770 [2019-05-23 09:27:51,913 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:51,914 INFO L146 ILogger]: Abstraction has 777 states and 777 transitions. [2019-05-23 09:27:51,914 INFO L146 ILogger]: Interpolant automaton has 131 states. [2019-05-23 09:27:51,914 INFO L146 ILogger]: Start isEmpty. Operand 777 states and 777 transitions. [2019-05-23 09:27:51,917 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 777 [2019-05-23 09:27:51,917 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:51,917 INFO L146 ILogger]: trace histogram [129, 129, 129, 129, 129, 129, 1, 1] [2019-05-23 09:27:51,917 INFO L146 ILogger]: === Iteration 130 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:51,917 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:51,918 INFO L146 ILogger]: Analyzing trace with hash 589005826, now seen corresponding path program 129 times [2019-05-23 09:27:51,918 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:51,948 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:51,955 INFO L146 ILogger]: Trace formula consists of 1037 conjuncts, 131 conjunts are in the unsatisfiable core [2019-05-23 09:27:51,959 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:27:58,294 INFO L146 ILogger]: Checked inductivity of 49665 backedges. 0 proven. 49665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:27:58,295 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:27:58,295 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-05-23 09:27:58,295 INFO L146 ILogger]: Interpolant automaton has 132 states [2019-05-23 09:27:58,296 INFO L146 ILogger]: Constructing interpolant automaton starting with 132 interpolants. [2019-05-23 09:27:58,296 INFO L146 ILogger]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 09:27:58,296 INFO L146 ILogger]: Start difference. First operand 777 states and 777 transitions. Second operand 132 states. [2019-05-23 09:27:59,065 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:27:59,065 INFO L146 ILogger]: Finished difference Result 788 states and 788 transitions. [2019-05-23 09:27:59,066 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-05-23 09:27:59,066 INFO L146 ILogger]: Start accepts. Automaton has 132 states. Word has length 776 [2019-05-23 09:27:59,066 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:27:59,067 INFO L146 ILogger]: With dead ends: 788 [2019-05-23 09:27:59,067 INFO L146 ILogger]: Without dead ends: 788 [2019-05-23 09:27:59,067 INFO L146 ILogger]: 0 DeclaredPredicates, 775 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-05-23 09:27:59,068 INFO L146 ILogger]: Start minimizeSevpa. Operand 788 states. [2019-05-23 09:27:59,070 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 788 to 783. [2019-05-23 09:27:59,070 INFO L146 ILogger]: Start removeUnreachable. Operand 783 states. [2019-05-23 09:27:59,071 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 783 states to 783 states and 783 transitions. [2019-05-23 09:27:59,071 INFO L146 ILogger]: Start accepts. Automaton has 783 states and 783 transitions. Word has length 776 [2019-05-23 09:27:59,071 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:27:59,071 INFO L146 ILogger]: Abstraction has 783 states and 783 transitions. [2019-05-23 09:27:59,071 INFO L146 ILogger]: Interpolant automaton has 132 states. [2019-05-23 09:27:59,071 INFO L146 ILogger]: Start isEmpty. Operand 783 states and 783 transitions. [2019-05-23 09:27:59,075 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 783 [2019-05-23 09:27:59,075 INFO L146 ILogger]: Found error trace [2019-05-23 09:27:59,075 INFO L146 ILogger]: trace histogram [130, 130, 130, 130, 130, 130, 1, 1] [2019-05-23 09:27:59,075 INFO L146 ILogger]: === Iteration 131 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:27:59,075 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:27:59,075 INFO L146 ILogger]: Analyzing trace with hash -2101431297, now seen corresponding path program 130 times [2019-05-23 09:27:59,076 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:27:59,098 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:27:59,103 INFO L146 ILogger]: Trace formula consists of 1045 conjuncts, 132 conjunts are in the unsatisfiable core [2019-05-23 09:27:59,106 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:05,262 INFO L146 ILogger]: Checked inductivity of 50440 backedges. 0 proven. 50440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:05,262 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:05,263 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-05-23 09:28:05,263 INFO L146 ILogger]: Interpolant automaton has 133 states [2019-05-23 09:28:05,264 INFO L146 ILogger]: Constructing interpolant automaton starting with 133 interpolants. [2019-05-23 09:28:05,264 INFO L146 ILogger]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:28:05,264 INFO L146 ILogger]: Start difference. First operand 783 states and 783 transitions. Second operand 133 states. [2019-05-23 09:28:06,033 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:06,033 INFO L146 ILogger]: Finished difference Result 794 states and 794 transitions. [2019-05-23 09:28:06,033 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-05-23 09:28:06,033 INFO L146 ILogger]: Start accepts. Automaton has 133 states. Word has length 782 [2019-05-23 09:28:06,034 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:06,034 INFO L146 ILogger]: With dead ends: 794 [2019-05-23 09:28:06,034 INFO L146 ILogger]: Without dead ends: 794 [2019-05-23 09:28:06,035 INFO L146 ILogger]: 0 DeclaredPredicates, 781 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2019-05-23 09:28:06,035 INFO L146 ILogger]: Start minimizeSevpa. Operand 794 states. [2019-05-23 09:28:06,038 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 794 to 789. [2019-05-23 09:28:06,038 INFO L146 ILogger]: Start removeUnreachable. Operand 789 states. [2019-05-23 09:28:06,038 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 789 states to 789 states and 789 transitions. [2019-05-23 09:28:06,039 INFO L146 ILogger]: Start accepts. Automaton has 789 states and 789 transitions. Word has length 782 [2019-05-23 09:28:06,039 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:06,039 INFO L146 ILogger]: Abstraction has 789 states and 789 transitions. [2019-05-23 09:28:06,039 INFO L146 ILogger]: Interpolant automaton has 133 states. [2019-05-23 09:28:06,039 INFO L146 ILogger]: Start isEmpty. Operand 789 states and 789 transitions. [2019-05-23 09:28:06,042 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 789 [2019-05-23 09:28:06,043 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:06,043 INFO L146 ILogger]: trace histogram [131, 131, 131, 131, 131, 131, 1, 1] [2019-05-23 09:28:06,043 INFO L146 ILogger]: === Iteration 132 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:06,043 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:06,043 INFO L146 ILogger]: Analyzing trace with hash -393530820, now seen corresponding path program 131 times [2019-05-23 09:28:06,044 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:06,068 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:06,073 INFO L146 ILogger]: Trace formula consists of 1053 conjuncts, 133 conjunts are in the unsatisfiable core [2019-05-23 09:28:06,076 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:12,482 INFO L146 ILogger]: Checked inductivity of 51221 backedges. 0 proven. 51221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:12,483 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:12,483 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2019-05-23 09:28:12,483 INFO L146 ILogger]: Interpolant automaton has 134 states [2019-05-23 09:28:12,484 INFO L146 ILogger]: Constructing interpolant automaton starting with 134 interpolants. [2019-05-23 09:28:12,485 INFO L146 ILogger]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 09:28:12,485 INFO L146 ILogger]: Start difference. First operand 789 states and 789 transitions. Second operand 134 states. [2019-05-23 09:28:13,297 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:13,297 INFO L146 ILogger]: Finished difference Result 800 states and 800 transitions. [2019-05-23 09:28:13,297 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-05-23 09:28:13,298 INFO L146 ILogger]: Start accepts. Automaton has 134 states. Word has length 788 [2019-05-23 09:28:13,298 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:13,299 INFO L146 ILogger]: With dead ends: 800 [2019-05-23 09:28:13,299 INFO L146 ILogger]: Without dead ends: 800 [2019-05-23 09:28:13,299 INFO L146 ILogger]: 0 DeclaredPredicates, 787 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-05-23 09:28:13,300 INFO L146 ILogger]: Start minimizeSevpa. Operand 800 states. [2019-05-23 09:28:13,303 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 800 to 795. [2019-05-23 09:28:13,303 INFO L146 ILogger]: Start removeUnreachable. Operand 795 states. [2019-05-23 09:28:13,303 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 795 states to 795 states and 795 transitions. [2019-05-23 09:28:13,303 INFO L146 ILogger]: Start accepts. Automaton has 795 states and 795 transitions. Word has length 788 [2019-05-23 09:28:13,304 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:13,304 INFO L146 ILogger]: Abstraction has 795 states and 795 transitions. [2019-05-23 09:28:13,304 INFO L146 ILogger]: Interpolant automaton has 134 states. [2019-05-23 09:28:13,304 INFO L146 ILogger]: Start isEmpty. Operand 795 states and 795 transitions. [2019-05-23 09:28:13,307 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 795 [2019-05-23 09:28:13,307 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:13,308 INFO L146 ILogger]: trace histogram [132, 132, 132, 132, 132, 132, 1, 1] [2019-05-23 09:28:13,308 INFO L146 ILogger]: === Iteration 133 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:13,308 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:13,308 INFO L146 ILogger]: Analyzing trace with hash -1319285063, now seen corresponding path program 132 times [2019-05-23 09:28:13,309 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:13,332 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:13,336 INFO L146 ILogger]: Trace formula consists of 1061 conjuncts, 134 conjunts are in the unsatisfiable core [2019-05-23 09:28:13,339 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:19,897 INFO L146 ILogger]: Checked inductivity of 52008 backedges. 0 proven. 52008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:19,897 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:19,897 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2019-05-23 09:28:19,898 INFO L146 ILogger]: Interpolant automaton has 135 states [2019-05-23 09:28:19,898 INFO L146 ILogger]: Constructing interpolant automaton starting with 135 interpolants. [2019-05-23 09:28:19,899 INFO L146 ILogger]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:28:19,899 INFO L146 ILogger]: Start difference. First operand 795 states and 795 transitions. Second operand 135 states. [2019-05-23 09:28:20,707 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:20,707 INFO L146 ILogger]: Finished difference Result 806 states and 806 transitions. [2019-05-23 09:28:20,707 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-05-23 09:28:20,708 INFO L146 ILogger]: Start accepts. Automaton has 135 states. Word has length 794 [2019-05-23 09:28:20,708 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:20,709 INFO L146 ILogger]: With dead ends: 806 [2019-05-23 09:28:20,709 INFO L146 ILogger]: Without dead ends: 806 [2019-05-23 09:28:20,709 INFO L146 ILogger]: 0 DeclaredPredicates, 793 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2019-05-23 09:28:20,710 INFO L146 ILogger]: Start minimizeSevpa. Operand 806 states. [2019-05-23 09:28:20,713 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 806 to 801. [2019-05-23 09:28:20,713 INFO L146 ILogger]: Start removeUnreachable. Operand 801 states. [2019-05-23 09:28:20,713 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 801 states to 801 states and 801 transitions. [2019-05-23 09:28:20,713 INFO L146 ILogger]: Start accepts. Automaton has 801 states and 801 transitions. Word has length 794 [2019-05-23 09:28:20,714 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:20,714 INFO L146 ILogger]: Abstraction has 801 states and 801 transitions. [2019-05-23 09:28:20,714 INFO L146 ILogger]: Interpolant automaton has 135 states. [2019-05-23 09:28:20,714 INFO L146 ILogger]: Start isEmpty. Operand 801 states and 801 transitions. [2019-05-23 09:28:20,717 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 801 [2019-05-23 09:28:20,717 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:20,718 INFO L146 ILogger]: trace histogram [133, 133, 133, 133, 133, 133, 1, 1] [2019-05-23 09:28:20,718 INFO L146 ILogger]: === Iteration 134 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:20,718 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:20,718 INFO L146 ILogger]: Analyzing trace with hash 395663734, now seen corresponding path program 133 times [2019-05-23 09:28:20,719 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:20,742 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:20,747 INFO L146 ILogger]: Trace formula consists of 1069 conjuncts, 135 conjunts are in the unsatisfiable core [2019-05-23 09:28:20,750 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:27,265 INFO L146 ILogger]: Checked inductivity of 52801 backedges. 0 proven. 52801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:27,265 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:27,265 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2019-05-23 09:28:27,265 INFO L146 ILogger]: Interpolant automaton has 136 states [2019-05-23 09:28:27,266 INFO L146 ILogger]: Constructing interpolant automaton starting with 136 interpolants. [2019-05-23 09:28:27,267 INFO L146 ILogger]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 09:28:27,267 INFO L146 ILogger]: Start difference. First operand 801 states and 801 transitions. Second operand 136 states. [2019-05-23 09:28:28,087 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:28,088 INFO L146 ILogger]: Finished difference Result 812 states and 812 transitions. [2019-05-23 09:28:28,088 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-05-23 09:28:28,088 INFO L146 ILogger]: Start accepts. Automaton has 136 states. Word has length 800 [2019-05-23 09:28:28,089 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:28,089 INFO L146 ILogger]: With dead ends: 812 [2019-05-23 09:28:28,089 INFO L146 ILogger]: Without dead ends: 812 [2019-05-23 09:28:28,090 INFO L146 ILogger]: 0 DeclaredPredicates, 799 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-05-23 09:28:28,091 INFO L146 ILogger]: Start minimizeSevpa. Operand 812 states. [2019-05-23 09:28:28,093 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 812 to 807. [2019-05-23 09:28:28,093 INFO L146 ILogger]: Start removeUnreachable. Operand 807 states. [2019-05-23 09:28:28,094 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 807 states to 807 states and 807 transitions. [2019-05-23 09:28:28,094 INFO L146 ILogger]: Start accepts. Automaton has 807 states and 807 transitions. Word has length 800 [2019-05-23 09:28:28,094 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:28,094 INFO L146 ILogger]: Abstraction has 807 states and 807 transitions. [2019-05-23 09:28:28,094 INFO L146 ILogger]: Interpolant automaton has 136 states. [2019-05-23 09:28:28,095 INFO L146 ILogger]: Start isEmpty. Operand 807 states and 807 transitions. [2019-05-23 09:28:28,098 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 807 [2019-05-23 09:28:28,098 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:28,098 INFO L146 ILogger]: trace histogram [134, 134, 134, 134, 134, 134, 1, 1] [2019-05-23 09:28:28,098 INFO L146 ILogger]: === Iteration 135 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:28,099 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:28,099 INFO L146 ILogger]: Analyzing trace with hash 1548915, now seen corresponding path program 134 times [2019-05-23 09:28:28,099 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:28,122 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:28,128 INFO L146 ILogger]: Trace formula consists of 1077 conjuncts, 136 conjunts are in the unsatisfiable core [2019-05-23 09:28:28,131 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:34,946 INFO L146 ILogger]: Checked inductivity of 53600 backedges. 0 proven. 53600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:34,947 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:34,947 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2019-05-23 09:28:34,947 INFO L146 ILogger]: Interpolant automaton has 137 states [2019-05-23 09:28:34,948 INFO L146 ILogger]: Constructing interpolant automaton starting with 137 interpolants. [2019-05-23 09:28:34,949 INFO L146 ILogger]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:28:34,949 INFO L146 ILogger]: Start difference. First operand 807 states and 807 transitions. Second operand 137 states. [2019-05-23 09:28:35,797 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:35,797 INFO L146 ILogger]: Finished difference Result 818 states and 818 transitions. [2019-05-23 09:28:35,797 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-05-23 09:28:35,797 INFO L146 ILogger]: Start accepts. Automaton has 137 states. Word has length 806 [2019-05-23 09:28:35,798 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:35,799 INFO L146 ILogger]: With dead ends: 818 [2019-05-23 09:28:35,799 INFO L146 ILogger]: Without dead ends: 818 [2019-05-23 09:28:35,799 INFO L146 ILogger]: 0 DeclaredPredicates, 805 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2019-05-23 09:28:35,800 INFO L146 ILogger]: Start minimizeSevpa. Operand 818 states. [2019-05-23 09:28:35,803 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 818 to 813. [2019-05-23 09:28:35,804 INFO L146 ILogger]: Start removeUnreachable. Operand 813 states. [2019-05-23 09:28:35,804 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 813 states to 813 states and 813 transitions. [2019-05-23 09:28:35,805 INFO L146 ILogger]: Start accepts. Automaton has 813 states and 813 transitions. Word has length 806 [2019-05-23 09:28:35,805 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:35,805 INFO L146 ILogger]: Abstraction has 813 states and 813 transitions. [2019-05-23 09:28:35,805 INFO L146 ILogger]: Interpolant automaton has 137 states. [2019-05-23 09:28:35,805 INFO L146 ILogger]: Start isEmpty. Operand 813 states and 813 transitions. [2019-05-23 09:28:35,809 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 813 [2019-05-23 09:28:35,809 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:35,809 INFO L146 ILogger]: trace histogram [135, 135, 135, 135, 135, 135, 1, 1] [2019-05-23 09:28:35,809 INFO L146 ILogger]: === Iteration 136 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:35,810 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:35,810 INFO L146 ILogger]: Analyzing trace with hash 122452400, now seen corresponding path program 135 times [2019-05-23 09:28:35,810 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:35,836 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:35,841 INFO L146 ILogger]: Trace formula consists of 1085 conjuncts, 137 conjunts are in the unsatisfiable core [2019-05-23 09:28:35,844 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:42,614 INFO L146 ILogger]: Checked inductivity of 54405 backedges. 0 proven. 54405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:42,615 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:42,615 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2019-05-23 09:28:42,615 INFO L146 ILogger]: Interpolant automaton has 138 states [2019-05-23 09:28:42,616 INFO L146 ILogger]: Constructing interpolant automaton starting with 138 interpolants. [2019-05-23 09:28:42,617 INFO L146 ILogger]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-05-23 09:28:42,617 INFO L146 ILogger]: Start difference. First operand 813 states and 813 transitions. Second operand 138 states. [2019-05-23 09:28:43,524 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:43,525 INFO L146 ILogger]: Finished difference Result 824 states and 824 transitions. [2019-05-23 09:28:43,525 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-05-23 09:28:43,525 INFO L146 ILogger]: Start accepts. Automaton has 138 states. Word has length 812 [2019-05-23 09:28:43,526 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:43,526 INFO L146 ILogger]: With dead ends: 824 [2019-05-23 09:28:43,526 INFO L146 ILogger]: Without dead ends: 824 [2019-05-23 09:28:43,527 INFO L146 ILogger]: 0 DeclaredPredicates, 811 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-05-23 09:28:43,528 INFO L146 ILogger]: Start minimizeSevpa. Operand 824 states. [2019-05-23 09:28:43,530 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 824 to 819. [2019-05-23 09:28:43,531 INFO L146 ILogger]: Start removeUnreachable. Operand 819 states. [2019-05-23 09:28:43,531 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 819 states to 819 states and 819 transitions. [2019-05-23 09:28:43,531 INFO L146 ILogger]: Start accepts. Automaton has 819 states and 819 transitions. Word has length 812 [2019-05-23 09:28:43,532 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:43,532 INFO L146 ILogger]: Abstraction has 819 states and 819 transitions. [2019-05-23 09:28:43,532 INFO L146 ILogger]: Interpolant automaton has 138 states. [2019-05-23 09:28:43,532 INFO L146 ILogger]: Start isEmpty. Operand 819 states and 819 transitions. [2019-05-23 09:28:43,535 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 819 [2019-05-23 09:28:43,535 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:43,536 INFO L146 ILogger]: trace histogram [136, 136, 136, 136, 136, 136, 1, 1] [2019-05-23 09:28:43,536 INFO L146 ILogger]: === Iteration 137 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:43,536 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:43,536 INFO L146 ILogger]: Analyzing trace with hash -836751571, now seen corresponding path program 136 times [2019-05-23 09:28:43,536 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:43,568 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:43,576 INFO L146 ILogger]: Trace formula consists of 1093 conjuncts, 138 conjunts are in the unsatisfiable core [2019-05-23 09:28:43,580 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:50,849 INFO L146 ILogger]: Checked inductivity of 55216 backedges. 0 proven. 55216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:50,849 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:50,849 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2019-05-23 09:28:50,850 INFO L146 ILogger]: Interpolant automaton has 139 states [2019-05-23 09:28:50,850 INFO L146 ILogger]: Constructing interpolant automaton starting with 139 interpolants. [2019-05-23 09:28:50,851 INFO L146 ILogger]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:28:50,851 INFO L146 ILogger]: Start difference. First operand 819 states and 819 transitions. Second operand 139 states. [2019-05-23 09:28:51,753 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:51,753 INFO L146 ILogger]: Finished difference Result 830 states and 830 transitions. [2019-05-23 09:28:51,753 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-05-23 09:28:51,753 INFO L146 ILogger]: Start accepts. Automaton has 139 states. Word has length 818 [2019-05-23 09:28:51,754 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:51,755 INFO L146 ILogger]: With dead ends: 830 [2019-05-23 09:28:51,755 INFO L146 ILogger]: Without dead ends: 830 [2019-05-23 09:28:51,755 INFO L146 ILogger]: 0 DeclaredPredicates, 817 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2019-05-23 09:28:51,756 INFO L146 ILogger]: Start minimizeSevpa. Operand 830 states. [2019-05-23 09:28:51,758 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 830 to 825. [2019-05-23 09:28:51,758 INFO L146 ILogger]: Start removeUnreachable. Operand 825 states. [2019-05-23 09:28:51,759 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 825 states to 825 states and 825 transitions. [2019-05-23 09:28:51,759 INFO L146 ILogger]: Start accepts. Automaton has 825 states and 825 transitions. Word has length 818 [2019-05-23 09:28:51,759 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:51,759 INFO L146 ILogger]: Abstraction has 825 states and 825 transitions. [2019-05-23 09:28:51,759 INFO L146 ILogger]: Interpolant automaton has 139 states. [2019-05-23 09:28:51,760 INFO L146 ILogger]: Start isEmpty. Operand 825 states and 825 transitions. [2019-05-23 09:28:51,763 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 825 [2019-05-23 09:28:51,763 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:51,763 INFO L146 ILogger]: trace histogram [137, 137, 137, 137, 137, 137, 1, 1] [2019-05-23 09:28:51,763 INFO L146 ILogger]: === Iteration 138 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:51,763 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:51,763 INFO L146 ILogger]: Analyzing trace with hash -2029841686, now seen corresponding path program 137 times [2019-05-23 09:28:51,764 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:51,788 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:51,797 INFO L146 ILogger]: Trace formula consists of 1101 conjuncts, 139 conjunts are in the unsatisfiable core [2019-05-23 09:28:51,801 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:28:58,850 INFO L146 ILogger]: Checked inductivity of 56033 backedges. 0 proven. 56033 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:28:58,850 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:28:58,850 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2019-05-23 09:28:58,851 INFO L146 ILogger]: Interpolant automaton has 140 states [2019-05-23 09:28:58,851 INFO L146 ILogger]: Constructing interpolant automaton starting with 140 interpolants. [2019-05-23 09:28:58,852 INFO L146 ILogger]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 09:28:58,852 INFO L146 ILogger]: Start difference. First operand 825 states and 825 transitions. Second operand 140 states. [2019-05-23 09:28:59,764 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:28:59,764 INFO L146 ILogger]: Finished difference Result 836 states and 836 transitions. [2019-05-23 09:28:59,764 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-05-23 09:28:59,764 INFO L146 ILogger]: Start accepts. Automaton has 140 states. Word has length 824 [2019-05-23 09:28:59,765 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:28:59,765 INFO L146 ILogger]: With dead ends: 836 [2019-05-23 09:28:59,765 INFO L146 ILogger]: Without dead ends: 836 [2019-05-23 09:28:59,766 INFO L146 ILogger]: 0 DeclaredPredicates, 823 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-05-23 09:28:59,766 INFO L146 ILogger]: Start minimizeSevpa. Operand 836 states. [2019-05-23 09:28:59,769 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 836 to 831. [2019-05-23 09:28:59,769 INFO L146 ILogger]: Start removeUnreachable. Operand 831 states. [2019-05-23 09:28:59,770 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 831 states to 831 states and 831 transitions. [2019-05-23 09:28:59,770 INFO L146 ILogger]: Start accepts. Automaton has 831 states and 831 transitions. Word has length 824 [2019-05-23 09:28:59,770 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:28:59,770 INFO L146 ILogger]: Abstraction has 831 states and 831 transitions. [2019-05-23 09:28:59,770 INFO L146 ILogger]: Interpolant automaton has 140 states. [2019-05-23 09:28:59,770 INFO L146 ILogger]: Start isEmpty. Operand 831 states and 831 transitions. [2019-05-23 09:28:59,774 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 831 [2019-05-23 09:28:59,774 INFO L146 ILogger]: Found error trace [2019-05-23 09:28:59,774 INFO L146 ILogger]: trace histogram [138, 138, 138, 138, 138, 138, 1, 1] [2019-05-23 09:28:59,774 INFO L146 ILogger]: === Iteration 139 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:28:59,774 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:28:59,775 INFO L146 ILogger]: Analyzing trace with hash -1024887577, now seen corresponding path program 138 times [2019-05-23 09:28:59,775 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:28:59,800 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:28:59,805 INFO L146 ILogger]: Trace formula consists of 1109 conjuncts, 140 conjunts are in the unsatisfiable core [2019-05-23 09:28:59,808 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:06,906 INFO L146 ILogger]: Checked inductivity of 56856 backedges. 0 proven. 56856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:06,906 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:06,906 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-05-23 09:29:06,907 INFO L146 ILogger]: Interpolant automaton has 141 states [2019-05-23 09:29:06,908 INFO L146 ILogger]: Constructing interpolant automaton starting with 141 interpolants. [2019-05-23 09:29:06,908 INFO L146 ILogger]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:29:06,908 INFO L146 ILogger]: Start difference. First operand 831 states and 831 transitions. Second operand 141 states. [2019-05-23 09:29:07,842 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:07,842 INFO L146 ILogger]: Finished difference Result 842 states and 842 transitions. [2019-05-23 09:29:07,843 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-05-23 09:29:07,843 INFO L146 ILogger]: Start accepts. Automaton has 141 states. Word has length 830 [2019-05-23 09:29:07,844 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:07,844 INFO L146 ILogger]: With dead ends: 842 [2019-05-23 09:29:07,844 INFO L146 ILogger]: Without dead ends: 842 [2019-05-23 09:29:07,845 INFO L146 ILogger]: 0 DeclaredPredicates, 829 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2019-05-23 09:29:07,845 INFO L146 ILogger]: Start minimizeSevpa. Operand 842 states. [2019-05-23 09:29:07,848 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 842 to 837. [2019-05-23 09:29:07,848 INFO L146 ILogger]: Start removeUnreachable. Operand 837 states. [2019-05-23 09:29:07,849 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 837 states to 837 states and 837 transitions. [2019-05-23 09:29:07,849 INFO L146 ILogger]: Start accepts. Automaton has 837 states and 837 transitions. Word has length 830 [2019-05-23 09:29:07,849 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:07,849 INFO L146 ILogger]: Abstraction has 837 states and 837 transitions. [2019-05-23 09:29:07,849 INFO L146 ILogger]: Interpolant automaton has 141 states. [2019-05-23 09:29:07,849 INFO L146 ILogger]: Start isEmpty. Operand 837 states and 837 transitions. [2019-05-23 09:29:07,853 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 837 [2019-05-23 09:29:07,853 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:07,853 INFO L146 ILogger]: trace histogram [139, 139, 139, 139, 139, 139, 1, 1] [2019-05-23 09:29:07,853 INFO L146 ILogger]: === Iteration 140 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:07,854 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:07,854 INFO L146 ILogger]: Analyzing trace with hash 2118886692, now seen corresponding path program 139 times [2019-05-23 09:29:07,854 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:07,879 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:07,884 INFO L146 ILogger]: Trace formula consists of 1117 conjuncts, 141 conjunts are in the unsatisfiable core [2019-05-23 09:29:07,887 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:14,944 INFO L146 ILogger]: Checked inductivity of 57685 backedges. 0 proven. 57685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:14,944 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:14,944 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2019-05-23 09:29:14,945 INFO L146 ILogger]: Interpolant automaton has 142 states [2019-05-23 09:29:14,946 INFO L146 ILogger]: Constructing interpolant automaton starting with 142 interpolants. [2019-05-23 09:29:14,946 INFO L146 ILogger]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 09:29:14,947 INFO L146 ILogger]: Start difference. First operand 837 states and 837 transitions. Second operand 142 states. [2019-05-23 09:29:15,922 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:15,922 INFO L146 ILogger]: Finished difference Result 848 states and 848 transitions. [2019-05-23 09:29:15,922 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-05-23 09:29:15,922 INFO L146 ILogger]: Start accepts. Automaton has 142 states. Word has length 836 [2019-05-23 09:29:15,923 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:15,924 INFO L146 ILogger]: With dead ends: 848 [2019-05-23 09:29:15,924 INFO L146 ILogger]: Without dead ends: 848 [2019-05-23 09:29:15,925 INFO L146 ILogger]: 0 DeclaredPredicates, 835 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-05-23 09:29:15,925 INFO L146 ILogger]: Start minimizeSevpa. Operand 848 states. [2019-05-23 09:29:15,928 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 848 to 843. [2019-05-23 09:29:15,928 INFO L146 ILogger]: Start removeUnreachable. Operand 843 states. [2019-05-23 09:29:15,929 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2019-05-23 09:29:15,929 INFO L146 ILogger]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 836 [2019-05-23 09:29:15,929 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:15,929 INFO L146 ILogger]: Abstraction has 843 states and 843 transitions. [2019-05-23 09:29:15,929 INFO L146 ILogger]: Interpolant automaton has 142 states. [2019-05-23 09:29:15,929 INFO L146 ILogger]: Start isEmpty. Operand 843 states and 843 transitions. [2019-05-23 09:29:15,933 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 843 [2019-05-23 09:29:15,933 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:15,933 INFO L146 ILogger]: trace histogram [140, 140, 140, 140, 140, 140, 1, 1] [2019-05-23 09:29:15,933 INFO L146 ILogger]: === Iteration 141 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:15,933 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:15,933 INFO L146 ILogger]: Analyzing trace with hash 1847980961, now seen corresponding path program 140 times [2019-05-23 09:29:15,934 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:15,959 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:15,964 INFO L146 ILogger]: Trace formula consists of 1125 conjuncts, 142 conjunts are in the unsatisfiable core [2019-05-23 09:29:15,967 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:23,236 INFO L146 ILogger]: Checked inductivity of 58520 backedges. 0 proven. 58520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:23,236 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:23,236 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2019-05-23 09:29:23,237 INFO L146 ILogger]: Interpolant automaton has 143 states [2019-05-23 09:29:23,237 INFO L146 ILogger]: Constructing interpolant automaton starting with 143 interpolants. [2019-05-23 09:29:23,238 INFO L146 ILogger]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:29:23,238 INFO L146 ILogger]: Start difference. First operand 843 states and 843 transitions. Second operand 143 states. [2019-05-23 09:29:24,177 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:24,177 INFO L146 ILogger]: Finished difference Result 854 states and 854 transitions. [2019-05-23 09:29:24,178 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-05-23 09:29:24,178 INFO L146 ILogger]: Start accepts. Automaton has 143 states. Word has length 842 [2019-05-23 09:29:24,178 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:24,179 INFO L146 ILogger]: With dead ends: 854 [2019-05-23 09:29:24,179 INFO L146 ILogger]: Without dead ends: 854 [2019-05-23 09:29:24,180 INFO L146 ILogger]: 0 DeclaredPredicates, 841 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2019-05-23 09:29:24,180 INFO L146 ILogger]: Start minimizeSevpa. Operand 854 states. [2019-05-23 09:29:24,183 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 854 to 849. [2019-05-23 09:29:24,183 INFO L146 ILogger]: Start removeUnreachable. Operand 849 states. [2019-05-23 09:29:24,183 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 849 states to 849 states and 849 transitions. [2019-05-23 09:29:24,183 INFO L146 ILogger]: Start accepts. Automaton has 849 states and 849 transitions. Word has length 842 [2019-05-23 09:29:24,184 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:24,184 INFO L146 ILogger]: Abstraction has 849 states and 849 transitions. [2019-05-23 09:29:24,184 INFO L146 ILogger]: Interpolant automaton has 143 states. [2019-05-23 09:29:24,184 INFO L146 ILogger]: Start isEmpty. Operand 849 states and 849 transitions. [2019-05-23 09:29:24,188 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 849 [2019-05-23 09:29:24,188 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:24,188 INFO L146 ILogger]: trace histogram [141, 141, 141, 141, 141, 141, 1, 1] [2019-05-23 09:29:24,188 INFO L146 ILogger]: === Iteration 142 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:24,188 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:24,188 INFO L146 ILogger]: Analyzing trace with hash -1929858978, now seen corresponding path program 141 times [2019-05-23 09:29:24,189 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:24,214 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:24,220 INFO L146 ILogger]: Trace formula consists of 1133 conjuncts, 143 conjunts are in the unsatisfiable core [2019-05-23 09:29:24,223 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:31,811 INFO L146 ILogger]: Checked inductivity of 59361 backedges. 0 proven. 59361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:31,812 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:31,812 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2019-05-23 09:29:31,812 INFO L146 ILogger]: Interpolant automaton has 144 states [2019-05-23 09:29:31,813 INFO L146 ILogger]: Constructing interpolant automaton starting with 144 interpolants. [2019-05-23 09:29:31,814 INFO L146 ILogger]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 09:29:31,814 INFO L146 ILogger]: Start difference. First operand 849 states and 849 transitions. Second operand 144 states. [2019-05-23 09:29:32,826 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:32,827 INFO L146 ILogger]: Finished difference Result 860 states and 860 transitions. [2019-05-23 09:29:32,827 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-05-23 09:29:32,827 INFO L146 ILogger]: Start accepts. Automaton has 144 states. Word has length 848 [2019-05-23 09:29:32,828 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:32,828 INFO L146 ILogger]: With dead ends: 860 [2019-05-23 09:29:32,828 INFO L146 ILogger]: Without dead ends: 860 [2019-05-23 09:29:32,829 INFO L146 ILogger]: 0 DeclaredPredicates, 847 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-05-23 09:29:32,829 INFO L146 ILogger]: Start minimizeSevpa. Operand 860 states. [2019-05-23 09:29:32,833 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 860 to 855. [2019-05-23 09:29:32,833 INFO L146 ILogger]: Start removeUnreachable. Operand 855 states. [2019-05-23 09:29:32,834 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 855 states to 855 states and 855 transitions. [2019-05-23 09:29:32,834 INFO L146 ILogger]: Start accepts. Automaton has 855 states and 855 transitions. Word has length 848 [2019-05-23 09:29:32,834 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:32,834 INFO L146 ILogger]: Abstraction has 855 states and 855 transitions. [2019-05-23 09:29:32,834 INFO L146 ILogger]: Interpolant automaton has 144 states. [2019-05-23 09:29:32,834 INFO L146 ILogger]: Start isEmpty. Operand 855 states and 855 transitions. [2019-05-23 09:29:32,838 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 855 [2019-05-23 09:29:32,838 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:32,838 INFO L146 ILogger]: trace histogram [142, 142, 142, 142, 142, 142, 1, 1] [2019-05-23 09:29:32,839 INFO L146 ILogger]: === Iteration 143 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:32,839 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:32,839 INFO L146 ILogger]: Analyzing trace with hash -406312101, now seen corresponding path program 142 times [2019-05-23 09:29:32,839 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:32,874 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:32,883 INFO L146 ILogger]: Trace formula consists of 1141 conjuncts, 144 conjunts are in the unsatisfiable core [2019-05-23 09:29:32,887 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:40,536 INFO L146 ILogger]: Checked inductivity of 60208 backedges. 0 proven. 60208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:40,536 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:40,536 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2019-05-23 09:29:40,537 INFO L146 ILogger]: Interpolant automaton has 145 states [2019-05-23 09:29:40,538 INFO L146 ILogger]: Constructing interpolant automaton starting with 145 interpolants. [2019-05-23 09:29:40,538 INFO L146 ILogger]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:29:40,538 INFO L146 ILogger]: Start difference. First operand 855 states and 855 transitions. Second operand 145 states. [2019-05-23 09:29:41,597 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:41,598 INFO L146 ILogger]: Finished difference Result 866 states and 866 transitions. [2019-05-23 09:29:41,598 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-05-23 09:29:41,598 INFO L146 ILogger]: Start accepts. Automaton has 145 states. Word has length 854 [2019-05-23 09:29:41,599 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:41,600 INFO L146 ILogger]: With dead ends: 866 [2019-05-23 09:29:41,600 INFO L146 ILogger]: Without dead ends: 866 [2019-05-23 09:29:41,601 INFO L146 ILogger]: 0 DeclaredPredicates, 853 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2019-05-23 09:29:41,602 INFO L146 ILogger]: Start minimizeSevpa. Operand 866 states. [2019-05-23 09:29:41,605 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 866 to 861. [2019-05-23 09:29:41,605 INFO L146 ILogger]: Start removeUnreachable. Operand 861 states. [2019-05-23 09:29:41,606 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 861 states to 861 states and 861 transitions. [2019-05-23 09:29:41,606 INFO L146 ILogger]: Start accepts. Automaton has 861 states and 861 transitions. Word has length 854 [2019-05-23 09:29:41,606 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:41,606 INFO L146 ILogger]: Abstraction has 861 states and 861 transitions. [2019-05-23 09:29:41,606 INFO L146 ILogger]: Interpolant automaton has 145 states. [2019-05-23 09:29:41,606 INFO L146 ILogger]: Start isEmpty. Operand 861 states and 861 transitions. [2019-05-23 09:29:41,610 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 861 [2019-05-23 09:29:41,610 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:41,611 INFO L146 ILogger]: trace histogram [143, 143, 143, 143, 143, 143, 1, 1] [2019-05-23 09:29:41,611 INFO L146 ILogger]: === Iteration 144 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:41,611 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:41,611 INFO L146 ILogger]: Analyzing trace with hash -1424182120, now seen corresponding path program 143 times [2019-05-23 09:29:41,612 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:41,638 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:41,644 INFO L146 ILogger]: Trace formula consists of 1149 conjuncts, 145 conjunts are in the unsatisfiable core [2019-05-23 09:29:41,646 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:49,154 INFO L146 ILogger]: Checked inductivity of 61061 backedges. 0 proven. 61061 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:49,155 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:49,155 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2019-05-23 09:29:49,155 INFO L146 ILogger]: Interpolant automaton has 146 states [2019-05-23 09:29:49,156 INFO L146 ILogger]: Constructing interpolant automaton starting with 146 interpolants. [2019-05-23 09:29:49,157 INFO L146 ILogger]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 09:29:49,157 INFO L146 ILogger]: Start difference. First operand 861 states and 861 transitions. Second operand 146 states. [2019-05-23 09:29:50,171 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:50,172 INFO L146 ILogger]: Finished difference Result 872 states and 872 transitions. [2019-05-23 09:29:50,172 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-05-23 09:29:50,172 INFO L146 ILogger]: Start accepts. Automaton has 146 states. Word has length 860 [2019-05-23 09:29:50,173 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:50,174 INFO L146 ILogger]: With dead ends: 872 [2019-05-23 09:29:50,174 INFO L146 ILogger]: Without dead ends: 872 [2019-05-23 09:29:50,175 INFO L146 ILogger]: 0 DeclaredPredicates, 859 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-05-23 09:29:50,176 INFO L146 ILogger]: Start minimizeSevpa. Operand 872 states. [2019-05-23 09:29:50,178 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 872 to 867. [2019-05-23 09:29:50,178 INFO L146 ILogger]: Start removeUnreachable. Operand 867 states. [2019-05-23 09:29:50,179 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 867 states to 867 states and 867 transitions. [2019-05-23 09:29:50,179 INFO L146 ILogger]: Start accepts. Automaton has 867 states and 867 transitions. Word has length 860 [2019-05-23 09:29:50,179 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:50,179 INFO L146 ILogger]: Abstraction has 867 states and 867 transitions. [2019-05-23 09:29:50,179 INFO L146 ILogger]: Interpolant automaton has 146 states. [2019-05-23 09:29:50,179 INFO L146 ILogger]: Start isEmpty. Operand 867 states and 867 transitions. [2019-05-23 09:29:50,183 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 867 [2019-05-23 09:29:50,183 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:50,183 INFO L146 ILogger]: trace histogram [144, 144, 144, 144, 144, 144, 1, 1] [2019-05-23 09:29:50,183 INFO L146 ILogger]: === Iteration 145 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:50,183 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:50,184 INFO L146 ILogger]: Analyzing trace with hash 1879219221, now seen corresponding path program 144 times [2019-05-23 09:29:50,184 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:50,210 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:50,216 INFO L146 ILogger]: Trace formula consists of 1157 conjuncts, 146 conjunts are in the unsatisfiable core [2019-05-23 09:29:50,219 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:29:58,132 INFO L146 ILogger]: Checked inductivity of 61920 backedges. 0 proven. 61920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:29:58,132 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:29:58,133 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2019-05-23 09:29:58,133 INFO L146 ILogger]: Interpolant automaton has 147 states [2019-05-23 09:29:58,134 INFO L146 ILogger]: Constructing interpolant automaton starting with 147 interpolants. [2019-05-23 09:29:58,135 INFO L146 ILogger]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:29:58,135 INFO L146 ILogger]: Start difference. First operand 867 states and 867 transitions. Second operand 147 states. [2019-05-23 09:29:59,229 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:29:59,229 INFO L146 ILogger]: Finished difference Result 878 states and 878 transitions. [2019-05-23 09:29:59,229 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-05-23 09:29:59,229 INFO L146 ILogger]: Start accepts. Automaton has 147 states. Word has length 866 [2019-05-23 09:29:59,230 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:29:59,230 INFO L146 ILogger]: With dead ends: 878 [2019-05-23 09:29:59,231 INFO L146 ILogger]: Without dead ends: 878 [2019-05-23 09:29:59,231 INFO L146 ILogger]: 0 DeclaredPredicates, 865 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2019-05-23 09:29:59,232 INFO L146 ILogger]: Start minimizeSevpa. Operand 878 states. [2019-05-23 09:29:59,235 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 878 to 873. [2019-05-23 09:29:59,235 INFO L146 ILogger]: Start removeUnreachable. Operand 873 states. [2019-05-23 09:29:59,236 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 873 states to 873 states and 873 transitions. [2019-05-23 09:29:59,236 INFO L146 ILogger]: Start accepts. Automaton has 873 states and 873 transitions. Word has length 866 [2019-05-23 09:29:59,236 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:29:59,236 INFO L146 ILogger]: Abstraction has 873 states and 873 transitions. [2019-05-23 09:29:59,236 INFO L146 ILogger]: Interpolant automaton has 147 states. [2019-05-23 09:29:59,236 INFO L146 ILogger]: Start isEmpty. Operand 873 states and 873 transitions. [2019-05-23 09:29:59,240 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 873 [2019-05-23 09:29:59,241 INFO L146 ILogger]: Found error trace [2019-05-23 09:29:59,241 INFO L146 ILogger]: trace histogram [145, 145, 145, 145, 145, 145, 1, 1] [2019-05-23 09:29:59,241 INFO L146 ILogger]: === Iteration 146 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:29:59,241 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:29:59,241 INFO L146 ILogger]: Analyzing trace with hash -922078766, now seen corresponding path program 145 times [2019-05-23 09:29:59,242 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:29:59,270 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:29:59,276 INFO L146 ILogger]: Trace formula consists of 1165 conjuncts, 147 conjunts are in the unsatisfiable core [2019-05-23 09:29:59,280 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:07,358 INFO L146 ILogger]: Checked inductivity of 62785 backedges. 0 proven. 62785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:07,358 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:07,359 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-05-23 09:30:07,359 INFO L146 ILogger]: Interpolant automaton has 148 states [2019-05-23 09:30:07,360 INFO L146 ILogger]: Constructing interpolant automaton starting with 148 interpolants. [2019-05-23 09:30:07,360 INFO L146 ILogger]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 09:30:07,360 INFO L146 ILogger]: Start difference. First operand 873 states and 873 transitions. Second operand 148 states. [2019-05-23 09:30:08,444 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:08,444 INFO L146 ILogger]: Finished difference Result 884 states and 884 transitions. [2019-05-23 09:30:08,449 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-05-23 09:30:08,449 INFO L146 ILogger]: Start accepts. Automaton has 148 states. Word has length 872 [2019-05-23 09:30:08,450 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:08,450 INFO L146 ILogger]: With dead ends: 884 [2019-05-23 09:30:08,450 INFO L146 ILogger]: Without dead ends: 884 [2019-05-23 09:30:08,451 INFO L146 ILogger]: 0 DeclaredPredicates, 871 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-05-23 09:30:08,451 INFO L146 ILogger]: Start minimizeSevpa. Operand 884 states. [2019-05-23 09:30:08,454 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 884 to 879. [2019-05-23 09:30:08,454 INFO L146 ILogger]: Start removeUnreachable. Operand 879 states. [2019-05-23 09:30:08,455 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 879 states to 879 states and 879 transitions. [2019-05-23 09:30:08,455 INFO L146 ILogger]: Start accepts. Automaton has 879 states and 879 transitions. Word has length 872 [2019-05-23 09:30:08,455 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:08,455 INFO L146 ILogger]: Abstraction has 879 states and 879 transitions. [2019-05-23 09:30:08,455 INFO L146 ILogger]: Interpolant automaton has 148 states. [2019-05-23 09:30:08,455 INFO L146 ILogger]: Start isEmpty. Operand 879 states and 879 transitions. [2019-05-23 09:30:08,459 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 879 [2019-05-23 09:30:08,459 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:08,460 INFO L146 ILogger]: trace histogram [146, 146, 146, 146, 146, 146, 1, 1] [2019-05-23 09:30:08,460 INFO L146 ILogger]: === Iteration 147 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:08,460 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:08,460 INFO L146 ILogger]: Analyzing trace with hash 256361935, now seen corresponding path program 146 times [2019-05-23 09:30:08,460 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:08,487 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:08,493 INFO L146 ILogger]: Trace formula consists of 1173 conjuncts, 148 conjunts are in the unsatisfiable core [2019-05-23 09:30:08,496 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:16,127 INFO L146 ILogger]: Checked inductivity of 63656 backedges. 0 proven. 63656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:16,127 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:16,127 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-05-23 09:30:16,128 INFO L146 ILogger]: Interpolant automaton has 149 states [2019-05-23 09:30:16,128 INFO L146 ILogger]: Constructing interpolant automaton starting with 149 interpolants. [2019-05-23 09:30:16,129 INFO L146 ILogger]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:30:16,129 INFO L146 ILogger]: Start difference. First operand 879 states and 879 transitions. Second operand 149 states. [2019-05-23 09:30:17,180 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:17,180 INFO L146 ILogger]: Finished difference Result 890 states and 890 transitions. [2019-05-23 09:30:17,180 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-05-23 09:30:17,181 INFO L146 ILogger]: Start accepts. Automaton has 149 states. Word has length 878 [2019-05-23 09:30:17,181 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:17,182 INFO L146 ILogger]: With dead ends: 890 [2019-05-23 09:30:17,182 INFO L146 ILogger]: Without dead ends: 890 [2019-05-23 09:30:17,183 INFO L146 ILogger]: 0 DeclaredPredicates, 877 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2019-05-23 09:30:17,184 INFO L146 ILogger]: Start minimizeSevpa. Operand 890 states. [2019-05-23 09:30:17,187 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 890 to 885. [2019-05-23 09:30:17,187 INFO L146 ILogger]: Start removeUnreachable. Operand 885 states. [2019-05-23 09:30:17,187 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 885 states to 885 states and 885 transitions. [2019-05-23 09:30:17,187 INFO L146 ILogger]: Start accepts. Automaton has 885 states and 885 transitions. Word has length 878 [2019-05-23 09:30:17,188 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:17,188 INFO L146 ILogger]: Abstraction has 885 states and 885 transitions. [2019-05-23 09:30:17,188 INFO L146 ILogger]: Interpolant automaton has 149 states. [2019-05-23 09:30:17,188 INFO L146 ILogger]: Start isEmpty. Operand 885 states and 885 transitions. [2019-05-23 09:30:17,192 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 885 [2019-05-23 09:30:17,192 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:17,192 INFO L146 ILogger]: trace histogram [147, 147, 147, 147, 147, 147, 1, 1] [2019-05-23 09:30:17,192 INFO L146 ILogger]: === Iteration 148 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:17,192 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:17,192 INFO L146 ILogger]: Analyzing trace with hash 1867753484, now seen corresponding path program 147 times [2019-05-23 09:30:17,193 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:17,219 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:17,225 INFO L146 ILogger]: Trace formula consists of 1181 conjuncts, 149 conjunts are in the unsatisfiable core [2019-05-23 09:30:17,228 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:25,052 INFO L146 ILogger]: Checked inductivity of 64533 backedges. 0 proven. 64533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:25,052 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:25,053 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2019-05-23 09:30:25,053 INFO L146 ILogger]: Interpolant automaton has 150 states [2019-05-23 09:30:25,054 INFO L146 ILogger]: Constructing interpolant automaton starting with 150 interpolants. [2019-05-23 09:30:25,055 INFO L146 ILogger]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-05-23 09:30:25,055 INFO L146 ILogger]: Start difference. First operand 885 states and 885 transitions. Second operand 150 states. [2019-05-23 09:30:26,085 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:26,085 INFO L146 ILogger]: Finished difference Result 896 states and 896 transitions. [2019-05-23 09:30:26,085 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-05-23 09:30:26,086 INFO L146 ILogger]: Start accepts. Automaton has 150 states. Word has length 884 [2019-05-23 09:30:26,086 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:26,087 INFO L146 ILogger]: With dead ends: 896 [2019-05-23 09:30:26,087 INFO L146 ILogger]: Without dead ends: 896 [2019-05-23 09:30:26,088 INFO L146 ILogger]: 0 DeclaredPredicates, 883 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-05-23 09:30:26,088 INFO L146 ILogger]: Start minimizeSevpa. Operand 896 states. [2019-05-23 09:30:26,092 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 896 to 891. [2019-05-23 09:30:26,092 INFO L146 ILogger]: Start removeUnreachable. Operand 891 states. [2019-05-23 09:30:26,092 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 891 states to 891 states and 891 transitions. [2019-05-23 09:30:26,092 INFO L146 ILogger]: Start accepts. Automaton has 891 states and 891 transitions. Word has length 884 [2019-05-23 09:30:26,093 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:26,093 INFO L146 ILogger]: Abstraction has 891 states and 891 transitions. [2019-05-23 09:30:26,093 INFO L146 ILogger]: Interpolant automaton has 150 states. [2019-05-23 09:30:26,093 INFO L146 ILogger]: Start isEmpty. Operand 891 states and 891 transitions. [2019-05-23 09:30:26,097 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 891 [2019-05-23 09:30:26,097 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:26,097 INFO L146 ILogger]: trace histogram [148, 148, 148, 148, 148, 148, 1, 1] [2019-05-23 09:30:26,097 INFO L146 ILogger]: === Iteration 149 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:26,098 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:26,098 INFO L146 ILogger]: Analyzing trace with hash 910829705, now seen corresponding path program 148 times [2019-05-23 09:30:26,098 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:26,125 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:26,131 INFO L146 ILogger]: Trace formula consists of 1189 conjuncts, 150 conjunts are in the unsatisfiable core [2019-05-23 09:30:26,134 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:34,352 INFO L146 ILogger]: Checked inductivity of 65416 backedges. 0 proven. 65416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:34,352 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:34,352 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2019-05-23 09:30:34,353 INFO L146 ILogger]: Interpolant automaton has 151 states [2019-05-23 09:30:34,354 INFO L146 ILogger]: Constructing interpolant automaton starting with 151 interpolants. [2019-05-23 09:30:34,354 INFO L146 ILogger]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:30:34,355 INFO L146 ILogger]: Start difference. First operand 891 states and 891 transitions. Second operand 151 states. [2019-05-23 09:30:35,384 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:35,384 INFO L146 ILogger]: Finished difference Result 902 states and 902 transitions. [2019-05-23 09:30:35,384 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-05-23 09:30:35,384 INFO L146 ILogger]: Start accepts. Automaton has 151 states. Word has length 890 [2019-05-23 09:30:35,385 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:35,386 INFO L146 ILogger]: With dead ends: 902 [2019-05-23 09:30:35,386 INFO L146 ILogger]: Without dead ends: 902 [2019-05-23 09:30:35,387 INFO L146 ILogger]: 0 DeclaredPredicates, 889 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2019-05-23 09:30:35,387 INFO L146 ILogger]: Start minimizeSevpa. Operand 902 states. [2019-05-23 09:30:35,390 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 902 to 897. [2019-05-23 09:30:35,390 INFO L146 ILogger]: Start removeUnreachable. Operand 897 states. [2019-05-23 09:30:35,391 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 897 states to 897 states and 897 transitions. [2019-05-23 09:30:35,391 INFO L146 ILogger]: Start accepts. Automaton has 897 states and 897 transitions. Word has length 890 [2019-05-23 09:30:35,391 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:35,391 INFO L146 ILogger]: Abstraction has 897 states and 897 transitions. [2019-05-23 09:30:35,391 INFO L146 ILogger]: Interpolant automaton has 151 states. [2019-05-23 09:30:35,391 INFO L146 ILogger]: Start isEmpty. Operand 897 states and 897 transitions. [2019-05-23 09:30:35,395 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 897 [2019-05-23 09:30:35,395 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:35,395 INFO L146 ILogger]: trace histogram [149, 149, 149, 149, 149, 149, 1, 1] [2019-05-23 09:30:35,395 INFO L146 ILogger]: === Iteration 150 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:35,396 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:35,396 INFO L146 ILogger]: Analyzing trace with hash 1590400838, now seen corresponding path program 149 times [2019-05-23 09:30:35,396 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:35,423 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:35,433 INFO L146 ILogger]: Trace formula consists of 1197 conjuncts, 151 conjunts are in the unsatisfiable core [2019-05-23 09:30:35,438 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:43,653 INFO L146 ILogger]: Checked inductivity of 66305 backedges. 0 proven. 66305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:43,654 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:43,654 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2019-05-23 09:30:43,654 INFO L146 ILogger]: Interpolant automaton has 152 states [2019-05-23 09:30:43,655 INFO L146 ILogger]: Constructing interpolant automaton starting with 152 interpolants. [2019-05-23 09:30:43,656 INFO L146 ILogger]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 09:30:43,656 INFO L146 ILogger]: Start difference. First operand 897 states and 897 transitions. Second operand 152 states. [2019-05-23 09:30:44,685 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:44,685 INFO L146 ILogger]: Finished difference Result 908 states and 908 transitions. [2019-05-23 09:30:44,685 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-05-23 09:30:44,686 INFO L146 ILogger]: Start accepts. Automaton has 152 states. Word has length 896 [2019-05-23 09:30:44,686 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:44,687 INFO L146 ILogger]: With dead ends: 908 [2019-05-23 09:30:44,687 INFO L146 ILogger]: Without dead ends: 908 [2019-05-23 09:30:44,689 INFO L146 ILogger]: 0 DeclaredPredicates, 895 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-05-23 09:30:44,689 INFO L146 ILogger]: Start minimizeSevpa. Operand 908 states. [2019-05-23 09:30:44,691 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 908 to 903. [2019-05-23 09:30:44,692 INFO L146 ILogger]: Start removeUnreachable. Operand 903 states. [2019-05-23 09:30:44,692 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 903 states to 903 states and 903 transitions. [2019-05-23 09:30:44,692 INFO L146 ILogger]: Start accepts. Automaton has 903 states and 903 transitions. Word has length 896 [2019-05-23 09:30:44,693 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:44,693 INFO L146 ILogger]: Abstraction has 903 states and 903 transitions. [2019-05-23 09:30:44,693 INFO L146 ILogger]: Interpolant automaton has 152 states. [2019-05-23 09:30:44,693 INFO L146 ILogger]: Start isEmpty. Operand 903 states and 903 transitions. [2019-05-23 09:30:44,696 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 903 [2019-05-23 09:30:44,697 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:44,697 INFO L146 ILogger]: trace histogram [150, 150, 150, 150, 150, 150, 1, 1] [2019-05-23 09:30:44,697 INFO L146 ILogger]: === Iteration 151 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:44,697 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:44,697 INFO L146 ILogger]: Analyzing trace with hash 1576813635, now seen corresponding path program 150 times [2019-05-23 09:30:44,698 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:44,725 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:44,731 INFO L146 ILogger]: Trace formula consists of 1205 conjuncts, 152 conjunts are in the unsatisfiable core [2019-05-23 09:30:44,735 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:30:52,975 INFO L146 ILogger]: Checked inductivity of 67200 backedges. 0 proven. 67200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:30:52,976 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:30:52,976 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2019-05-23 09:30:52,976 INFO L146 ILogger]: Interpolant automaton has 153 states [2019-05-23 09:30:52,977 INFO L146 ILogger]: Constructing interpolant automaton starting with 153 interpolants. [2019-05-23 09:30:52,978 INFO L146 ILogger]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:30:52,978 INFO L146 ILogger]: Start difference. First operand 903 states and 903 transitions. Second operand 153 states. [2019-05-23 09:30:54,070 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:30:54,071 INFO L146 ILogger]: Finished difference Result 914 states and 914 transitions. [2019-05-23 09:30:54,071 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-05-23 09:30:54,071 INFO L146 ILogger]: Start accepts. Automaton has 153 states. Word has length 902 [2019-05-23 09:30:54,072 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:30:54,072 INFO L146 ILogger]: With dead ends: 914 [2019-05-23 09:30:54,072 INFO L146 ILogger]: Without dead ends: 914 [2019-05-23 09:30:54,073 INFO L146 ILogger]: 0 DeclaredPredicates, 901 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2019-05-23 09:30:54,074 INFO L146 ILogger]: Start minimizeSevpa. Operand 914 states. [2019-05-23 09:30:54,076 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 914 to 909. [2019-05-23 09:30:54,077 INFO L146 ILogger]: Start removeUnreachable. Operand 909 states. [2019-05-23 09:30:54,077 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 909 states to 909 states and 909 transitions. [2019-05-23 09:30:54,077 INFO L146 ILogger]: Start accepts. Automaton has 909 states and 909 transitions. Word has length 902 [2019-05-23 09:30:54,078 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:30:54,078 INFO L146 ILogger]: Abstraction has 909 states and 909 transitions. [2019-05-23 09:30:54,078 INFO L146 ILogger]: Interpolant automaton has 153 states. [2019-05-23 09:30:54,078 INFO L146 ILogger]: Start isEmpty. Operand 909 states and 909 transitions. [2019-05-23 09:30:54,082 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 909 [2019-05-23 09:30:54,082 INFO L146 ILogger]: Found error trace [2019-05-23 09:30:54,082 INFO L146 ILogger]: trace histogram [151, 151, 151, 151, 151, 151, 1, 1] [2019-05-23 09:30:54,082 INFO L146 ILogger]: === Iteration 152 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:30:54,082 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:30:54,083 INFO L146 ILogger]: Analyzing trace with hash 813989760, now seen corresponding path program 151 times [2019-05-23 09:30:54,083 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:30:54,111 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:30:54,117 INFO L146 ILogger]: Trace formula consists of 1213 conjuncts, 153 conjunts are in the unsatisfiable core [2019-05-23 09:30:54,120 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:02,377 INFO L146 ILogger]: Checked inductivity of 68101 backedges. 0 proven. 68101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:02,377 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:02,377 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2019-05-23 09:31:02,378 INFO L146 ILogger]: Interpolant automaton has 154 states [2019-05-23 09:31:02,379 INFO L146 ILogger]: Constructing interpolant automaton starting with 154 interpolants. [2019-05-23 09:31:02,380 INFO L146 ILogger]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 09:31:02,380 INFO L146 ILogger]: Start difference. First operand 909 states and 909 transitions. Second operand 154 states. [2019-05-23 09:31:03,550 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:03,550 INFO L146 ILogger]: Finished difference Result 920 states and 920 transitions. [2019-05-23 09:31:03,550 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-05-23 09:31:03,550 INFO L146 ILogger]: Start accepts. Automaton has 154 states. Word has length 908 [2019-05-23 09:31:03,551 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:03,551 INFO L146 ILogger]: With dead ends: 920 [2019-05-23 09:31:03,551 INFO L146 ILogger]: Without dead ends: 920 [2019-05-23 09:31:03,553 INFO L146 ILogger]: 0 DeclaredPredicates, 907 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-05-23 09:31:03,553 INFO L146 ILogger]: Start minimizeSevpa. Operand 920 states. [2019-05-23 09:31:03,556 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 920 to 915. [2019-05-23 09:31:03,556 INFO L146 ILogger]: Start removeUnreachable. Operand 915 states. [2019-05-23 09:31:03,557 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 915 states to 915 states and 915 transitions. [2019-05-23 09:31:03,557 INFO L146 ILogger]: Start accepts. Automaton has 915 states and 915 transitions. Word has length 908 [2019-05-23 09:31:03,557 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:03,558 INFO L146 ILogger]: Abstraction has 915 states and 915 transitions. [2019-05-23 09:31:03,558 INFO L146 ILogger]: Interpolant automaton has 154 states. [2019-05-23 09:31:03,558 INFO L146 ILogger]: Start isEmpty. Operand 915 states and 915 transitions. [2019-05-23 09:31:03,562 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 915 [2019-05-23 09:31:03,562 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:03,562 INFO L146 ILogger]: trace histogram [152, 152, 152, 152, 152, 152, 1, 1] [2019-05-23 09:31:03,562 INFO L146 ILogger]: === Iteration 153 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:03,562 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:03,562 INFO L146 ILogger]: Analyzing trace with hash -1483695875, now seen corresponding path program 152 times [2019-05-23 09:31:03,563 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:03,590 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:03,597 INFO L146 ILogger]: Trace formula consists of 1221 conjuncts, 154 conjunts are in the unsatisfiable core [2019-05-23 09:31:03,600 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:12,060 INFO L146 ILogger]: Checked inductivity of 69008 backedges. 0 proven. 69008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:12,060 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:12,060 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2019-05-23 09:31:12,061 INFO L146 ILogger]: Interpolant automaton has 155 states [2019-05-23 09:31:12,062 INFO L146 ILogger]: Constructing interpolant automaton starting with 155 interpolants. [2019-05-23 09:31:12,062 INFO L146 ILogger]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:31:12,062 INFO L146 ILogger]: Start difference. First operand 915 states and 915 transitions. Second operand 155 states. [2019-05-23 09:31:13,128 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:13,128 INFO L146 ILogger]: Finished difference Result 926 states and 926 transitions. [2019-05-23 09:31:13,128 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-05-23 09:31:13,128 INFO L146 ILogger]: Start accepts. Automaton has 155 states. Word has length 914 [2019-05-23 09:31:13,129 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:13,130 INFO L146 ILogger]: With dead ends: 926 [2019-05-23 09:31:13,130 INFO L146 ILogger]: Without dead ends: 926 [2019-05-23 09:31:13,131 INFO L146 ILogger]: 0 DeclaredPredicates, 913 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2019-05-23 09:31:13,132 INFO L146 ILogger]: Start minimizeSevpa. Operand 926 states. [2019-05-23 09:31:13,135 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 926 to 921. [2019-05-23 09:31:13,136 INFO L146 ILogger]: Start removeUnreachable. Operand 921 states. [2019-05-23 09:31:13,136 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 921 states to 921 states and 921 transitions. [2019-05-23 09:31:13,137 INFO L146 ILogger]: Start accepts. Automaton has 921 states and 921 transitions. Word has length 914 [2019-05-23 09:31:13,137 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:13,137 INFO L146 ILogger]: Abstraction has 921 states and 921 transitions. [2019-05-23 09:31:13,137 INFO L146 ILogger]: Interpolant automaton has 155 states. [2019-05-23 09:31:13,137 INFO L146 ILogger]: Start isEmpty. Operand 921 states and 921 transitions. [2019-05-23 09:31:13,142 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 921 [2019-05-23 09:31:13,142 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:13,142 INFO L146 ILogger]: trace histogram [153, 153, 153, 153, 153, 153, 1, 1] [2019-05-23 09:31:13,142 INFO L146 ILogger]: === Iteration 154 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:13,142 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:13,142 INFO L146 ILogger]: Analyzing trace with hash -170860358, now seen corresponding path program 153 times [2019-05-23 09:31:13,143 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:13,171 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:13,178 INFO L146 ILogger]: Trace formula consists of 1229 conjuncts, 155 conjunts are in the unsatisfiable core [2019-05-23 09:31:13,181 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:21,830 INFO L146 ILogger]: Checked inductivity of 69921 backedges. 0 proven. 69921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:21,831 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:21,831 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2019-05-23 09:31:21,832 INFO L146 ILogger]: Interpolant automaton has 156 states [2019-05-23 09:31:21,833 INFO L146 ILogger]: Constructing interpolant automaton starting with 156 interpolants. [2019-05-23 09:31:21,834 INFO L146 ILogger]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 09:31:21,834 INFO L146 ILogger]: Start difference. First operand 921 states and 921 transitions. Second operand 156 states. [2019-05-23 09:31:22,948 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:22,949 INFO L146 ILogger]: Finished difference Result 932 states and 932 transitions. [2019-05-23 09:31:22,949 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-05-23 09:31:22,949 INFO L146 ILogger]: Start accepts. Automaton has 156 states. Word has length 920 [2019-05-23 09:31:22,950 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:22,950 INFO L146 ILogger]: With dead ends: 932 [2019-05-23 09:31:22,950 INFO L146 ILogger]: Without dead ends: 932 [2019-05-23 09:31:22,951 INFO L146 ILogger]: 0 DeclaredPredicates, 919 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-05-23 09:31:22,952 INFO L146 ILogger]: Start minimizeSevpa. Operand 932 states. [2019-05-23 09:31:22,956 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 932 to 927. [2019-05-23 09:31:22,956 INFO L146 ILogger]: Start removeUnreachable. Operand 927 states. [2019-05-23 09:31:22,956 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2019-05-23 09:31:22,957 INFO L146 ILogger]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 920 [2019-05-23 09:31:22,957 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:22,957 INFO L146 ILogger]: Abstraction has 927 states and 927 transitions. [2019-05-23 09:31:22,957 INFO L146 ILogger]: Interpolant automaton has 156 states. [2019-05-23 09:31:22,957 INFO L146 ILogger]: Start isEmpty. Operand 927 states and 927 transitions. [2019-05-23 09:31:22,961 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 927 [2019-05-23 09:31:22,961 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:22,961 INFO L146 ILogger]: trace histogram [154, 154, 154, 154, 154, 154, 1, 1] [2019-05-23 09:31:22,961 INFO L146 ILogger]: === Iteration 155 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:22,962 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:22,962 INFO L146 ILogger]: Analyzing trace with hash 2088347319, now seen corresponding path program 154 times [2019-05-23 09:31:22,962 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:23,005 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:23,015 INFO L146 ILogger]: Trace formula consists of 1237 conjuncts, 156 conjunts are in the unsatisfiable core [2019-05-23 09:31:23,020 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:31,773 INFO L146 ILogger]: Checked inductivity of 70840 backedges. 0 proven. 70840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:31,774 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:31,774 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2019-05-23 09:31:31,775 INFO L146 ILogger]: Interpolant automaton has 157 states [2019-05-23 09:31:31,776 INFO L146 ILogger]: Constructing interpolant automaton starting with 157 interpolants. [2019-05-23 09:31:31,777 INFO L146 ILogger]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:31:31,777 INFO L146 ILogger]: Start difference. First operand 927 states and 927 transitions. Second operand 157 states. [2019-05-23 09:31:33,111 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:33,111 INFO L146 ILogger]: Finished difference Result 938 states and 938 transitions. [2019-05-23 09:31:33,111 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-05-23 09:31:33,111 INFO L146 ILogger]: Start accepts. Automaton has 157 states. Word has length 926 [2019-05-23 09:31:33,112 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:33,112 INFO L146 ILogger]: With dead ends: 938 [2019-05-23 09:31:33,113 INFO L146 ILogger]: Without dead ends: 938 [2019-05-23 09:31:33,114 INFO L146 ILogger]: 0 DeclaredPredicates, 925 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2019-05-23 09:31:33,114 INFO L146 ILogger]: Start minimizeSevpa. Operand 938 states. [2019-05-23 09:31:33,117 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 938 to 933. [2019-05-23 09:31:33,117 INFO L146 ILogger]: Start removeUnreachable. Operand 933 states. [2019-05-23 09:31:33,117 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 933 states to 933 states and 933 transitions. [2019-05-23 09:31:33,117 INFO L146 ILogger]: Start accepts. Automaton has 933 states and 933 transitions. Word has length 926 [2019-05-23 09:31:33,118 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:33,118 INFO L146 ILogger]: Abstraction has 933 states and 933 transitions. [2019-05-23 09:31:33,118 INFO L146 ILogger]: Interpolant automaton has 157 states. [2019-05-23 09:31:33,118 INFO L146 ILogger]: Start isEmpty. Operand 933 states and 933 transitions. [2019-05-23 09:31:33,124 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 933 [2019-05-23 09:31:33,124 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:33,124 INFO L146 ILogger]: trace histogram [155, 155, 155, 155, 155, 155, 1, 1] [2019-05-23 09:31:33,124 INFO L146 ILogger]: === Iteration 156 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:33,125 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:33,125 INFO L146 ILogger]: Analyzing trace with hash -666682636, now seen corresponding path program 155 times [2019-05-23 09:31:33,125 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:33,167 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:33,176 INFO L146 ILogger]: Trace formula consists of 1245 conjuncts, 157 conjunts are in the unsatisfiable core [2019-05-23 09:31:33,181 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:41,993 INFO L146 ILogger]: Checked inductivity of 71765 backedges. 0 proven. 71765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:41,993 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:41,994 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2019-05-23 09:31:41,994 INFO L146 ILogger]: Interpolant automaton has 158 states [2019-05-23 09:31:41,995 INFO L146 ILogger]: Constructing interpolant automaton starting with 158 interpolants. [2019-05-23 09:31:41,996 INFO L146 ILogger]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 09:31:41,996 INFO L146 ILogger]: Start difference. First operand 933 states and 933 transitions. Second operand 158 states. [2019-05-23 09:31:43,142 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:43,142 INFO L146 ILogger]: Finished difference Result 944 states and 944 transitions. [2019-05-23 09:31:43,142 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-05-23 09:31:43,142 INFO L146 ILogger]: Start accepts. Automaton has 158 states. Word has length 932 [2019-05-23 09:31:43,143 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:43,144 INFO L146 ILogger]: With dead ends: 944 [2019-05-23 09:31:43,144 INFO L146 ILogger]: Without dead ends: 944 [2019-05-23 09:31:43,146 INFO L146 ILogger]: 0 DeclaredPredicates, 931 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-05-23 09:31:43,146 INFO L146 ILogger]: Start minimizeSevpa. Operand 944 states. [2019-05-23 09:31:43,150 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 944 to 939. [2019-05-23 09:31:43,150 INFO L146 ILogger]: Start removeUnreachable. Operand 939 states. [2019-05-23 09:31:43,151 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 939 states to 939 states and 939 transitions. [2019-05-23 09:31:43,151 INFO L146 ILogger]: Start accepts. Automaton has 939 states and 939 transitions. Word has length 932 [2019-05-23 09:31:43,152 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:43,152 INFO L146 ILogger]: Abstraction has 939 states and 939 transitions. [2019-05-23 09:31:43,152 INFO L146 ILogger]: Interpolant automaton has 158 states. [2019-05-23 09:31:43,152 INFO L146 ILogger]: Start isEmpty. Operand 939 states and 939 transitions. [2019-05-23 09:31:43,158 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 939 [2019-05-23 09:31:43,158 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:43,158 INFO L146 ILogger]: trace histogram [156, 156, 156, 156, 156, 156, 1, 1] [2019-05-23 09:31:43,159 INFO L146 ILogger]: === Iteration 157 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:43,159 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:43,159 INFO L146 ILogger]: Analyzing trace with hash 778694001, now seen corresponding path program 156 times [2019-05-23 09:31:43,159 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:43,189 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:43,197 INFO L146 ILogger]: Trace formula consists of 1253 conjuncts, 158 conjunts are in the unsatisfiable core [2019-05-23 09:31:43,202 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:31:52,280 INFO L146 ILogger]: Checked inductivity of 72696 backedges. 0 proven. 72696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:31:52,280 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:31:52,280 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2019-05-23 09:31:52,281 INFO L146 ILogger]: Interpolant automaton has 159 states [2019-05-23 09:31:52,282 INFO L146 ILogger]: Constructing interpolant automaton starting with 159 interpolants. [2019-05-23 09:31:52,282 INFO L146 ILogger]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:31:52,283 INFO L146 ILogger]: Start difference. First operand 939 states and 939 transitions. Second operand 159 states. [2019-05-23 09:31:53,445 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:31:53,445 INFO L146 ILogger]: Finished difference Result 950 states and 950 transitions. [2019-05-23 09:31:53,445 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-05-23 09:31:53,445 INFO L146 ILogger]: Start accepts. Automaton has 159 states. Word has length 938 [2019-05-23 09:31:53,446 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:31:53,446 INFO L146 ILogger]: With dead ends: 950 [2019-05-23 09:31:53,446 INFO L146 ILogger]: Without dead ends: 950 [2019-05-23 09:31:53,447 INFO L146 ILogger]: 0 DeclaredPredicates, 937 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2019-05-23 09:31:53,448 INFO L146 ILogger]: Start minimizeSevpa. Operand 950 states. [2019-05-23 09:31:53,452 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 950 to 945. [2019-05-23 09:31:53,452 INFO L146 ILogger]: Start removeUnreachable. Operand 945 states. [2019-05-23 09:31:53,453 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 945 states to 945 states and 945 transitions. [2019-05-23 09:31:53,453 INFO L146 ILogger]: Start accepts. Automaton has 945 states and 945 transitions. Word has length 938 [2019-05-23 09:31:53,454 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:31:53,454 INFO L146 ILogger]: Abstraction has 945 states and 945 transitions. [2019-05-23 09:31:53,454 INFO L146 ILogger]: Interpolant automaton has 159 states. [2019-05-23 09:31:53,454 INFO L146 ILogger]: Start isEmpty. Operand 945 states and 945 transitions. [2019-05-23 09:31:53,460 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 945 [2019-05-23 09:31:53,460 INFO L146 ILogger]: Found error trace [2019-05-23 09:31:53,460 INFO L146 ILogger]: trace histogram [157, 157, 157, 157, 157, 157, 1, 1] [2019-05-23 09:31:53,461 INFO L146 ILogger]: === Iteration 158 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:31:53,461 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:31:53,461 INFO L146 ILogger]: Analyzing trace with hash -1179775442, now seen corresponding path program 157 times [2019-05-23 09:31:53,462 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:31:53,505 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:31:53,512 INFO L146 ILogger]: Trace formula consists of 1261 conjuncts, 159 conjunts are in the unsatisfiable core [2019-05-23 09:31:53,516 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:02,613 INFO L146 ILogger]: Checked inductivity of 73633 backedges. 0 proven. 73633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:02,613 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:02,614 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2019-05-23 09:32:02,614 INFO L146 ILogger]: Interpolant automaton has 160 states [2019-05-23 09:32:02,615 INFO L146 ILogger]: Constructing interpolant automaton starting with 160 interpolants. [2019-05-23 09:32:02,616 INFO L146 ILogger]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 09:32:02,616 INFO L146 ILogger]: Start difference. First operand 945 states and 945 transitions. Second operand 160 states. [2019-05-23 09:32:03,823 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:03,823 INFO L146 ILogger]: Finished difference Result 956 states and 956 transitions. [2019-05-23 09:32:03,824 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-05-23 09:32:03,825 INFO L146 ILogger]: Start accepts. Automaton has 160 states. Word has length 944 [2019-05-23 09:32:03,826 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:03,826 INFO L146 ILogger]: With dead ends: 956 [2019-05-23 09:32:03,826 INFO L146 ILogger]: Without dead ends: 956 [2019-05-23 09:32:03,828 INFO L146 ILogger]: 0 DeclaredPredicates, 943 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-05-23 09:32:03,828 INFO L146 ILogger]: Start minimizeSevpa. Operand 956 states. [2019-05-23 09:32:03,831 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 956 to 951. [2019-05-23 09:32:03,831 INFO L146 ILogger]: Start removeUnreachable. Operand 951 states. [2019-05-23 09:32:03,832 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 951 states to 951 states and 951 transitions. [2019-05-23 09:32:03,832 INFO L146 ILogger]: Start accepts. Automaton has 951 states and 951 transitions. Word has length 944 [2019-05-23 09:32:03,832 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:03,832 INFO L146 ILogger]: Abstraction has 951 states and 951 transitions. [2019-05-23 09:32:03,832 INFO L146 ILogger]: Interpolant automaton has 160 states. [2019-05-23 09:32:03,832 INFO L146 ILogger]: Start isEmpty. Operand 951 states and 951 transitions. [2019-05-23 09:32:03,836 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 951 [2019-05-23 09:32:03,836 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:03,837 INFO L146 ILogger]: trace histogram [158, 158, 158, 158, 158, 158, 1, 1] [2019-05-23 09:32:03,837 INFO L146 ILogger]: === Iteration 159 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:03,837 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:03,837 INFO L146 ILogger]: Analyzing trace with hash -1756107477, now seen corresponding path program 158 times [2019-05-23 09:32:03,838 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:03,869 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:03,876 INFO L146 ILogger]: Trace formula consists of 1269 conjuncts, 160 conjunts are in the unsatisfiable core [2019-05-23 09:32:03,879 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:12,969 INFO L146 ILogger]: Checked inductivity of 74576 backedges. 0 proven. 74576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:12,969 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:12,970 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2019-05-23 09:32:12,970 INFO L146 ILogger]: Interpolant automaton has 161 states [2019-05-23 09:32:12,971 INFO L146 ILogger]: Constructing interpolant automaton starting with 161 interpolants. [2019-05-23 09:32:12,972 INFO L146 ILogger]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:32:12,972 INFO L146 ILogger]: Start difference. First operand 951 states and 951 transitions. Second operand 161 states. [2019-05-23 09:32:14,212 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:14,213 INFO L146 ILogger]: Finished difference Result 962 states and 962 transitions. [2019-05-23 09:32:14,213 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-05-23 09:32:14,213 INFO L146 ILogger]: Start accepts. Automaton has 161 states. Word has length 950 [2019-05-23 09:32:14,213 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:14,214 INFO L146 ILogger]: With dead ends: 962 [2019-05-23 09:32:14,214 INFO L146 ILogger]: Without dead ends: 962 [2019-05-23 09:32:14,215 INFO L146 ILogger]: 0 DeclaredPredicates, 949 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2019-05-23 09:32:14,215 INFO L146 ILogger]: Start minimizeSevpa. Operand 962 states. [2019-05-23 09:32:14,219 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 962 to 957. [2019-05-23 09:32:14,219 INFO L146 ILogger]: Start removeUnreachable. Operand 957 states. [2019-05-23 09:32:14,220 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 957 states to 957 states and 957 transitions. [2019-05-23 09:32:14,220 INFO L146 ILogger]: Start accepts. Automaton has 957 states and 957 transitions. Word has length 950 [2019-05-23 09:32:14,220 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:14,220 INFO L146 ILogger]: Abstraction has 957 states and 957 transitions. [2019-05-23 09:32:14,220 INFO L146 ILogger]: Interpolant automaton has 161 states. [2019-05-23 09:32:14,220 INFO L146 ILogger]: Start isEmpty. Operand 957 states and 957 transitions. [2019-05-23 09:32:14,225 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 957 [2019-05-23 09:32:14,225 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:14,225 INFO L146 ILogger]: trace histogram [159, 159, 159, 159, 159, 159, 1, 1] [2019-05-23 09:32:14,225 INFO L146 ILogger]: === Iteration 160 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:14,225 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:14,226 INFO L146 ILogger]: Analyzing trace with hash -735847832, now seen corresponding path program 159 times [2019-05-23 09:32:14,226 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:14,264 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:14,271 INFO L146 ILogger]: Trace formula consists of 1277 conjuncts, 161 conjunts are in the unsatisfiable core [2019-05-23 09:32:14,274 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:23,578 INFO L146 ILogger]: Checked inductivity of 75525 backedges. 0 proven. 75525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:23,578 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:23,578 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2019-05-23 09:32:23,579 INFO L146 ILogger]: Interpolant automaton has 162 states [2019-05-23 09:32:23,580 INFO L146 ILogger]: Constructing interpolant automaton starting with 162 interpolants. [2019-05-23 09:32:23,581 INFO L146 ILogger]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-05-23 09:32:23,581 INFO L146 ILogger]: Start difference. First operand 957 states and 957 transitions. Second operand 162 states. [2019-05-23 09:32:24,796 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:24,797 INFO L146 ILogger]: Finished difference Result 968 states and 968 transitions. [2019-05-23 09:32:24,797 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-05-23 09:32:24,797 INFO L146 ILogger]: Start accepts. Automaton has 162 states. Word has length 956 [2019-05-23 09:32:24,798 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:24,798 INFO L146 ILogger]: With dead ends: 968 [2019-05-23 09:32:24,798 INFO L146 ILogger]: Without dead ends: 968 [2019-05-23 09:32:24,800 INFO L146 ILogger]: 0 DeclaredPredicates, 955 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-05-23 09:32:24,800 INFO L146 ILogger]: Start minimizeSevpa. Operand 968 states. [2019-05-23 09:32:24,803 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 968 to 963. [2019-05-23 09:32:24,804 INFO L146 ILogger]: Start removeUnreachable. Operand 963 states. [2019-05-23 09:32:24,804 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 963 states to 963 states and 963 transitions. [2019-05-23 09:32:24,804 INFO L146 ILogger]: Start accepts. Automaton has 963 states and 963 transitions. Word has length 956 [2019-05-23 09:32:24,805 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:24,805 INFO L146 ILogger]: Abstraction has 963 states and 963 transitions. [2019-05-23 09:32:24,805 INFO L146 ILogger]: Interpolant automaton has 162 states. [2019-05-23 09:32:24,805 INFO L146 ILogger]: Start isEmpty. Operand 963 states and 963 transitions. [2019-05-23 09:32:24,809 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 963 [2019-05-23 09:32:24,809 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:24,809 INFO L146 ILogger]: trace histogram [160, 160, 160, 160, 160, 160, 1, 1] [2019-05-23 09:32:24,809 INFO L146 ILogger]: === Iteration 161 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:24,810 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:24,810 INFO L146 ILogger]: Analyzing trace with hash -1184225819, now seen corresponding path program 160 times [2019-05-23 09:32:24,810 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:24,840 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:24,847 INFO L146 ILogger]: Trace formula consists of 1285 conjuncts, 162 conjunts are in the unsatisfiable core [2019-05-23 09:32:24,850 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:34,198 INFO L146 ILogger]: Checked inductivity of 76480 backedges. 0 proven. 76480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:34,199 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:34,199 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2019-05-23 09:32:34,199 INFO L146 ILogger]: Interpolant automaton has 163 states [2019-05-23 09:32:34,200 INFO L146 ILogger]: Constructing interpolant automaton starting with 163 interpolants. [2019-05-23 09:32:34,201 INFO L146 ILogger]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:32:34,201 INFO L146 ILogger]: Start difference. First operand 963 states and 963 transitions. Second operand 163 states. [2019-05-23 09:32:35,408 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:35,408 INFO L146 ILogger]: Finished difference Result 974 states and 974 transitions. [2019-05-23 09:32:35,409 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-05-23 09:32:35,409 INFO L146 ILogger]: Start accepts. Automaton has 163 states. Word has length 962 [2019-05-23 09:32:35,410 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:35,411 INFO L146 ILogger]: With dead ends: 974 [2019-05-23 09:32:35,411 INFO L146 ILogger]: Without dead ends: 974 [2019-05-23 09:32:35,412 INFO L146 ILogger]: 0 DeclaredPredicates, 961 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2019-05-23 09:32:35,413 INFO L146 ILogger]: Start minimizeSevpa. Operand 974 states. [2019-05-23 09:32:35,416 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 974 to 969. [2019-05-23 09:32:35,416 INFO L146 ILogger]: Start removeUnreachable. Operand 969 states. [2019-05-23 09:32:35,416 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 969 states to 969 states and 969 transitions. [2019-05-23 09:32:35,416 INFO L146 ILogger]: Start accepts. Automaton has 969 states and 969 transitions. Word has length 962 [2019-05-23 09:32:35,417 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:35,417 INFO L146 ILogger]: Abstraction has 969 states and 969 transitions. [2019-05-23 09:32:35,417 INFO L146 ILogger]: Interpolant automaton has 163 states. [2019-05-23 09:32:35,417 INFO L146 ILogger]: Start isEmpty. Operand 969 states and 969 transitions. [2019-05-23 09:32:35,421 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 969 [2019-05-23 09:32:35,422 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:35,422 INFO L146 ILogger]: trace histogram [161, 161, 161, 161, 161, 161, 1, 1] [2019-05-23 09:32:35,422 INFO L146 ILogger]: === Iteration 162 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:35,422 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:35,422 INFO L146 ILogger]: Analyzing trace with hash 1509367714, now seen corresponding path program 161 times [2019-05-23 09:32:35,422 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:35,453 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:35,460 INFO L146 ILogger]: Trace formula consists of 1293 conjuncts, 163 conjunts are in the unsatisfiable core [2019-05-23 09:32:35,464 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:44,951 INFO L146 ILogger]: Checked inductivity of 77441 backedges. 0 proven. 77441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:44,951 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:44,952 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2019-05-23 09:32:44,952 INFO L146 ILogger]: Interpolant automaton has 164 states [2019-05-23 09:32:44,953 INFO L146 ILogger]: Constructing interpolant automaton starting with 164 interpolants. [2019-05-23 09:32:44,954 INFO L146 ILogger]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 09:32:44,954 INFO L146 ILogger]: Start difference. First operand 969 states and 969 transitions. Second operand 164 states. [2019-05-23 09:32:46,206 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:46,206 INFO L146 ILogger]: Finished difference Result 980 states and 980 transitions. [2019-05-23 09:32:46,206 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-05-23 09:32:46,206 INFO L146 ILogger]: Start accepts. Automaton has 164 states. Word has length 968 [2019-05-23 09:32:46,207 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:46,208 INFO L146 ILogger]: With dead ends: 980 [2019-05-23 09:32:46,208 INFO L146 ILogger]: Without dead ends: 980 [2019-05-23 09:32:46,209 INFO L146 ILogger]: 0 DeclaredPredicates, 967 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-05-23 09:32:46,209 INFO L146 ILogger]: Start minimizeSevpa. Operand 980 states. [2019-05-23 09:32:46,212 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 980 to 975. [2019-05-23 09:32:46,212 INFO L146 ILogger]: Start removeUnreachable. Operand 975 states. [2019-05-23 09:32:46,213 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 975 states to 975 states and 975 transitions. [2019-05-23 09:32:46,213 INFO L146 ILogger]: Start accepts. Automaton has 975 states and 975 transitions. Word has length 968 [2019-05-23 09:32:46,214 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:46,214 INFO L146 ILogger]: Abstraction has 975 states and 975 transitions. [2019-05-23 09:32:46,214 INFO L146 ILogger]: Interpolant automaton has 164 states. [2019-05-23 09:32:46,214 INFO L146 ILogger]: Start isEmpty. Operand 975 states and 975 transitions. [2019-05-23 09:32:46,220 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 975 [2019-05-23 09:32:46,221 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:46,221 INFO L146 ILogger]: trace histogram [162, 162, 162, 162, 162, 162, 1, 1] [2019-05-23 09:32:46,221 INFO L146 ILogger]: === Iteration 163 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:46,221 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:46,222 INFO L146 ILogger]: Analyzing trace with hash 1595873183, now seen corresponding path program 162 times [2019-05-23 09:32:46,222 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:46,253 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:46,263 INFO L146 ILogger]: Trace formula consists of 1301 conjuncts, 164 conjunts are in the unsatisfiable core [2019-05-23 09:32:46,268 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:32:55,822 INFO L146 ILogger]: Checked inductivity of 78408 backedges. 0 proven. 78408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:32:55,822 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:32:55,822 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2019-05-23 09:32:55,823 INFO L146 ILogger]: Interpolant automaton has 165 states [2019-05-23 09:32:55,824 INFO L146 ILogger]: Constructing interpolant automaton starting with 165 interpolants. [2019-05-23 09:32:55,825 INFO L146 ILogger]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:32:55,825 INFO L146 ILogger]: Start difference. First operand 975 states and 975 transitions. Second operand 165 states. [2019-05-23 09:32:57,230 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:32:57,230 INFO L146 ILogger]: Finished difference Result 986 states and 986 transitions. [2019-05-23 09:32:57,231 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-05-23 09:32:57,231 INFO L146 ILogger]: Start accepts. Automaton has 165 states. Word has length 974 [2019-05-23 09:32:57,232 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:32:57,232 INFO L146 ILogger]: With dead ends: 986 [2019-05-23 09:32:57,232 INFO L146 ILogger]: Without dead ends: 986 [2019-05-23 09:32:57,233 INFO L146 ILogger]: 0 DeclaredPredicates, 973 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2019-05-23 09:32:57,234 INFO L146 ILogger]: Start minimizeSevpa. Operand 986 states. [2019-05-23 09:32:57,238 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 986 to 981. [2019-05-23 09:32:57,238 INFO L146 ILogger]: Start removeUnreachable. Operand 981 states. [2019-05-23 09:32:57,239 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 981 states to 981 states and 981 transitions. [2019-05-23 09:32:57,239 INFO L146 ILogger]: Start accepts. Automaton has 981 states and 981 transitions. Word has length 974 [2019-05-23 09:32:57,240 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:32:57,240 INFO L146 ILogger]: Abstraction has 981 states and 981 transitions. [2019-05-23 09:32:57,240 INFO L146 ILogger]: Interpolant automaton has 165 states. [2019-05-23 09:32:57,240 INFO L146 ILogger]: Start isEmpty. Operand 981 states and 981 transitions. [2019-05-23 09:32:57,247 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 981 [2019-05-23 09:32:57,247 INFO L146 ILogger]: Found error trace [2019-05-23 09:32:57,247 INFO L146 ILogger]: trace histogram [163, 163, 163, 163, 163, 163, 1, 1] [2019-05-23 09:32:57,248 INFO L146 ILogger]: === Iteration 164 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:32:57,248 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:32:57,248 INFO L146 ILogger]: Analyzing trace with hash 364535260, now seen corresponding path program 163 times [2019-05-23 09:32:57,248 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:32:57,294 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:32:57,301 INFO L146 ILogger]: Trace formula consists of 1309 conjuncts, 165 conjunts are in the unsatisfiable core [2019-05-23 09:32:57,306 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:07,139 INFO L146 ILogger]: Checked inductivity of 79381 backedges. 0 proven. 79381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:07,139 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:07,139 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2019-05-23 09:33:07,140 INFO L146 ILogger]: Interpolant automaton has 166 states [2019-05-23 09:33:07,142 INFO L146 ILogger]: Constructing interpolant automaton starting with 166 interpolants. [2019-05-23 09:33:07,143 INFO L146 ILogger]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 09:33:07,143 INFO L146 ILogger]: Start difference. First operand 981 states and 981 transitions. Second operand 166 states. [2019-05-23 09:33:08,485 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:08,485 INFO L146 ILogger]: Finished difference Result 992 states and 992 transitions. [2019-05-23 09:33:08,485 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-05-23 09:33:08,485 INFO L146 ILogger]: Start accepts. Automaton has 166 states. Word has length 980 [2019-05-23 09:33:08,486 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:08,487 INFO L146 ILogger]: With dead ends: 992 [2019-05-23 09:33:08,487 INFO L146 ILogger]: Without dead ends: 992 [2019-05-23 09:33:08,488 INFO L146 ILogger]: 0 DeclaredPredicates, 979 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-05-23 09:33:08,488 INFO L146 ILogger]: Start minimizeSevpa. Operand 992 states. [2019-05-23 09:33:08,492 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 992 to 987. [2019-05-23 09:33:08,493 INFO L146 ILogger]: Start removeUnreachable. Operand 987 states. [2019-05-23 09:33:08,493 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 987 states to 987 states and 987 transitions. [2019-05-23 09:33:08,493 INFO L146 ILogger]: Start accepts. Automaton has 987 states and 987 transitions. Word has length 980 [2019-05-23 09:33:08,494 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:08,494 INFO L146 ILogger]: Abstraction has 987 states and 987 transitions. [2019-05-23 09:33:08,494 INFO L146 ILogger]: Interpolant automaton has 166 states. [2019-05-23 09:33:08,494 INFO L146 ILogger]: Start isEmpty. Operand 987 states and 987 transitions. [2019-05-23 09:33:08,501 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 987 [2019-05-23 09:33:08,501 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:08,501 INFO L146 ILogger]: trace histogram [164, 164, 164, 164, 164, 164, 1, 1] [2019-05-23 09:33:08,502 INFO L146 ILogger]: === Iteration 165 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:08,502 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:08,502 INFO L146 ILogger]: Analyzing trace with hash -1155186087, now seen corresponding path program 164 times [2019-05-23 09:33:08,502 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:08,545 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:08,556 INFO L146 ILogger]: Trace formula consists of 1317 conjuncts, 166 conjunts are in the unsatisfiable core [2019-05-23 09:33:08,561 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:18,384 INFO L146 ILogger]: Checked inductivity of 80360 backedges. 0 proven. 80360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:18,385 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:18,385 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2019-05-23 09:33:18,385 INFO L146 ILogger]: Interpolant automaton has 167 states [2019-05-23 09:33:18,386 INFO L146 ILogger]: Constructing interpolant automaton starting with 167 interpolants. [2019-05-23 09:33:18,387 INFO L146 ILogger]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:33:18,387 INFO L146 ILogger]: Start difference. First operand 987 states and 987 transitions. Second operand 167 states. [2019-05-23 09:33:19,676 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:19,676 INFO L146 ILogger]: Finished difference Result 998 states and 998 transitions. [2019-05-23 09:33:19,677 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-05-23 09:33:19,677 INFO L146 ILogger]: Start accepts. Automaton has 167 states. Word has length 986 [2019-05-23 09:33:19,678 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:19,678 INFO L146 ILogger]: With dead ends: 998 [2019-05-23 09:33:19,678 INFO L146 ILogger]: Without dead ends: 998 [2019-05-23 09:33:19,679 INFO L146 ILogger]: 0 DeclaredPredicates, 985 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2019-05-23 09:33:19,680 INFO L146 ILogger]: Start minimizeSevpa. Operand 998 states. [2019-05-23 09:33:19,683 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 998 to 993. [2019-05-23 09:33:19,683 INFO L146 ILogger]: Start removeUnreachable. Operand 993 states. [2019-05-23 09:33:19,684 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 993 states to 993 states and 993 transitions. [2019-05-23 09:33:19,684 INFO L146 ILogger]: Start accepts. Automaton has 993 states and 993 transitions. Word has length 986 [2019-05-23 09:33:19,685 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:19,685 INFO L146 ILogger]: Abstraction has 993 states and 993 transitions. [2019-05-23 09:33:19,685 INFO L146 ILogger]: Interpolant automaton has 167 states. [2019-05-23 09:33:19,685 INFO L146 ILogger]: Start isEmpty. Operand 993 states and 993 transitions. [2019-05-23 09:33:19,692 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 993 [2019-05-23 09:33:19,692 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:19,693 INFO L146 ILogger]: trace histogram [165, 165, 165, 165, 165, 165, 1, 1] [2019-05-23 09:33:19,693 INFO L146 ILogger]: === Iteration 166 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:19,693 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:19,693 INFO L146 ILogger]: Analyzing trace with hash 171971862, now seen corresponding path program 165 times [2019-05-23 09:33:19,694 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:19,739 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:19,747 INFO L146 ILogger]: Trace formula consists of 1325 conjuncts, 167 conjunts are in the unsatisfiable core [2019-05-23 09:33:19,751 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:29,605 INFO L146 ILogger]: Checked inductivity of 81345 backedges. 0 proven. 81345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:29,605 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:29,605 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2019-05-23 09:33:29,606 INFO L146 ILogger]: Interpolant automaton has 168 states [2019-05-23 09:33:29,607 INFO L146 ILogger]: Constructing interpolant automaton starting with 168 interpolants. [2019-05-23 09:33:29,608 INFO L146 ILogger]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 09:33:29,608 INFO L146 ILogger]: Start difference. First operand 993 states and 993 transitions. Second operand 168 states. [2019-05-23 09:33:31,052 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:31,052 INFO L146 ILogger]: Finished difference Result 1004 states and 1004 transitions. [2019-05-23 09:33:31,053 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-05-23 09:33:31,053 INFO L146 ILogger]: Start accepts. Automaton has 168 states. Word has length 992 [2019-05-23 09:33:31,053 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:31,054 INFO L146 ILogger]: With dead ends: 1004 [2019-05-23 09:33:31,054 INFO L146 ILogger]: Without dead ends: 1004 [2019-05-23 09:33:31,055 INFO L146 ILogger]: 0 DeclaredPredicates, 991 GetRequests, 825 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-05-23 09:33:31,055 INFO L146 ILogger]: Start minimizeSevpa. Operand 1004 states. [2019-05-23 09:33:31,058 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1004 to 999. [2019-05-23 09:33:31,058 INFO L146 ILogger]: Start removeUnreachable. Operand 999 states. [2019-05-23 09:33:31,059 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 999 states to 999 states and 999 transitions. [2019-05-23 09:33:31,059 INFO L146 ILogger]: Start accepts. Automaton has 999 states and 999 transitions. Word has length 992 [2019-05-23 09:33:31,059 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:31,059 INFO L146 ILogger]: Abstraction has 999 states and 999 transitions. [2019-05-23 09:33:31,059 INFO L146 ILogger]: Interpolant automaton has 168 states. [2019-05-23 09:33:31,059 INFO L146 ILogger]: Start isEmpty. Operand 999 states and 999 transitions. [2019-05-23 09:33:31,064 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 999 [2019-05-23 09:33:31,064 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:31,064 INFO L146 ILogger]: trace histogram [166, 166, 166, 166, 166, 166, 1, 1] [2019-05-23 09:33:31,064 INFO L146 ILogger]: === Iteration 167 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:31,064 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:31,065 INFO L146 ILogger]: Analyzing trace with hash 141501971, now seen corresponding path program 166 times [2019-05-23 09:33:31,065 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:31,101 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:31,109 INFO L146 ILogger]: Trace formula consists of 1333 conjuncts, 168 conjunts are in the unsatisfiable core [2019-05-23 09:33:31,112 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:41,055 INFO L146 ILogger]: Checked inductivity of 82336 backedges. 0 proven. 82336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:41,055 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:41,055 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2019-05-23 09:33:41,056 INFO L146 ILogger]: Interpolant automaton has 169 states [2019-05-23 09:33:41,057 INFO L146 ILogger]: Constructing interpolant automaton starting with 169 interpolants. [2019-05-23 09:33:41,057 INFO L146 ILogger]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:33:41,057 INFO L146 ILogger]: Start difference. First operand 999 states and 999 transitions. Second operand 169 states. [2019-05-23 09:33:42,349 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:42,349 INFO L146 ILogger]: Finished difference Result 1010 states and 1010 transitions. [2019-05-23 09:33:42,349 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-05-23 09:33:42,349 INFO L146 ILogger]: Start accepts. Automaton has 169 states. Word has length 998 [2019-05-23 09:33:42,350 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:42,351 INFO L146 ILogger]: With dead ends: 1010 [2019-05-23 09:33:42,351 INFO L146 ILogger]: Without dead ends: 1010 [2019-05-23 09:33:42,352 INFO L146 ILogger]: 0 DeclaredPredicates, 997 GetRequests, 830 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2019-05-23 09:33:42,352 INFO L146 ILogger]: Start minimizeSevpa. Operand 1010 states. [2019-05-23 09:33:42,355 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1010 to 1005. [2019-05-23 09:33:42,355 INFO L146 ILogger]: Start removeUnreachable. Operand 1005 states. [2019-05-23 09:33:42,356 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1005 transitions. [2019-05-23 09:33:42,356 INFO L146 ILogger]: Start accepts. Automaton has 1005 states and 1005 transitions. Word has length 998 [2019-05-23 09:33:42,357 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:42,357 INFO L146 ILogger]: Abstraction has 1005 states and 1005 transitions. [2019-05-23 09:33:42,357 INFO L146 ILogger]: Interpolant automaton has 169 states. [2019-05-23 09:33:42,357 INFO L146 ILogger]: Start isEmpty. Operand 1005 states and 1005 transitions. [2019-05-23 09:33:42,362 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 1005 [2019-05-23 09:33:42,362 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:42,362 INFO L146 ILogger]: trace histogram [167, 167, 167, 167, 167, 167, 1, 1] [2019-05-23 09:33:42,362 INFO L146 ILogger]: === Iteration 168 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:42,362 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:42,363 INFO L146 ILogger]: Analyzing trace with hash 312132944, now seen corresponding path program 167 times [2019-05-23 09:33:42,363 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:42,396 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:42,404 INFO L146 ILogger]: Trace formula consists of 1341 conjuncts, 169 conjunts are in the unsatisfiable core [2019-05-23 09:33:42,407 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:33:52,416 INFO L146 ILogger]: Checked inductivity of 83333 backedges. 0 proven. 83333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:33:52,416 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:33:52,416 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2019-05-23 09:33:52,417 INFO L146 ILogger]: Interpolant automaton has 170 states [2019-05-23 09:33:52,418 INFO L146 ILogger]: Constructing interpolant automaton starting with 170 interpolants. [2019-05-23 09:33:52,419 INFO L146 ILogger]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 09:33:52,419 INFO L146 ILogger]: Start difference. First operand 1005 states and 1005 transitions. Second operand 170 states. [2019-05-23 09:33:53,768 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:33:53,768 INFO L146 ILogger]: Finished difference Result 1016 states and 1016 transitions. [2019-05-23 09:33:53,768 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-05-23 09:33:53,768 INFO L146 ILogger]: Start accepts. Automaton has 170 states. Word has length 1004 [2019-05-23 09:33:53,769 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:33:53,770 INFO L146 ILogger]: With dead ends: 1016 [2019-05-23 09:33:53,770 INFO L146 ILogger]: Without dead ends: 1016 [2019-05-23 09:33:53,771 INFO L146 ILogger]: 0 DeclaredPredicates, 1003 GetRequests, 835 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-05-23 09:33:53,771 INFO L146 ILogger]: Start minimizeSevpa. Operand 1016 states. [2019-05-23 09:33:53,774 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2019-05-23 09:33:53,774 INFO L146 ILogger]: Start removeUnreachable. Operand 1011 states. [2019-05-23 09:33:53,775 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2019-05-23 09:33:53,775 INFO L146 ILogger]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 1004 [2019-05-23 09:33:53,775 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:33:53,775 INFO L146 ILogger]: Abstraction has 1011 states and 1011 transitions. [2019-05-23 09:33:53,775 INFO L146 ILogger]: Interpolant automaton has 170 states. [2019-05-23 09:33:53,775 INFO L146 ILogger]: Start isEmpty. Operand 1011 states and 1011 transitions. [2019-05-23 09:33:53,780 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 1011 [2019-05-23 09:33:53,780 INFO L146 ILogger]: Found error trace [2019-05-23 09:33:53,780 INFO L146 ILogger]: trace histogram [168, 168, 168, 168, 168, 168, 1, 1] [2019-05-23 09:33:53,780 INFO L146 ILogger]: === Iteration 169 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:33:53,780 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:33:53,780 INFO L146 ILogger]: Analyzing trace with hash 707740365, now seen corresponding path program 168 times [2019-05-23 09:33:53,781 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:33:53,814 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:33:53,822 INFO L146 ILogger]: Trace formula consists of 1349 conjuncts, 170 conjunts are in the unsatisfiable core [2019-05-23 09:33:53,826 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:04,008 INFO L146 ILogger]: Checked inductivity of 84336 backedges. 0 proven. 84336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:04,008 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:04,009 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2019-05-23 09:34:04,009 INFO L146 ILogger]: Interpolant automaton has 171 states [2019-05-23 09:34:04,010 INFO L146 ILogger]: Constructing interpolant automaton starting with 171 interpolants. [2019-05-23 09:34:04,011 INFO L146 ILogger]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:34:04,011 INFO L146 ILogger]: Start difference. First operand 1011 states and 1011 transitions. Second operand 171 states. [2019-05-23 09:34:05,306 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:05,306 INFO L146 ILogger]: Finished difference Result 1022 states and 1022 transitions. [2019-05-23 09:34:05,307 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-05-23 09:34:05,307 INFO L146 ILogger]: Start accepts. Automaton has 171 states. Word has length 1010 [2019-05-23 09:34:05,308 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:05,309 INFO L146 ILogger]: With dead ends: 1022 [2019-05-23 09:34:05,309 INFO L146 ILogger]: Without dead ends: 1022 [2019-05-23 09:34:05,310 INFO L146 ILogger]: 0 DeclaredPredicates, 1009 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2019-05-23 09:34:05,311 INFO L146 ILogger]: Start minimizeSevpa. Operand 1022 states. [2019-05-23 09:34:05,314 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1022 to 1017. [2019-05-23 09:34:05,315 INFO L146 ILogger]: Start removeUnreachable. Operand 1017 states. [2019-05-23 09:34:05,315 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1017 transitions. [2019-05-23 09:34:05,315 INFO L146 ILogger]: Start accepts. Automaton has 1017 states and 1017 transitions. Word has length 1010 [2019-05-23 09:34:05,316 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:05,316 INFO L146 ILogger]: Abstraction has 1017 states and 1017 transitions. [2019-05-23 09:34:05,316 INFO L146 ILogger]: Interpolant automaton has 171 states. [2019-05-23 09:34:05,316 INFO L146 ILogger]: Start isEmpty. Operand 1017 states and 1017 transitions. [2019-05-23 09:34:05,320 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 1017 [2019-05-23 09:34:05,321 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:05,321 INFO L146 ILogger]: trace histogram [169, 169, 169, 169, 169, 169, 1, 1] [2019-05-23 09:34:05,321 INFO L146 ILogger]: === Iteration 170 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:05,321 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:05,321 INFO L146 ILogger]: Analyzing trace with hash -2112033142, now seen corresponding path program 169 times [2019-05-23 09:34:05,321 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:05,355 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:05,363 INFO L146 ILogger]: Trace formula consists of 1357 conjuncts, 171 conjunts are in the unsatisfiable core [2019-05-23 09:34:05,366 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:15,820 INFO L146 ILogger]: Checked inductivity of 85345 backedges. 0 proven. 85345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:15,821 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:15,821 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2019-05-23 09:34:15,821 INFO L146 ILogger]: Interpolant automaton has 172 states [2019-05-23 09:34:15,822 INFO L146 ILogger]: Constructing interpolant automaton starting with 172 interpolants. [2019-05-23 09:34:15,823 INFO L146 ILogger]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 09:34:15,823 INFO L146 ILogger]: Start difference. First operand 1017 states and 1017 transitions. Second operand 172 states. [2019-05-23 09:34:17,215 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:17,215 INFO L146 ILogger]: Finished difference Result 1028 states and 1028 transitions. [2019-05-23 09:34:17,215 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-05-23 09:34:17,215 INFO L146 ILogger]: Start accepts. Automaton has 172 states. Word has length 1016 [2019-05-23 09:34:17,216 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:17,217 INFO L146 ILogger]: With dead ends: 1028 [2019-05-23 09:34:17,217 INFO L146 ILogger]: Without dead ends: 1028 [2019-05-23 09:34:17,217 INFO L146 ILogger]: 0 DeclaredPredicates, 1015 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-05-23 09:34:17,218 INFO L146 ILogger]: Start minimizeSevpa. Operand 1028 states. [2019-05-23 09:34:17,221 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1028 to 1023. [2019-05-23 09:34:17,221 INFO L146 ILogger]: Start removeUnreachable. Operand 1023 states. [2019-05-23 09:34:17,222 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1023 transitions. [2019-05-23 09:34:17,222 INFO L146 ILogger]: Start accepts. Automaton has 1023 states and 1023 transitions. Word has length 1016 [2019-05-23 09:34:17,222 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:17,222 INFO L146 ILogger]: Abstraction has 1023 states and 1023 transitions. [2019-05-23 09:34:17,222 INFO L146 ILogger]: Interpolant automaton has 172 states. [2019-05-23 09:34:17,222 INFO L146 ILogger]: Start isEmpty. Operand 1023 states and 1023 transitions. [2019-05-23 09:34:17,227 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 1023 [2019-05-23 09:34:17,227 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:17,227 INFO L146 ILogger]: trace histogram [170, 170, 170, 170, 170, 170, 1, 1] [2019-05-23 09:34:17,227 INFO L146 ILogger]: === Iteration 171 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:17,227 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:17,228 INFO L146 ILogger]: Analyzing trace with hash 1272453255, now seen corresponding path program 170 times [2019-05-23 09:34:17,228 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:17,261 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:17,269 INFO L146 ILogger]: Trace formula consists of 1365 conjuncts, 172 conjunts are in the unsatisfiable core [2019-05-23 09:34:17,273 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:27,849 INFO L146 ILogger]: Checked inductivity of 86360 backedges. 0 proven. 86360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:27,849 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:27,849 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2019-05-23 09:34:27,850 INFO L146 ILogger]: Interpolant automaton has 173 states [2019-05-23 09:34:27,851 INFO L146 ILogger]: Constructing interpolant automaton starting with 173 interpolants. [2019-05-23 09:34:27,852 INFO L146 ILogger]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:34:27,852 INFO L146 ILogger]: Start difference. First operand 1023 states and 1023 transitions. Second operand 173 states. [2019-05-23 09:34:29,250 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:29,250 INFO L146 ILogger]: Finished difference Result 1034 states and 1034 transitions. [2019-05-23 09:34:29,250 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-05-23 09:34:29,250 INFO L146 ILogger]: Start accepts. Automaton has 173 states. Word has length 1022 [2019-05-23 09:34:29,251 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:29,252 INFO L146 ILogger]: With dead ends: 1034 [2019-05-23 09:34:29,252 INFO L146 ILogger]: Without dead ends: 1034 [2019-05-23 09:34:29,253 INFO L146 ILogger]: 0 DeclaredPredicates, 1021 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2019-05-23 09:34:29,254 INFO L146 ILogger]: Start minimizeSevpa. Operand 1034 states. [2019-05-23 09:34:29,258 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1034 to 1029. [2019-05-23 09:34:29,258 INFO L146 ILogger]: Start removeUnreachable. Operand 1029 states. [2019-05-23 09:34:29,259 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1029 transitions. [2019-05-23 09:34:29,260 INFO L146 ILogger]: Start accepts. Automaton has 1029 states and 1029 transitions. Word has length 1022 [2019-05-23 09:34:29,260 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:29,260 INFO L146 ILogger]: Abstraction has 1029 states and 1029 transitions. [2019-05-23 09:34:29,260 INFO L146 ILogger]: Interpolant automaton has 173 states. [2019-05-23 09:34:29,260 INFO L146 ILogger]: Start isEmpty. Operand 1029 states and 1029 transitions. [2019-05-23 09:34:29,267 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 1029 [2019-05-23 09:34:29,268 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:29,268 INFO L146 ILogger]: trace histogram [171, 171, 171, 171, 171, 171, 1, 1] [2019-05-23 09:34:29,268 INFO L146 ILogger]: === Iteration 172 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:29,268 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:29,268 INFO L146 ILogger]: Analyzing trace with hash -1000795964, now seen corresponding path program 171 times [2019-05-23 09:34:29,269 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:29,323 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:29,336 INFO L146 ILogger]: Trace formula consists of 1373 conjuncts, 173 conjunts are in the unsatisfiable core [2019-05-23 09:34:29,341 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:34:39,899 INFO L146 ILogger]: Checked inductivity of 87381 backedges. 0 proven. 87381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:34:39,899 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:34:39,899 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2019-05-23 09:34:39,900 INFO L146 ILogger]: Interpolant automaton has 174 states [2019-05-23 09:34:39,901 INFO L146 ILogger]: Constructing interpolant automaton starting with 174 interpolants. [2019-05-23 09:34:39,901 INFO L146 ILogger]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-05-23 09:34:39,902 INFO L146 ILogger]: Start difference. First operand 1029 states and 1029 transitions. Second operand 174 states. [2019-05-23 09:34:41,303 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:34:41,304 INFO L146 ILogger]: Finished difference Result 1040 states and 1040 transitions. [2019-05-23 09:34:41,304 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-05-23 09:34:41,304 INFO L146 ILogger]: Start accepts. Automaton has 174 states. Word has length 1028 [2019-05-23 09:34:41,305 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:34:41,306 INFO L146 ILogger]: With dead ends: 1040 [2019-05-23 09:34:41,306 INFO L146 ILogger]: Without dead ends: 1040 [2019-05-23 09:34:41,307 INFO L146 ILogger]: 0 DeclaredPredicates, 1027 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-05-23 09:34:41,307 INFO L146 ILogger]: Start minimizeSevpa. Operand 1040 states. [2019-05-23 09:34:41,310 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 1040 to 1035. [2019-05-23 09:34:41,310 INFO L146 ILogger]: Start removeUnreachable. Operand 1035 states. [2019-05-23 09:34:41,311 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1035 transitions. [2019-05-23 09:34:41,311 INFO L146 ILogger]: Start accepts. Automaton has 1035 states and 1035 transitions. Word has length 1028 [2019-05-23 09:34:41,311 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:34:41,311 INFO L146 ILogger]: Abstraction has 1035 states and 1035 transitions. [2019-05-23 09:34:41,311 INFO L146 ILogger]: Interpolant automaton has 174 states. [2019-05-23 09:34:41,312 INFO L146 ILogger]: Start isEmpty. Operand 1035 states and 1035 transitions. [2019-05-23 09:34:41,316 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 1035 [2019-05-23 09:34:41,316 INFO L146 ILogger]: Found error trace [2019-05-23 09:34:41,316 INFO L146 ILogger]: trace histogram [172, 172, 172, 172, 172, 172, 1, 1] [2019-05-23 09:34:41,317 INFO L146 ILogger]: === Iteration 173 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:34:41,317 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:34:41,317 INFO L146 ILogger]: Analyzing trace with hash -2128861375, now seen corresponding path program 172 times [2019-05-23 09:34:41,317 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:34:41,351 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:34:41,359 INFO L146 ILogger]: Trace formula consists of 1381 conjuncts, 174 conjunts are in the unsatisfiable core [2019-05-23 09:34:41,363 INFO L146 ILogger]: Computing forward predicates...