Execution Chart

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

Trace from the execution

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

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-PT-3-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716532004988

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 06:26:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 06:26:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:26:46] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-24 06:26:46] [INFO ] Transformed 100 places.
[2024-05-24 06:26:46] [INFO ] Transformed 156 transitions.
[2024-05-24 06:26:46] [INFO ] Found NUPN structural information;
[2024-05-24 06:26:46] [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 06:26:46] [INFO ] Parsed PT model containing 100 places and 156 transitions and 664 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 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 7 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 06:26:46] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-05-24 06:26:46] [INFO ] Computed 17 invariants in 9 ms
[2024-05-24 06:26:46] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-24 06:26:46] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 06:26:46] [INFO ] Invariant cache hit.
[2024-05-24 06:26:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 06:26:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 06:26:46] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 06:26:46] [INFO ] Invariant cache hit.
[2024-05-24 06:26:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 12 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/108 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 06:26:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 5 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/128 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:26:48] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 16/144 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/145 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/146 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/147 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/147 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 96/167 variables, 71/218 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 27/245 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/245 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/245 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 245 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5740 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 5/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 38/111 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/111 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 3/71 variables, 12/123 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 3/126 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 21/147 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:53] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/148 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:53] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 06:26:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 2/150 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/150 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 96/167 variables, 71/221 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 27/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 93/341 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/342 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:55] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-24 06:26:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-24 06:26:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 3/345 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 1/346 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 3/349 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 06:26:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 06:26:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 3/352 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 1/353 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:26:59] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 1/354 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:27:01] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 1/355 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 06:27:02] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-24 06:27:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 06:27:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 3/358 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/167 variables, 0/358 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 23 (OVERLAPS) 0/167 variables, 0/358 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 358 constraints, problems are : Problem set: 18 solved, 93 unsolved in 12406 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 79/79 constraints]
After SMT, in 18218ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 18233ms
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 : 71/71 places, 96/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18589 ms. Remains : 71/71 places, 96/114 transitions.
Support contains 58 out of 71 places after structural reductions.
[2024-05-24 06:27:05] [INFO ] Flatten gal took : 26 ms
[2024-05-24 06:27:05] [INFO ] Flatten gal took : 10 ms
[2024-05-24 06:27:05] [INFO ] Input system was already deterministic with 96 transitions.
Reduction of identical properties reduced properties to check from 50 to 49
RANDOM walk for 40000 steps (8 resets) in 1566 ms. (25 steps per ms) remains 31/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 31/31 properties
[2024-05-24 06:27:06] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 06:27:06] [INFO ] Computed 17 invariants in 3 ms
[2024-05-24 06:27:06] [INFO ] State equation strengthened by 24 read => feed constraints.
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 12/69 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 30 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 84/141 variables, 57/126 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 24/150 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/150 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/155 variables, 14/164 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 14/178 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 5/183 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/183 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/183 constraints. Problems are: Problem set: 30 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 183 constraints, problems are : Problem set: 30 solved, 1 unsolved in 84 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 54/57 variables, 12/15 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 54/69 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/69 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/141 variables, 57/126 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 24/150 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/150 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/155 variables, 14/164 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 14/178 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 5/183 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/184 constraints. Problems are: Problem set: 30 solved, 1 unsolved
[2024-05-24 06:27:06] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/185 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 0/185 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/155 variables, 0/185 constraints. Problems are: Problem set: 30 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 185 constraints, problems are : Problem set: 30 solved, 1 unsolved in 138 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/31 constraints, Known Traps: 1/1 constraints]
After SMT, in 246ms problems are : Problem set: 30 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 96/96 transitions.
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 6 place count 68 transition count 93
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 90
Applied a total of 12 rules in 19 ms. Remains 65 /71 variables (removed 6) and now considering 90/96 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 65/71 places, 90/96 transitions.
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Probably explored full state space saw : 15512 states, properties seen :0
Probabilistic random walk after 61100 steps, saw 15512 distinct states, run finished after 157 ms. (steps per millisecond=389 ) properties seen :0
Explored full state space saw : 15512 states, properties seen :0
Exhaustive walk after 61100 steps, saw 15512 distinct states, run finished after 71 ms. (steps per millisecond=860 ) properties seen :0
Successfully simplified 31 atomic propositions for a total of 12 simplifications.
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 7 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 32 out of 71 places (down from 33) after GAL structural reductions.
Computed a total of 1 stabilizing places and 3 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 96/96 transitions.
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 6 place count 68 transition count 93
Applied a total of 6 rules in 6 ms. Remains 68 /71 variables (removed 3) and now considering 93/96 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 68/71 places, 93/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 94
Applied a total of 4 rules in 7 ms. Remains 69 /71 variables (removed 2) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 69/71 places, 94/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:27:06] [INFO ] Flatten gal took : 5 ms
[2024-05-24 06:27:06] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-24 06:27:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 96 transitions and 408 arcs took 2 ms.
Total runtime 20864 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-3

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 791
MODEL NAME: /home/mcc/execution/412/model
71 places, 96 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-3-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716532028729

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LamportFastMutEx-PT-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611100265"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;