Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611100276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611100276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 17K Apr 13 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 13 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 222K Apr 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 114K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716532971182

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 06:42:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 06:42:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:42:52] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 06:42:52] [INFO ] Transformed 135 places.
[2024-05-24 06:42:52] [INFO ] Transformed 230 transitions.
[2024-05-24 06:42:52] [INFO ] Found NUPN structural information;
[2024-05-24 06:42:52] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2024-05-24 06:42:52] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-4-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 180/180 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:42:52] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 06:42:52] [INFO ] Computed 26 invariants in 13 ms
[2024-05-24 06:42:52] [INFO ] Implicit Places using invariants in 230 ms returned [67, 68, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 272 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 303 ms. Remains : 99/102 places, 180/180 transitions.
Support contains 55 out of 99 places after structural reductions.
[2024-05-24 06:42:53] [INFO ] Flatten gal took : 66 ms
[2024-05-24 06:42:53] [INFO ] Flatten gal took : 42 ms
[2024-05-24 06:42:53] [INFO ] Input system was already deterministic with 180 transitions.
Reduction of identical properties reduced properties to check from 18 to 15
RANDOM walk for 2920 steps (0 resets) in 265 ms. (10 steps per ms) remains 0/15 properties
Computed a total of 1 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1) U G(p2))))'
Support contains 13 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 12 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:42:54] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 06:42:54] [INFO ] Computed 23 invariants in 1 ms
[2024-05-24 06:42:54] [INFO ] Implicit Places using invariants in 171 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 185 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 762 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (AND (NOT p2) p1), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-02
Entered a terminal (fully accepting) state of product in 75 steps with 19 reset in 3 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-02 finished in 1135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&X(p0)))&&G(F(p0)))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:42:55] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:42:55] [INFO ] Invariant cache hit.
[2024-05-24 06:42:55] [INFO ] Implicit Places using invariants in 152 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-03
Product exploration explored 100000 steps with 4112 reset in 464 ms.
Stack based approach found an accepted trace after 2522 steps with 114 reset with depth 33 and stack size 33 in 6 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-03 finished in 938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 18 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:42:56] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:42:56] [INFO ] Invariant cache hit.
[2024-05-24 06:42:56] [INFO ] Implicit Places using invariants in 74 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-04
Product exploration explored 100000 steps with 1192 reset in 371 ms.
Stack based approach found an accepted trace after 1381 steps with 18 reset with depth 92 and stack size 92 in 4 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-04 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 99 transition count 177
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 96 transition count 177
Applied a total of 6 rules in 40 ms. Remains 96 /99 variables (removed 3) and now considering 177/180 (removed 3) transitions.
[2024-05-24 06:42:56] [INFO ] Flow matrix only has 141 transitions (discarded 36 similar events)
// Phase 1: matrix 141 rows 96 cols
[2024-05-24 06:42:56] [INFO ] Computed 23 invariants in 6 ms
[2024-05-24 06:42:56] [INFO ] Implicit Places using invariants in 133 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/99 places, 177/180 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 95 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 176
Applied a total of 2 rules in 8 ms. Remains 94 /95 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-05-24 06:42:56] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 94 cols
[2024-05-24 06:42:56] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 06:43:01] [INFO ] Implicit Places using invariants in 4882 ms returned []
[2024-05-24 06:43:01] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
[2024-05-24 06:43:01] [INFO ] Invariant cache hit.
[2024-05-24 06:43:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 06:43:07] [INFO ] Implicit Places using invariants and state equation in 5499 ms returned []
Implicit Place search using SMT with State Equation took 10397 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/99 places, 176/180 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10589 ms. Remains : 94/99 places, 176/180 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 201 ms.
Stack based approach found an accepted trace after 149 steps with 0 reset with depth 150 and stack size 150 in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-06 finished in 10978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p1)&&p0))))'
Support contains 25 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:43:07] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 06:43:07] [INFO ] Computed 23 invariants in 3 ms
[2024-05-24 06:43:07] [INFO ] Implicit Places using invariants in 72 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-07
Product exploration explored 100000 steps with 24955 reset in 174 ms.
Product exploration explored 100000 steps with 25067 reset in 157 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 13 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:43:08] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 98 cols
[2024-05-24 06:43:08] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 06:43:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 06:43:08] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:43:08] [INFO ] Invariant cache hit.
[2024-05-24 06:43:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 06:43:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 06:43:09] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:43:09] [INFO ] Invariant cache hit.
[2024-05-24 06:43:09] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 10 ms to minimize.
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:43:10] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 11 solved, 165 unsolved
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:43:11] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 06:43:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 4 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:43:13] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 8 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:43:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:43:15] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:43:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:43:16] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 20 places in 2052 ms of which 20 ms to minimize.
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 19/199 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:43:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:43:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:43:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:43:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 8/207 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:19] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 06:43:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 8/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:43:20] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-24 06:43:21] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-24 06:43:22] [INFO ] Deduced a trap composed of 29 places in 1892 ms of which 30 ms to minimize.
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 7/222 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:43:23] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-24 06:43:24] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:43:24] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 7/229 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:24] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:43:24] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:43:24] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 5/234 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:43:25] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:43:26] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:43:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 8/242 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/243 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:27] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-24 06:43:27] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-24 06:43:27] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2024-05-24 06:43:29] [INFO ] Deduced a trap composed of 20 places in 1598 ms of which 2 ms to minimize.
[2024-05-24 06:43:29] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:43:29] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-24 06:43:29] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:43:29] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 8/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (OVERLAPS) 144/242 variables, 98/349 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 24/373 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:32] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 1/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/374 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 374 constraints, problems are : Problem set: 24 solved, 152 unsolved in 29167 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 132/132 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 86/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 16/202 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/206 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 46/252 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:43:40] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:43:40] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 3/255 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/255 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 144/242 variables, 98/353 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 24/377 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 152/529 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:46] [INFO ] Deduced a trap composed of 14 places in 2022 ms of which 30 ms to minimize.
[2024-05-24 06:43:46] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:43:46] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-24 06:43:46] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 06:43:46] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 5/534 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:49] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2024-05-24 06:43:50] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-24 06:43:50] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-24 06:43:50] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:43:50] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-24 06:43:50] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 6/540 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/540 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:43:55] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/242 variables, 2/542 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:43:59] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:43:59] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:43:59] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:43:59] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:43:59] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 17/559 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/559 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:44:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 560 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30023 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 166/166 constraints]
After SMT, in 59300ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 59313ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/98 places, 156/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59483 ms. Remains : 98/98 places, 156/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25069 reset in 127 ms.
Product exploration explored 100000 steps with 25110 reset in 131 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 13 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 156
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 4 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 06:44:09] [INFO ] Redundant transitions in 4 ms returned []
Running 152 sub problems to find dead transitions.
[2024-05-24 06:44:09] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2024-05-24 06:44:09] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 06:44:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/116 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:44:10] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:44:10] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 1 solved, 151 unsolved
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:44:12] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-24 06:44:13] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:44:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:13] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:44:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:44:14] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 18/198 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:44:16] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 11/209 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 4 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 8/217 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:44:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:44:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:44:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:44:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 6/223 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:19] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/224 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 20/244 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 17/261 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 2/263 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:44:23] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 15/278 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:24] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:25] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:44:25] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-24 06:44:25] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:44:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:44:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/98 variables, 6/284 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 1/285 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:26] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:44:26] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 2/287 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:27] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:44:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:44:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/98 variables, 4/291 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:44:28] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 2/293 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/98 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 23 (OVERLAPS) 128/226 variables, 98/391 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/226 variables, 20/411 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/226 variables, 0/411 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:34] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 1 ms to minimize.
[2024-05-24 06:44:34] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/226 variables, 2/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/226 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 226/226 variables, and 413 constraints, problems are : Problem set: 4 solved, 148 unsolved in 30014 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 175/175 constraints]
Escalating to Integer solving :Problem set: 4 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 90/90 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 6/96 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 100/196 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/196 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 8/98 variables, 16/212 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 8/220 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 75/295 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:43] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-24 06:44:43] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-24 06:44:44] [INFO ] Deduced a trap composed of 16 places in 1022 ms of which 32 ms to minimize.
[2024-05-24 06:44:44] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/299 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:44] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-24 06:44:44] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-24 06:44:45] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-24 06:44:45] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-24 06:44:45] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:44:45] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 6/305 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:44:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:44:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:44:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:44:46] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 5/310 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 1/311 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-05-24 06:44:47] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:44:47] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:44:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:44:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 4/315 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 128/226 variables, 98/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 20/433 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 148/581 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/581 constraints. Problems are: Problem set: 4 solved, 148 unsolved
At refinement iteration 17 (OVERLAPS) 0/226 variables, 0/581 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 581 constraints, problems are : Problem set: 4 solved, 148 unsolved in 24183 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 148/152 constraints, Known Traps: 195/195 constraints]
After SMT, in 54280ms problems are : Problem set: 4 solved, 148 unsolved
Search for dead transitions found 4 dead transitions in 54282ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/98 places, 152/156 transitions.
Graph (complete) has 417 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 ms. Remains 94 /98 variables (removed 4) and now considering 152/152 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/98 places, 152/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54344 ms. Remains : 94/98 places, 152/156 transitions.
Support contains 13 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-24 06:45:04] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2024-05-24 06:45:04] [INFO ] Computed 22 invariants in 2 ms
[2024-05-24 06:45:04] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-24 06:45:04] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 06:45:04] [INFO ] Invariant cache hit.
[2024-05-24 06:45:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-24 06:45:04] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-24 06:45:04] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-05-24 06:45:04] [INFO ] Invariant cache hit.
[2024-05-24 06:45:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 16/116 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 06:45:05] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 22 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:45:06] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-05-24 06:45:07] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:45:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:45:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:45:07] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-24 06:45:08] [INFO ] Deduced a trap composed of 23 places in 1434 ms of which 1 ms to minimize.
[2024-05-24 06:45:08] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:45:08] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:45:08] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-24 06:45:08] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:45:08] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-24 06:45:09] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 13 ms to minimize.
[2024-05-24 06:45:10] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2024-05-24 06:45:10] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2024-05-24 06:45:10] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-24 06:45:10] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-05-24 06:45:10] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2024-05-24 06:45:11] [INFO ] Deduced a trap composed of 22 places in 789 ms of which 2 ms to minimize.
[2024-05-24 06:45:11] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-24 06:45:11] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2024-05-24 06:45:11] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-24 06:45:11] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-24 06:45:12] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-24 06:45:12] [INFO ] Deduced a trap composed of 9 places in 584 ms of which 2 ms to minimize.
[2024-05-24 06:45:12] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-24 06:45:12] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2024-05-24 06:45:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-24 06:45:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:14] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:45:15] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 19/219 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:45:16] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 14/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 19/252 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:18] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:45:19] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:45:19] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:45:20] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-05-24 06:45:21] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:21] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:45:21] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2024-05-24 06:45:21] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-24 06:45:22] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:45:22] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:45:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:45:23] [INFO ] Deduced a trap composed of 20 places in 1538 ms of which 31 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:24] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:24] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:45:24] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:45:24] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:25] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/98 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:26] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:26] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-24 06:45:26] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:45:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-24 06:45:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:45:26] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 6/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (OVERLAPS) 128/226 variables, 98/382 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/226 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 23 (OVERLAPS) 0/226 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 402 constraints, problems are : Problem set: 0 solved, 152 unsolved in 28224 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 164/164 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 113/213 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 16/229 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 51/284 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:45:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:45:35] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:39] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:45:39] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:45:39] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:45:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 128/226 variables, 98/401 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 152/573 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:52] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:45:52] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-24 06:45:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 226/226 variables, and 576 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30018 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 186/186 constraints]
After SMT, in 58279ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 58282ms
Finished structural reductions in LTL mode , in 1 iterations and 58599 ms. Remains : 98/98 places, 156/156 transitions.
Treatment of property LamportFastMutEx-PT-4-LTLFireability-07 finished in 175387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!p1))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:46:02] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 06:46:03] [INFO ] Computed 23 invariants in 1 ms
[2024-05-24 06:46:03] [INFO ] Implicit Places using invariants in 136 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 183 ms :[p1, p1, p1, true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 33289 reset in 112 ms.
Product exploration explored 100000 steps with 33407 reset in 164 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, p1, p1, true]
RANDOM walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
[2024-05-24 06:46:04] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 98 cols
[2024-05-24 06:46:04] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 06:46:04] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 41/45 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/133 variables, 45/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/174 variables, 17/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 17/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/206 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 32/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/242 variables, 36/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 242 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 45/242 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Domain max(s): 4/98 constraints, Positive P Invariants (semi-flows): 9/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/24 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 289ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 210 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 156 ms :[true, p1, p1, (AND (NOT p0) p1)]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:46:04] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:04] [INFO ] Invariant cache hit.
[2024-05-24 06:46:05] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-24 06:46:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:05] [INFO ] Invariant cache hit.
[2024-05-24 06:46:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 06:46:05] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 06:46:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:05] [INFO ] Invariant cache hit.
[2024-05-24 06:46:05] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 06:46:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:46:05] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 06:46:05] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:46:05] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/140 constraints. Problems are: Problem set: 11 solved, 165 unsolved
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:46:06] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-24 06:46:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:46:08] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:46:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 19/199 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:46:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:46:11] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:46:11] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:46:11] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:11] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:11] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 8/207 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:11] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 8/215 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:12] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 7/222 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:46:13] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:46:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:46:14] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:46:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:46:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 7/229 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:14] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:46:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:15] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-24 06:46:15] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-24 06:46:15] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 5/234 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:21] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:46:24] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:46:24] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:24] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:24] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:46:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 8/242 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/243 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 98/242 variables, and 243 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30025 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/98 constraints, ReadFeed: 0/24 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 123/123 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 6/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 79/179 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/179 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/98 variables, 16/195 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 4/199 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 44/243 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:46:36] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:36] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/247 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:36] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:46:36] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 11/258 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:37] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:46:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:46:38] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 3/261 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:46:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:38] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 3/264 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:46:39] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:46:39] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 3/267 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:40] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:46:40] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:46:40] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:46:40] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 4/271 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:40] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:46:40] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 2/273 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:41] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:41] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:46:41] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 3/276 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:41] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 1/277 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 0/277 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 144/242 variables, 98/375 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 24/399 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 152/551 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:46:46] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:46:46] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 3/554 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/554 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 22 (OVERLAPS) 0/242 variables, 0/554 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 554 constraints, problems are : Problem set: 24 solved, 152 unsolved in 20930 ms.
Refiners :[Domain max(s): 98/98 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 160/160 constraints]
After SMT, in 51005ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 51007ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 98/98 places, 156/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51279 ms. Remains : 98/98 places, 156/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, p1, p1, (AND (NOT p0) p1)]
RANDOM walk for 4173 steps (0 resets) in 70 ms. (58 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 150 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 169 ms :[true, p1, p1, (AND (NOT p0) p1)]
Entered a terminal (fully accepting) state of product in 236 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-08 finished in 54452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p1)) U G((p0||G(!p0)))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 10 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:46:57] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-05-24 06:46:57] [INFO ] Computed 23 invariants in 1 ms
[2024-05-24 06:46:57] [INFO ] Implicit Places using invariants in 115 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 137 ms :[false, (AND p0 (NOT p1)), true, (AND p0 p1)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-09
Entered a terminal (fully accepting) state of product in 40129 steps with 8040 reset in 54 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-09 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:46:57] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:57] [INFO ] Invariant cache hit.
[2024-05-24 06:46:57] [INFO ] Implicit Places using invariants in 74 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-4-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-4-LTLFireability-10 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:46:58] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:58] [INFO ] Invariant cache hit.
[2024-05-24 06:46:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 06:46:58] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:58] [INFO ] Invariant cache hit.
[2024-05-24 06:46:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-24 06:46:58] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-24 06:46:58] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:46:58] [INFO ] Invariant cache hit.
[2024-05-24 06:46:58] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 23/122 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-24 06:46:58] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:46:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 06:46:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 20/142 constraints. Problems are: Problem set: 19 solved, 157 unsolved
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:46:59] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:47:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 20/162 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:47:01] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/182 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:47:02] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/202 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:03] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:47:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 16/218 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:47:05] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 11/229 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 06:47:06] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 12/241 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:47:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:47:08] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:08] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-24 06:47:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 6/247 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:09] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:09] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:47:09] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-24 06:47:09] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 4/251 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:09] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:47:09] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 2/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 144/243 variables, 99/352 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 28/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/243 variables, 0/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 380 constraints, problems are : Problem set: 24 solved, 152 unsolved in 17362 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 99/99 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 95/95 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 6/101 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 85/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/186 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 4/99 variables, 17/203 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 4/207 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 46/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/253 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 144/243 variables, 99/352 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 28/380 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 152/532 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:20] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 06:47:20] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-24 06:47:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:47:20] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 4/536 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:22] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-24 06:47:22] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-24 06:47:22] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 3/539 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:25] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-24 06:47:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/541 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:30] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/542 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:33] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-24 06:47:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:47:33] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 3/545 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 0/545 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:38] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:47:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/243 variables, 2/547 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-05-24 06:47:42] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 06:47:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-24 06:47:42] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-24 06:47:42] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 4/551 constraints. Problems are: Problem set: 24 solved, 152 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 551 constraints, problems are : Problem set: 24 solved, 152 unsolved in 30015 ms.
Refiners :[Domain max(s): 99/99 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 99/99 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 150/150 constraints]
After SMT, in 47427ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 47430ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 99/99 places, 156/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47630 ms. Remains : 99/99 places, 156/180 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-11
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-11 finished in 47783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (G(!p0)&&p1))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-24 06:47:45] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-05-24 06:47:45] [INFO ] Invariant cache hit.
[2024-05-24 06:47:46] [INFO ] Implicit Places using invariants in 78 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/99 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-14
Entered a terminal (fully accepting) state of product in 123 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-14 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p1)&&p0))))'
[2024-05-24 06:47:46] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:47:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-24 06:47:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 180 transitions and 738 arcs took 4 ms.
Total runtime 294068 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-4

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 99
TRANSITIONS: 180
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3728
MODEL NAME: /home/mcc/execution/412/model
99 places, 180 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-PT-4-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716533276314

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-PT-4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611100276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;