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.r224-tall-171649612400267.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 itstools
Input is LamportFastMutEx-PT-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612400267
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 14K Apr 13 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:40 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 6.2K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 07:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 13 07:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 13 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 257K Apr 13 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 77K 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-3-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716569846185

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 16:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 16:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:57:27] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-24 16:57:27] [INFO ] Transformed 100 places.
[2024-05-24 16:57:27] [INFO ] Transformed 156 transitions.
[2024-05-24 16:57:27] [INFO ] Found NUPN structural information;
[2024-05-24 16:57:27] [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_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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3]
[2024-05-24 16:57:27] [INFO ] Parsed PT model containing 100 places and 156 transitions and 664 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 114/114 transitions.
Applied a total of 0 rules in 9 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 16:57:27] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-05-24 16:57:27] [INFO ] Computed 17 invariants in 14 ms
[2024-05-24 16:57:27] [INFO ] Implicit Places using invariants in 230 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 259 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 286 ms. Remains : 68/71 places, 114/114 transitions.
Support contains 25 out of 68 places after structural reductions.
[2024-05-24 16:57:28] [INFO ] Flatten gal took : 29 ms
[2024-05-24 16:57:28] [INFO ] Flatten gal took : 14 ms
[2024-05-24 16:57:28] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 1960 steps (0 resets) in 96 ms. (20 steps per ms) remains 0/10 properties
Computed a total of 1 stabilizing places and 3 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' '!(F((p0&&X((p0&&X(X(G(p1))))))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 16:57:28] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-05-24 16:57:28] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 16:57:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 16:57:28] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:57:28] [INFO ] Invariant cache hit.
[2024-05-24 16:57:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 16:57:28] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 16:57:28] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:57:28] [INFO ] Invariant cache hit.
[2024-05-24 16:57:28] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 15 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:57:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/102 constraints. Problems are: Problem set: 9 solved, 102 unsolved
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:57:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/122 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-24 16:57:31] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 4/130 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:57:32] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 5/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 96/164 variables, 68/203 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 18/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 221 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5261 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 35/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/68 variables, 9/114 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/117 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 18/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:34] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/137 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:34] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 96/164 variables, 68/206 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 18/224 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 93/317 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:35] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 2/319 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:36] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:57:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 16:57:36] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 7/326 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 1/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 327 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5920 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 11272ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 11288ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11506 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 324 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 1 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-01 finished in 12290 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' '!(F(G(p0)))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 114/114 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 68 transition count 111
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 65 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 12 place count 62 transition count 108
Applied a total of 12 rules in 19 ms. Remains 62 /68 variables (removed 6) and now considering 108/114 (removed 6) transitions.
[2024-05-24 16:57:40] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2024-05-24 16:57:40] [INFO ] Computed 14 invariants in 5 ms
[2024-05-24 16:57:40] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 16:57:40] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2024-05-24 16:57:40] [INFO ] Invariant cache hit.
[2024-05-24 16:57:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 16:57:40] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-24 16:57:40] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-05-24 16:57:40] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2024-05-24 16:57:40] [INFO ] Invariant cache hit.
[2024-05-24 16:57:40] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/96 constraints. Problems are: Problem set: 17 solved, 88 unsolved
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 18/114 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/115 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 1/116 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/117 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/117 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 90/152 variables, 62/179 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 18/197 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 1/198 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/198 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/198 constraints. Problems are: Problem set: 18 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 198 constraints, problems are : Problem set: 18 solved, 87 unsolved in 4383 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 18 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 5/64 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 21/85 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/85 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 3/62 variables, 9/94 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/97 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 21/118 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2024-05-24 16:57:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:57:45] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 16:57:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 4/122 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 5/127 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 3/130 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:57:46] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 5/135 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 2/137 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/137 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 90/152 variables, 62/199 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 18/217 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 87/304 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:48] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/305 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/305 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/152 variables, 1/306 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 1/307 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-05-24 16:57:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 1/308 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 0/308 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 22 (OVERLAPS) 0/152 variables, 0/308 constraints. Problems are: Problem set: 18 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 308 constraints, problems are : Problem set: 18 solved, 87 unsolved in 7661 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 87/105 constraints, Known Traps: 65/65 constraints]
After SMT, in 12074ms problems are : Problem set: 18 solved, 87 unsolved
Search for dead transitions found 18 dead transitions in 12076ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/68 places, 90/114 transitions.
Applied a total of 0 rules in 13 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-24 16:57:53] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 12310 ms. Remains : 62/68 places, 90/114 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-02 finished in 12535 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 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 16:57:53] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-05-24 16:57:53] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 16:57:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-24 16:57:53] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:57:53] [INFO ] Invariant cache hit.
[2024-05-24 16:57:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 16:57:53] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 16:57:53] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:57:53] [INFO ] Invariant cache hit.
[2024-05-24 16:57:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-24 16:57:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/102 constraints. Problems are: Problem set: 9 solved, 102 unsolved
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:57:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/122 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 4/130 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:56] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:57:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:57:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:57:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:57:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 5/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 96/164 variables, 68/203 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 18/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 221 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4433 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 35/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/68 variables, 9/114 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/117 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 18/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:57:58] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/137 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:58] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 96/164 variables, 68/206 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 18/224 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 93/317 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:57:59] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:57:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 2/319 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:58:00] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 7/326 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 1/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 327 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5805 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 10268ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 10270ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10415 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 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 18 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-3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-04 finished in 10871 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' '!(F((G(p0)||(G(p1) U G((p2 U p3))))))'
Support contains 9 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 114/114 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 68 transition count 111
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 111
Applied a total of 6 rules in 8 ms. Remains 65 /68 variables (removed 3) and now considering 111/114 (removed 3) transitions.
[2024-05-24 16:58:04] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 65 cols
[2024-05-24 16:58:04] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 16:58:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-24 16:58:04] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
[2024-05-24 16:58:04] [INFO ] Invariant cache hit.
[2024-05-24 16:58:04] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 16:58:04] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-24 16:58:04] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-24 16:58:04] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
[2024-05-24 16:58:04] [INFO ] Invariant cache hit.
[2024-05-24 16:58:04] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:58:04] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 20/99 constraints. Problems are: Problem set: 10 solved, 98 unsolved
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 3 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:58:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 20/119 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:58:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 15/134 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:07] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:58:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/136 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/136 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 93/158 variables, 65/201 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 18/219 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/219 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/219 constraints. Problems are: Problem set: 18 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 219 constraints, problems are : Problem set: 18 solved, 90 unsolved in 4575 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 18 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 5/67 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 37/104 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/104 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 3/65 variables, 9/113 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 3/116 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 20/136 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:09] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-24 16:58:09] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 3/139 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 2/141 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:09] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 1/142 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 1/143 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:10] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 16:58:10] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:10] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 3/146 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-05-24 16:58:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 1/147 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 0/147 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 14 (OVERLAPS) 93/158 variables, 65/212 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 18/230 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 90/320 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 0/320 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 18 (OVERLAPS) 0/158 variables, 0/320 constraints. Problems are: Problem set: 18 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 320 constraints, problems are : Problem set: 18 solved, 90 unsolved in 4154 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 90/108 constraints, Known Traps: 68/68 constraints]
After SMT, in 8756ms problems are : Problem set: 18 solved, 90 unsolved
Search for dead transitions found 18 dead transitions in 8757ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/68 places, 93/114 transitions.
Applied a total of 0 rules in 13 ms. Remains 65 /65 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2024-05-24 16:58:13] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 8934 ms. Remains : 65/68 places, 93/114 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 1 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-05 finished in 9264 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' '!((F(!p0)&&X(G(p1))))'
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 16:58:13] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-05-24 16:58:13] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 16:58:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-24 16:58:13] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:58:13] [INFO ] Invariant cache hit.
[2024-05-24 16:58:13] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 16:58:13] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 16:58:13] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:58:13] [INFO ] Invariant cache hit.
[2024-05-24 16:58:13] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 16:58:13] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-24 16:58:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:13] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:58:13] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:58:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 3 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/102 constraints. Problems are: Problem set: 9 solved, 102 unsolved
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/122 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-24 16:58:15] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 4/130 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:16] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 5/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 96/164 variables, 68/203 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 18/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 221 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4472 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 35/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/68 variables, 9/114 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/117 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 18/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:18] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:18] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/137 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:18] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 96/164 variables, 68/206 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 18/224 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 93/317 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 2/319 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:58:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 7/326 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:21] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 1/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 327 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5896 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 10392ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 10394ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10541 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-06 finished in 10694 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(X(X(F(p0))))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 16:58:24] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:58:24] [INFO ] Invariant cache hit.
[2024-05-24 16:58:24] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 16:58:24] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:58:24] [INFO ] Invariant cache hit.
[2024-05-24 16:58:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 16:58:24] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 16:58:24] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 16:58:24] [INFO ] Invariant cache hit.
[2024-05-24 16:58:24] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:58:24] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/102 constraints. Problems are: Problem set: 9 solved, 102 unsolved
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:58:25] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/122 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 4/130 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:58:27] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:58:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 5/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 96/164 variables, 68/203 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 18/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 221 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4475 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 35/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/105 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/68 variables, 9/114 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/117 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 18/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:29] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:58:29] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/137 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:29] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 1/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/138 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 96/164 variables, 68/206 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 18/224 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 93/317 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 2/319 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 6 ms to minimize.
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:58:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 7/326 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 16:58:32] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 1/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/327 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 327 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5834 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 10356ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 10359ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10513 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-3-LTLCardinality-14
Product exploration explored 100000 steps with 20000 reset in 113 ms.
Product exploration explored 100000 steps with 20000 reset in 146 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 303 steps (0 resets) in 9 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 16:58:35] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 68 cols
[2024-05-24 16:58:35] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 16:58:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-24 16:58:35] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 16:58:35] [INFO ] Invariant cache hit.
[2024-05-24 16:58:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 16:58:36] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-24 16:58:36] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 16:58:36] [INFO ] Invariant cache hit.
[2024-05-24 16:58:36] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 16:58:36] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:58:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 18/120 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-24 16:58:38] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:58:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 84/152 variables, 68/207 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 15/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/152 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 222 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5363 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 33/103 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/68 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 24/139 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 84/152 variables, 68/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 15/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 93/316 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:43] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2024-05-24 16:58:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-05-24 16:58:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 16:58:43] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/152 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/152 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:58:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 7/331 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 16:58:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:58:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:58:52] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 16:58:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:58:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 16:58:52] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 7/340 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:52] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/152 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/152 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/152 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:58:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/152 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/152 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 28 (OVERLAPS) 0/152 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 343 constraints, problems are : Problem set: 0 solved, 93 unsolved in 17300 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 85/85 constraints]
After SMT, in 22686ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 22689ms
Finished structural reductions in LTL mode , in 1 iterations and 22852 ms. Remains : 68/68 places, 96/96 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 310 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 79 ms.
Product exploration explored 100000 steps with 20000 reset in 82 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 96/96 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 16:59:00] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-24 16:59:00] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 68 cols
[2024-05-24 16:59:00] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 16:59:00] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 20/122 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 20/142 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 4/146 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 4/150 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 2/152 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/68 variables, 5/157 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:59:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:59:05] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/68 variables, 3/160 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 14 (OVERLAPS) 84/152 variables, 68/228 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 15/243 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 17 (OVERLAPS) 0/152 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 243 constraints, problems are : Problem set: 2 solved, 91 unsolved in 6533 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 2 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 5/68 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 45/113 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 5/68 variables, 9/122 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 5/127 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 33/160 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 84/152 variables, 68/228 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 15/243 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 91/334 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 7/341 constraints. Problems are: Problem set: 2 solved, 91 unsolved
[2024-05-24 16:59:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:59:09] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 2/343 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 91 unsolved
At refinement iteration 14 (OVERLAPS) 0/152 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 343 constraints, problems are : Problem set: 2 solved, 91 unsolved in 5220 ms.
Refiners :[Domain max(s): 68/68 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 91/93 constraints, Known Traps: 87/87 constraints]
After SMT, in 11776ms problems are : Problem set: 2 solved, 91 unsolved
Search for dead transitions found 2 dead transitions in 11778ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/68 places, 94/96 transitions.
Graph (complete) has 261 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 66 /68 variables (removed 2) and now considering 94/94 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/68 places, 94/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11810 ms. Remains : 66/68 places, 94/96 transitions.
Built C files in :
/tmp/ltsmin8762597476122970196
[2024-05-24 16:59:12] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8762597476122970196
Running compilation step : cd /tmp/ltsmin8762597476122970196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin8762597476122970196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8762597476122970196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3736750386775082731.hoa' '--buchi-type=spotba'
LTSmin run took 198 ms.
FORMULA LamportFastMutEx-PT-3-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-3-LTLCardinality-14 finished in 48660 ms.
All properties solved by simple procedures.
Total runtime 105428 ms.

BK_STOP 1716569952821

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LamportFastMutEx-PT-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649612400267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-3.tgz
mv LamportFastMutEx-PT-3 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;