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.r504-tall-171649612400276.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 ltsminxred
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 r504-tall-171649612400276
=====================================================================

--------------------
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 1717226868218

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:27:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:27:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:27:49] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-01 07:27:49] [INFO ] Transformed 135 places.
[2024-06-01 07:27:49] [INFO ] Transformed 230 transitions.
[2024-06-01 07:27:49] [INFO ] Found NUPN structural information;
[2024-06-01 07:27:49] [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-06-01 07:27:49] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 177 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-06-01 07:27:49] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-06-01 07:27:49] [INFO ] Computed 26 invariants in 15 ms
[2024-06-01 07:27:50] [INFO ] Implicit Places using invariants in 231 ms returned [67, 68, 69]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 266 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 3 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 296 ms. Remains : 99/102 places, 180/180 transitions.
Support contains 55 out of 99 places after structural reductions.
[2024-06-01 07:27:50] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:27:50] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:27:50] [INFO ] Input system was already deterministic with 180 transitions.
Reduction of identical properties reduced properties to check from 18 to 15
RANDOM walk for 4728 steps (0 resets) in 240 ms. (19 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 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:27:50] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-06-01 07:27:50] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 07:27:50] [INFO ] Implicit Places using invariants in 95 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 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 102 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 617 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 43 steps with 12 reset in 3 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-02 finished in 787 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 3 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:27:51] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:27:51] [INFO ] Invariant cache hit.
[2024-06-01 07:27:51] [INFO ] Implicit Places using invariants in 237 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 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 245 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 209 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 4091 reset in 323 ms.
Stack based approach found an accepted trace after 553 steps with 24 reset with depth 83 and stack size 83 in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-03 finished in 817 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 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:27:52] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:27:52] [INFO ] Invariant cache hit.
[2024-06-01 07:27:52] [INFO ] Implicit Places using invariants in 77 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 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 82 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 1190 reset in 280 ms.
Stack based approach found an accepted trace after 1130 steps with 16 reset with depth 32 and stack size 32 in 6 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-04 finished in 497 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 22 ms. Remains 96 /99 variables (removed 3) and now considering 177/180 (removed 3) transitions.
[2024-06-01 07:27:52] [INFO ] Flow matrix only has 141 transitions (discarded 36 similar events)
// Phase 1: matrix 141 rows 96 cols
[2024-06-01 07:27:52] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 07:27:52] [INFO ] Implicit Places using invariants in 80 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 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 1 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 9 ms. Remains 94 /95 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2024-06-01 07:27:52] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 94 cols
[2024-06-01 07:27:52] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 07:27:52] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 07:27:52] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
[2024-06-01 07:27:52] [INFO ] Invariant cache hit.
[2024-06-01 07:27:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 07:27:53] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 197 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 310 ms. Remains : 94/99 places, 176/180 transitions.
Stuttering acceptance computed with spot in 107 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 10 reset in 191 ms.
Stack based approach found an accepted trace after 354 steps with 7 reset with depth 183 and stack size 183 in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-06 finished in 633 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 4 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:27:53] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-06-01 07:27:53] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 07:27:53] [INFO ] Implicit Places using invariants in 67 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 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 74 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 162 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 25140 reset in 152 ms.
Product exploration explored 100000 steps with 24962 reset in 183 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 216 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 94 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 13 steps (0 resets) in 7 ms. (1 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 286 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 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 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 3 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:27:54] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 98 cols
[2024-06-01 07:27:54] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:27:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 07:27:54] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:27:54] [INFO ] Invariant cache hit.
[2024-06-01 07:27:54] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 07:27:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:27:55] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:27:55] [INFO ] Invariant cache hit.
[2024-06-01 07:27:55] [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-06-01 07:27:55] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 12 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:27:55] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 13 places in 41 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-06-01 07:27:56] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 22 places in 40 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-06-01 07:27:57] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 9 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 13 places in 36 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-06-01 07:27:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 19 places in 37 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-06-01 07:27:59] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 19 places in 41 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-06-01 07:28:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 23 places in 45 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-06-01 07:28:01] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 19 places in 39 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-06-01 07:28:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 16 places in 41 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-06-01 07:28:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 5/234 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 15 places in 38 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-06-01 07:28:05] [INFO ] Deduced a trap composed of 17 places in 45 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-06-01 07:28:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 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-06-01 07:28:09] [INFO ] Deduced a trap composed of 16 places in 46 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 19834 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-06-01 07:28:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 16 places in 38 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-06-01 07:28:20] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 25 places in 41 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-06-01 07:28:23] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 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-06-01 07:28:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 26 places in 43 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-06-01 07:28:33] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 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-06-01 07:28:40] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/560 constraints. Problems are: Problem set: 24 solved, 152 unsolved
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 30015 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 49971ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 49986ms
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 50201 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 119 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 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 16 steps (0 resets) in 6 ms. (2 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 132 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 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25018 reset in 156 ms.
Product exploration explored 100000 steps with 24968 reset in 197 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 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 0 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-06-01 07:28:46] [INFO ] Redundant transitions in 4 ms returned []
Running 152 sub problems to find dead transitions.
[2024-06-01 07:28:46] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2024-06-01 07:28:46] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 07:28:46] [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-06-01 07:28:47] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 12 places in 37 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-06-01 07:28:48] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [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-06-01 07:28:49] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:49] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:50] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 20 places in 43 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-06-01 07:28:51] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:51] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 3 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 11/209 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 5 ms to minimize.
[2024-06-01 07:28:53] [INFO ] Deduced a trap composed of 19 places in 41 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-06-01 07:28:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 6/223 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:28:54] [INFO ] Deduced a trap composed of 18 places in 47 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-06-01 07:28:55] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 19 places in 40 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-06-01 07:28:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 17/261 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 2/263 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/98 variables, 15/278 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 18 places in 38 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-06-01 07:29:01] [INFO ] Deduced a trap composed of 16 places in 43 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-06-01 07:29:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 2/287 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:02] [INFO ] Deduced a trap composed of 20 places in 33 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-06-01 07:29:03] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 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-06-01 07:29:08] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 26 places in 34 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
At refinement iteration 28 (OVERLAPS) 0/226 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 413 constraints, problems are : Problem set: 4 solved, 148 unsolved in 28875 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-06-01 07:29:16] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:16] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/299 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:17] [INFO ] Deduced a trap composed of 16 places in 40 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-06-01 07:29:18] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 5/310 constraints. Problems are: Problem set: 4 solved, 148 unsolved
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 18 places in 43 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-06-01 07:29:19] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:19] [INFO ] Deduced a trap composed of 19 places in 38 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 16309 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 45233ms problems are : Problem set: 4 solved, 148 unsolved
Search for dead transitions found 4 dead transitions in 45236ms
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.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 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 45279 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 0 ms. Remains 98 /98 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 07:29:31] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 98 cols
[2024-06-01 07:29:31] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 07:29:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 07:29:31] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-06-01 07:29:31] [INFO ] Invariant cache hit.
[2024-06-01 07:29:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 07:29:31] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-06-01 07:29:31] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
[2024-06-01 07:29:31] [INFO ] Invariant cache hit.
[2024-06-01 07:29:31] [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-06-01 07:29:32] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 6 places in 26 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-06-01 07:29:33] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:33] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:35] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 19 places in 36 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-06-01 07:29:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:37] [INFO ] Deduced a trap composed of 29 places in 38 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-06-01 07:29:38] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:38] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 14/233 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:39] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 17 places in 34 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-06-01 07:29:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:29:40] [INFO ] Deduced a trap composed of 14 places in 39 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-06-01 07:29:41] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:41] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:41] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:41] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 29 places in 37 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-06-01 07:29:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:42] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:29:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:44] [INFO ] Deduced a trap composed of 14 places in 39 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-06-01 07:29:45] [INFO ] Deduced a trap composed of 27 places in 38 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-06-01 07:29:45] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 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 20868 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-06-01 07:29:54] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:29:54] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 28 places in 40 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-06-01 07:29:55] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:29:55] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 5/299 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:29:56] [INFO ] Deduced a trap composed of 17 places in 35 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-06-01 07:30:01] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:30:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:30:03] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:30:08] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:30:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:13] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:30:16] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/226 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 0/582 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 582 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30010 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: 192/192 constraints]
After SMT, in 50916ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 50918ms
Finished structural reductions in LTL mode , in 1 iterations and 51096 ms. Remains : 98/98 places, 156/156 transitions.
Treatment of property LamportFastMutEx-PT-4-LTLFireability-07 finished in 149448 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 1 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:30:22] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-06-01 07:30:22] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 07:30:22] [INFO ] Implicit Places using invariants in 75 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 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 128 ms :[p1, p1, p1, true]
Running random walk in product with property : LamportFastMutEx-PT-4-LTLFireability-08
Product exploration explored 100000 steps with 33177 reset in 98 ms.
Product exploration explored 100000 steps with 33400 reset in 112 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 102 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 124 ms :[p1, p1, p1, true]
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-06-01 07:30:23] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 98 cols
[2024-06-01 07:30:23] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 07:30:23] [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 143 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 30 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 191ms 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 230 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 99 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 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 1 ms. Remains 98 /98 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:30:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:30:24] [INFO ] Invariant cache hit.
[2024-06-01 07:30:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 07:30:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:30:24] [INFO ] Invariant cache hit.
[2024-06-01 07:30:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 07:30:24] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:30:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:30:24] [INFO ] Invariant cache hit.
[2024-06-01 07:30:24] [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-06-01 07:30:24] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 13 places in 38 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 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-06-01 07:30:25] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:25] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:30:26] [INFO ] Deduced a trap composed of 22 places in 39 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-06-01 07:30:26] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:30:27] [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-06-01 07:30:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:30:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 19 places in 35 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-06-01 07:30:29] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:29] [INFO ] Deduced a trap composed of 19 places in 35 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-06-01 07:30:30] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:30] [INFO ] Deduced a trap composed of 23 places in 38 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-06-01 07:30:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:31] [INFO ] Deduced a trap composed of 19 places in 38 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-06-01 07:30:31] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:30:32] [INFO ] Deduced a trap composed of 16 places in 37 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-06-01 07:30:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 19 places in 35 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-06-01 07:30:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:30:34] [INFO ] Deduced a trap composed of 15 places in 34 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-06-01 07:30:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/243 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:30:35] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:30:36] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 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-06-01 07:30:39] [INFO ] Deduced a trap composed of 16 places in 48 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 19502 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-06-01 07:30:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:30:45] [INFO ] Deduced a trap composed of 16 places in 33 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-06-01 07:30:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:49] [INFO ] Deduced a trap composed of 25 places in 37 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-06-01 07:30:52] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:30:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:30:52] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:30:52] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:30:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:30:52] [INFO ] Deduced a trap composed of 17 places in 40 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-06-01 07:30:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:30:58] [INFO ] Deduced a trap composed of 26 places in 41 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-06-01 07:31:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:31:02] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:03] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 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-06-01 07:31:09] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/560 constraints. Problems are: Problem set: 24 solved, 152 unsolved
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 30011 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 49562ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 49566ms
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 1 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 49764 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 108 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 216 ms :[true, p1, p1, (AND (NOT p0) p1)]
RANDOM walk for 3332 steps (0 resets) in 48 ms. (68 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 214 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 130 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 123 ms :[true, p1, p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 100 ms :[true, p1, p1, (AND (NOT p0) p1)]
Entered a terminal (fully accepting) state of product in 24 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 52129 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 2 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:31:14] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 99 cols
[2024-06-01 07:31:14] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 07:31:15] [INFO ] Implicit Places using invariants in 73 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 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 78 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 109 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 3359 steps with 665 reset in 13 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-09 finished in 218 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 0 ms. Remains 99 /99 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-01 07:31:15] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:31:15] [INFO ] Invariant cache hit.
[2024-06-01 07:31:15] [INFO ] Implicit Places using invariants in 69 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 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 72 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 64 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 113 ms.
Product exploration explored 100000 steps with 50000 reset in 126 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 15 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 403 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-06-01 07:31:15] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:31:15] [INFO ] Invariant cache hit.
[2024-06-01 07:31:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 07:31:15] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:31:15] [INFO ] Invariant cache hit.
[2024-06-01 07:31:15] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-01 07:31:15] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-01 07:31:15] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:31:15] [INFO ] Invariant cache hit.
[2024-06-01 07:31:15] [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-06-01 07:31:16] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:31:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 20 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 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-06-01 07:31:17] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:17] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 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-06-01 07:31:18] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:18] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 19 places in 39 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-06-01 07:31:19] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:31:19] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 18 places in 39 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-06-01 07:31:20] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 20 places in 35 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-06-01 07:31:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:31:21] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 16 places in 32 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-06-01 07:31:22] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 12/241 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:31:24] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 6/247 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 20 places in 35 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-06-01 07:31:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:25] [INFO ] Deduced a trap composed of 18 places in 41 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 16152 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-06-01 07:31:36] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:31:36] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:31:36] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:36] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 4/536 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:31:38] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:31:38] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:31:38] [INFO ] Deduced a trap composed of 15 places in 44 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-06-01 07:31:40] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:31:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 2/541 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:31:45] [INFO ] Deduced a trap composed of 18 places in 38 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-06-01 07:31:49] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:31:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 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-06-01 07:31:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/243 variables, 2/547 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2024-06-01 07:31:59] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:31:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:31:59] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:31:59] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 4/551 constraints. Problems are: Problem set: 24 solved, 152 unsolved
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 30010 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 46213ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 46215ms
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 46436 ms. Remains : 99/99 places, 156/180 transitions.
Stuttering acceptance computed with spot in 107 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 30 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-11 finished in 46555 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-06-01 07:32:02] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:32:02] [INFO ] Invariant cache hit.
[2024-06-01 07:32:02] [INFO ] Implicit Places using invariants in 83 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 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 88 ms. Remains : 98/99 places, 180/180 transitions.
Stuttering acceptance computed with spot in 155 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 125 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-4-LTLFireability-14 finished in 257 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-06-01 07:32:02] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:32:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:32:02] [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 253153 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : LamportFastMutEx-PT-4-LTLFireability-07

BK_STOP 1717227122850

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
mcc2024
ltl formula name LamportFastMutEx-PT-4-LTLFireability-07
ltl formula formula --ltl=/tmp/3732/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 99 places, 180 transitions and 738 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3732/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3732/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3732/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3732/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected

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="ltsminxred"
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 ltsminxred"
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 r504-tall-171649612400276"
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 ;