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-171649611000258.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-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611000258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 16K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 13 07:33 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 5.9K 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 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 13 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 48K 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-2-CTLFireability-2024-00
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-01
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-02
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-03
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-04
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-05
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-06
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-07
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-08
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-09
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-10
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-11
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-12
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-13
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-14
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716531865010

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 06:24:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 06:24:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 06:24:26] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-24 06:24:26] [INFO ] Transformed 69 places.
[2024-05-24 06:24:26] [INFO ] Transformed 96 transitions.
[2024-05-24 06:24:26] [INFO ] Found NUPN structural information;
[2024-05-24 06:24:26] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, 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_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2024-05-24 06:24:26] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-24 06:24:26] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 06:24:26] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 06:24:26] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-24 06:24:26] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 06:24:26] [INFO ] Invariant cache hit.
[2024-05-24 06:24:26] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 06:24:26] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-24 06:24:26] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 06:24:26] [INFO ] Invariant cache hit.
[2024-05-24 06:24:26] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 06:24:26] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-24 06:24:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 6 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 20/74 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 06:24:27] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/79 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/79 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 56/100 variables, 44/123 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 16/139 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 139 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1534 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 4/46 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 15/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 2/44 variables, 6/67 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/69 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 10/79 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 06:24:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/80 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/80 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 56/100 variables, 44/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 16/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 48/188 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/188 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/188 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 188 constraints, problems are : Problem set: 12 solved, 48 unsolved in 860 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 26/26 constraints]
After SMT, in 2441ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 2454ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/44 places, 50/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2735 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 44 out of 44 places after structural reductions.
[2024-05-24 06:24:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 06:24:29] [INFO ] Flatten gal took : 22 ms
[2024-05-24 06:24:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:24:29] [INFO ] Flatten gal took : 11 ms
[2024-05-24 06:24:29] [INFO ] Input system was already deterministic with 50 transitions.
Reduction of identical properties reduced properties to check from 45 to 40
RANDOM walk for 40000 steps (8 resets) in 2423 ms. (16 steps per ms) remains 6/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
[2024-05-24 06:24:30] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 06:24:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 06:24:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/44 variables, 7/36 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 18/54 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 3 ms to minimize.
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Problem AtomicPropp33 is UNSAT
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
Problem AtomicPropp32 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 6/60 constraints. Problems are: Problem set: 4 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/60 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 48/92 variables, 44/104 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 14/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 118 constraints, problems are : Problem set: 4 solved, 2 unsolved in 248 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/11 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 16/27 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 1/28 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/50 variables, 22/50 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 6/56 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 1/57 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/66 variables, 7/64 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 7/71 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/72 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 4/76 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 2/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 06:24:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/66 variables, 2/80 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/66 variables, 0/80 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 13/79 variables, 3/83 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/79 variables, 13/96 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/79 variables, 4/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/79 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 13/92 variables, 15/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/92 variables, 2/117 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/92 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/92 variables, 4/122 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/92 variables, 1/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/92 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/92 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 123 constraints, problems are : Problem set: 4 solved, 2 unsolved in 203 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 461ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 6 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 50/50 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 42 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 42 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 40 transition count 46
Applied a total of 8 rules in 15 ms. Remains 40 /44 variables (removed 4) and now considering 46/50 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 40/44 places, 46/50 transitions.
RANDOM walk for 40000 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Probably explored full state space saw : 324 states, properties seen :0
Probabilistic random walk after 932 steps, saw 324 distinct states, run finished after 17 ms. (steps per millisecond=54 ) properties seen :0
Explored full state space saw : 324 states, properties seen :0
Exhaustive walk after 932 steps, saw 324 distinct states, run finished after 6 ms. (steps per millisecond=155 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:24:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 9 ms
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 10 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 50/50 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 42 transition count 48
Applied a total of 4 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/44 places, 48/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 63 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 2 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 06:24:31] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:24:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 06:24:31] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-24 06:24:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 50 transitions and 208 arcs took 3 ms.
Total runtime 5357 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-PT-2

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/409/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: 646
MODEL NAME: /home/mcc/execution/409/model
44 places, 50 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-2-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-PT-2-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716531872249

--------------------
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 CTLFireability -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-2"
export BK_EXAMINATION="CTLFireability"
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-2, examination is CTLFireability"
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-171649611000258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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