Solving ../../benchmarks/false/cons_not_null.smt2... Inference procedure has parameters: Ice fuel: 200 Timeout: 60s Convolution: right Learning problem is: env: { nat -> {s, z} ; natlist -> {cons, nil} } definition: { (not_null, P: {() -> not_null([cons(x, ll)]) (not_null([nil])) -> BOT} ) } properties: {(not_null([cons(i, l1)])) -> not_null([l1])} over-approximation: {} under-approximation: {} Clause system for inference is: { () -> not_null([cons(x, ll)]) -> 0 (not_null([cons(i, l1)])) -> not_null([l1]) -> 0 (not_null([nil])) -> BOT -> 0 } Solving took 0.041949 seconds. Disproved ------------------- STEPS: ------------------------------------------- Step 0, which took 0.010251 s (model generation: 0.010098, model checking: 0.000153): Model: |_ { not_null -> {{{ Q={}, Q_f={}, Delta= { } Datatype: Convolution form: right }}} } -- Equality automata are defined for: {eq_nat, eq_natlist} _| Teacher's answer: New clause system: { () -> not_null([cons(x, ll)]) -> 3 (not_null([cons(i, l1)])) -> not_null([l1]) -> 1 (not_null([nil])) -> BOT -> 1 } Sat witness: Found: (() -> not_null([cons(x, ll)]), { ll -> nil ; x -> z }) ------------------------------------------- Step 1, which took 0.010565 s (model generation: 0.010540, model checking: 0.000025): Model: |_ { not_null -> {{{ Q={q_gen_6847, q_gen_6849}, Q_f={q_gen_6847}, Delta= { (q_gen_6849, q_gen_6847) -> q_gen_6847 () -> q_gen_6847 () -> q_gen_6849 } Datatype: Convolution form: right }}} } -- Equality automata are defined for: {eq_nat, eq_natlist} _| Teacher's answer: New clause system: { () -> not_null([cons(x, ll)]) -> 3 (not_null([cons(i, l1)])) -> not_null([l1]) -> 1 (not_null([nil])) -> BOT -> 4 } Sat witness: Found: ((not_null([nil])) -> BOT, { }) ------------------------------------------- Step 2, which took 0.010785 s (model generation: 0.010650, model checking: 0.000135): Model: |_ { not_null -> {{{ Q={q_gen_6847, q_gen_6848, q_gen_6849}, Q_f={q_gen_6847}, Delta= { (q_gen_6849, q_gen_6848) -> q_gen_6847 () -> q_gen_6848 () -> q_gen_6849 } Datatype: Convolution form: right }}} } -- Equality automata are defined for: {eq_nat, eq_natlist} _| Teacher's answer: New clause system: { () -> not_null([cons(x, ll)]) -> 3 (not_null([cons(i, l1)])) -> not_null([l1]) -> 4 (not_null([nil])) -> BOT -> 4 } Sat witness: Found: ((not_null([cons(i, l1)])) -> not_null([l1]), { i -> z ; l1 -> nil }) Total time: 0.041949 Reason for stopping: Disproved