def check_loop_result3():
parse_wrap(Syntax.primitivedp_expr,
'code mcdp_dp_tests.inv_mult_plots.CounterMap___(n=3)')[0]
parse_wrap(Syntax.ndpt_simple_dp_model,
"""
dp {
requires x [Nat]
provides c [Nat]
implemented-by code mcdp_dp_tests.inv_mult_plots.CounterMap___(n=3)
}
""")[0]
assert_semantic_error("""
mcdp {
s = instance dp {
requires x [Nat]
provides c [Nat]
# semantic error: does not exist
implemented-by code mcdp_dp_tests.inv_mult_plots.CounterMap___(n=3)
}
}"""
)
assert_semantic_error("""
mcdp {
s = instance dp {
requires x [Nat]
provides c [Nat]
# semantic error: not a DP
implemented-by code mcdp_dp_tests.inv_mult_plots.CounterMap(n=3)
}
}"""
)
ndp = parse_ndp("""
mcdp {
adp1 = dp {
requires x [Nat]
provides c [Nat]
implemented-by code mcdp_dp_tests.inv_mult_plots.CounterDP(n=3)
}
s = instance adp1
s.c >= s.x
}"""
)
# UNat = UpperSets(Nat())
dp = ndp.get_dp()
print dp
res = dp.solve(())
print res.__repr__()
One = PosetProduct(())
U1 = UpperSets(One)
U1.check_equal(res, One.U(()))
ndp = parse_ndp("""
mcdp {
adp1 = dp {
requires x [Nat]
provides c [Nat]
implemented-by code mcdp_dp_tests.inv_mult_plots.CounterDP(n=3)
}
adp2 = dp {
requires x [Nat]
provides c [Nat]
implemented-by code mcdp_dp_tests.inv_mult_plots.CounterDP(n=2)
}
s = instance choose(a: adp1, b: adp2)
s.c >= s.x
requires x for s
}"""
)
N = Nat()
UNat = UpperSets(N)
dp = ndp.get_dp()
print dp
res = dp.solve(())
print res
UNat.check_equal(res, N.U(2))
