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.r135-tall-171631131400585.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 DoubleLock-PT-p1s1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 93K 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 DoubleLock-PT-p1s1-CTLCardinality-2024-00
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-01
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-02
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-03
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-04
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-05
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-06
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-07
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-08
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-09
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-10
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2024-11
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2023-12
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2023-13
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2023-14
FORMULA_NAME DoubleLock-PT-p1s1-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716390666170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 15:11:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 15:11:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:11:07] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-22 15:11:07] [INFO ] Transformed 64 places.
[2024-05-22 15:11:07] [INFO ] Transformed 204 transitions.
[2024-05-22 15:11:07] [INFO ] Parsed PT model containing 64 places and 204 transitions and 828 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
Support contains 44 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 196/196 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 196
Applied a total of 1 rules in 16 ms. Remains 55 /56 variables (removed 1) and now considering 196/196 (removed 0) transitions.
[2024-05-22 15:11:07] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
// Phase 1: matrix 148 rows 55 cols
[2024-05-22 15:11:07] [INFO ] Computed 3 invariants in 13 ms
[2024-05-22 15:11:07] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 15:11:07] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
[2024-05-22 15:11:07] [INFO ] Invariant cache hit.
[2024-05-22 15:11:07] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-22 15:11:07] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-22 15:11:07] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
[2024-05-22 15:11:07] [INFO ] Invariant cache hit.
[2024-05-22 15:11:07] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 148/201 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 23/79 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 2/203 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 81 constraints, problems are : Problem set: 0 solved, 194 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 148/201 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 23/79 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 2/203 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 182/275 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 275 constraints, problems are : Problem set: 0 solved, 194 unsolved in 6720 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints]
After SMT, in 11323ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 11342ms
Starting structural reductions in LTL mode, iteration 1 : 55/56 places, 196/196 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11690 ms. Remains : 55/56 places, 196/196 transitions.
Support contains 44 out of 55 places after structural reductions.
[2024-05-22 15:11:19] [INFO ] Flatten gal took : 37 ms
[2024-05-22 15:11:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleLock-PT-p1s1-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:11:19] [INFO ] Flatten gal took : 16 ms
[2024-05-22 15:11:19] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 39 out of 55 places (down from 44) after GAL structural reductions.
RANDOM walk for 40002 steps (298 resets) in 2593 ms. (15 steps per ms) remains 25/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (9 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
[2024-05-22 15:11:20] [INFO ] Flow matrix only has 148 transitions (discarded 48 similar events)
[2024-05-22 15:11:20] [INFO ] Invariant cache hit.
[2024-05-22 15:11:20] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 18/44 variables, 3/3 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 143/187 variables, 44/47 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 22/69 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/69 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 16/203 variables, 11/80 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/81 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/81 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/81 constraints. Problems are: Problem set: 21 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 81 constraints, problems are : Problem set: 21 solved, 4 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 28/33 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 137/170 variables, 33/35 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 12/47 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/48 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/203 variables, 22/70 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/71 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 11/82 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 3/85 constraints. Problems are: Problem set: 21 solved, 4 unsolved
[2024-05-22 15:11:20] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 1/86 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/86 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/86 constraints. Problems are: Problem set: 21 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 86 constraints, problems are : Problem set: 21 solved, 4 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 4/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 422ms problems are : Problem set: 21 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 586 ms.
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 196/196 transitions.
Graph (complete) has 352 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 52 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 51 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 51 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 50 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 50 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 49 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 49 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 48 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 48 transition count 172
Applied a total of 13 rules in 25 ms. Remains 48 /55 variables (removed 7) and now considering 172/196 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 48/55 places, 172/196 transitions.
RANDOM walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 10110 steps (0 resets) in 35 ms. (280 steps per ms) remains 0/2 properties
Successfully simplified 21 atomic propositions for a total of 15 simplifications.
FORMULA DoubleLock-PT-p1s1-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s1-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 11 ms
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 12 ms
[2024-05-22 15:11:21] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 29 out of 55 places (down from 30) after GAL structural reductions.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 44 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 44 transition count 156
Applied a total of 17 rules in 23 ms. Remains 44 /55 variables (removed 11) and now considering 156/196 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 44/55 places, 156/196 transitions.
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:11:21] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 188
Applied a total of 7 rules in 4 ms. Remains 50 /55 variables (removed 5) and now considering 188/196 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/55 places, 188/196 transitions.
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:11:21] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 45 transition count 160
Applied a total of 15 rules in 19 ms. Remains 45 /55 variables (removed 10) and now considering 160/196 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 45/55 places, 160/196 transitions.
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:11:21] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 48 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 47 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 46 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 45 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 45 transition count 160
Applied a total of 17 rules in 9 ms. Remains 45 /55 variables (removed 10) and now considering 160/196 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 45/55 places, 160/196 transitions.
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:21] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Graph (complete) has 419 edges and 55 vertex of which 53 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 53 /55 variables (removed 2) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 53/55 places, 196/196 transitions.
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:11:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Applied a total of 3 rules in 1 ms. Remains 52 /55 variables (removed 3) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/55 places, 196/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 17 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 188
Applied a total of 7 rules in 3 ms. Remains 50 /55 variables (removed 5) and now considering 188/196 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/55 places, 188/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 196
Applied a total of 2 rules in 1 ms. Remains 53 /55 variables (removed 2) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 53/55 places, 196/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 48 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 47 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 46 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 45 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 44 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 44 transition count 156
Applied a total of 19 rules in 5 ms. Remains 44 /55 variables (removed 11) and now considering 156/196 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 44/55 places, 156/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Graph (complete) has 419 edges and 55 vertex of which 52 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 51 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 50 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 49 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 48 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 47 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 46 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 45 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 45 transition count 160
Applied a total of 15 rules in 28 ms. Remains 45 /55 variables (removed 10) and now considering 160/196 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 45/55 places, 160/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 196
Applied a total of 2 rules in 1 ms. Remains 53 /55 variables (removed 2) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 53/55 places, 196/196 transitions.
[2024-05-22 15:11:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
FORMULA DoubleLock-PT-p1s1-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 196 transitions.
Support contains 0 out of 53 places (down from 3) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 48 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 47 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 46 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 45 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 44 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 44 transition count 156
Applied a total of 19 rules in 5 ms. Remains 44 /55 variables (removed 11) and now considering 156/196 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 44/55 places, 156/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 196/196 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 52 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 51 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 50 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 184
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 48 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 47 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 47 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 46 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 46 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 45 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 45 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 44 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 44 transition count 156
Applied a total of 19 rules in 5 ms. Remains 44 /55 variables (removed 11) and now considering 156/196 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 44/55 places, 156/196 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 15:11:22] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:11:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 15:11:22] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 15:11:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 196 transitions and 792 arcs took 3 ms.
Total runtime 15001 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleLock-PT-p1s1

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 551
MODEL NAME: /home/mcc/execution/411/model
55 places, 196 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 15 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716390683087

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DoubleLock-PT-p1s1"
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 DoubleLock-PT-p1s1, 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 r135-tall-171631131400585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s1.tgz
mv DoubleLock-PT-p1s1 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 ;