twa: no default argument for property setters

This is a preliminary for the renaming suggested in #116.

* src/twa/twa.hh (prop_state_based_acc, prop_inherently_weak,
prop_deterministic, prop_unambiguous, prop_stutter_invariant,
prop_stutter_sensitive): Do not default the argument to true.
* src/parseaut/parseaut.yy, src/twaalgos/degen.cc,
src/twaalgos/dtbasat.cc, src/twaalgos/dtgbasat.cc,
src/twaalgos/minimize.cc, src/twaalgos/randomgraph.cc,
src/twaalgos/remfin.cc, src/twaalgos/sbacc.cc,
src/twaalgos/simulation.cc, src/twaalgos/totgba.cc,
wrap/python/tests/remfin.py: Adjust.

src/twaalgos/degen.cc

@@ -207,7 +207,7 @@ namespace spot
       res->copy_ap_of(a);
       res->set_buchi();
       if (want_sba)
-	res->prop_state_based_acc();
+	res->prop_state_based_acc(true);
       // Preserve determinism, weakness, and stutter-invariance
       res->prop_copy(a, { false, true, true, true });
 

src/twaalgos/dtbasat.cc

@@ -640,8 +640,8 @@ namespace spot
       a->copy_ap_of(aut);
       acc_cond::mark_t acc = a->set_buchi();
       if (state_based)
-	a->prop_state_based_acc();
-      a->prop_deterministic();
+	a->prop_state_based_acc(true);
+      a->prop_deterministic(true);
       a->new_states(satdict.cand_size);
 
       unsigned last_aut_trans = -1U;

src/twaalgos/dtgbasat.cc

@@ -1026,8 +1026,8 @@ namespace spot
       auto a = make_twa_graph(autdict);
       a->copy_ap_of(aut);
       if (state_based)
-	a->prop_state_based_acc();
-      a->prop_deterministic();
+	a->prop_state_based_acc(true);
+      a->prop_deterministic(true);
       a->set_acceptance(satdict.cand_nacc, satdict.cand_acc);
       a->new_states(satdict.cand_size);
 

src/twaalgos/minimize.cc

@@ -122,7 +122,7 @@ namespace spot
       auto dict = a->get_dict();
       auto res = make_twa_graph(dict);
       res->copy_ap_of(a);
-      res->prop_state_based_acc();
+      res->prop_state_based_acc(true);
 
       // For each set, create a state in the resulting automaton.
       // For a state s, state_num[s] is the number of the state in the minimal
@@ -481,9 +481,9 @@ namespace spot
     build_state_set(det_a, non_final);
     auto res = minimize_dfa(det_a, final, non_final);
     res->prop_copy(a, { false, false, false, true });
-    res->prop_deterministic();
-    res->prop_inherently_weak();
-    res->prop_state_based_acc();
+    res->prop_deterministic(true);
+    res->prop_inherently_weak(true);
+    res->prop_state_based_acc(true);
     return res;
   }
 
@@ -582,8 +582,8 @@ namespace spot
 
     auto res = minimize_dfa(det_a, final, non_final);
     res->prop_copy(a, { false, false, false, true });
-    res->prop_deterministic();
-    res->prop_inherently_weak();
+    res->prop_deterministic(true);
+    res->prop_inherently_weak(true);
     return res;
   }
 

src/twaalgos/randomgraph.cc

@@ -130,9 +130,9 @@ namespace spot
       throw std::invalid_argument("random_graph() requires n>0 states");
     auto res = make_twa_graph(dict);
     if (deterministic)
-      res->prop_deterministic();
+      res->prop_deterministic(true);
     if (state_acc)
-      res->prop_state_based_acc();
+      res->prop_state_based_acc(true);
 
     int props_n = ap->size();
     int* props = new int[props_n];

src/twaalgos/remfin.cc

@@ -468,8 +468,8 @@ namespace spot
       // We will modify res in place, and the resulting
       // automaton will only have one acceptance set.
       acc_cond::mark_t all_acc = res->set_buchi();
-      res->prop_state_based_acc();
-      res->prop_deterministic();
+      res->prop_state_based_acc(true);
+      res->prop_deterministic(true);
 
       unsigned sink = res->num_states();
       for (unsigned src = 0; src < sink; ++src)
@@ -746,7 +746,7 @@ namespace spot
 
     // If the input had no Inf, the output is a state-based automaton.
     if (allinf == 0U)
-      res->prop_state_based_acc();
+      res->prop_state_based_acc(true);
 
     res->purge_dead_states();
     trace << "before cleanup: " << res->get_acceptance() << '\n';

src/twaalgos/sbacc.cc

@@ -33,7 +33,7 @@ namespace spot
     res->copy_ap_of(old);
     res->copy_acceptance_of(old);
     res->prop_copy(old, {false, true, true, true});
-    res->prop_state_based_acc();
+    res->prop_state_based_acc(true);
 
     typedef std::pair<unsigned, acc_cond::mark_t> pair_t;
     std::map<pair_t, unsigned> s2n;

src/twaalgos/simulation.cc

@@ -640,9 +640,9 @@ namespace spot
 			 true, // stutter inv.
 		       });
         if (nb_minato == nb_satoneset && !Cosimulation)
-	  res->prop_deterministic();
+	  res->prop_deterministic(true);
 	if (Sba)
-	  res->prop_state_based_acc();
+	  res->prop_state_based_acc(true);
 	return res;
       }
 

src/twaalgos/totgba.cc

@@ -334,10 +334,10 @@ namespace spot
 	assert(cnf.front().mark == 0U);
 	res = make_twa_graph(aut->get_dict());
 	res->set_init_state(res->new_state());
-	res->prop_state_based_acc();
-	res->prop_inherently_weak();
-	res->prop_deterministic();
-	res->prop_stutter_invariant();
+	res->prop_state_based_acc(true);
+	res->prop_inherently_weak(true);
+	res->prop_deterministic(true);
+	res->prop_stutter_invariant(true);
 	return res;
       }