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.r179-tall-171640601800578.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 GPUForwardProgress-PT-32a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601800578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K 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 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 11 23:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K 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 GPUForwardProgress-PT-32a-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-32a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716481041119

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 16:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:17:22] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-23 16:17:22] [INFO ] Transformed 136 places.
[2024-05-23 16:17:22] [INFO ] Transformed 169 transitions.
[2024-05-23 16:17:22] [INFO ] Found NUPN structural information;
[2024-05-23 16:17:22] [INFO ] Parsed PT model containing 136 places and 169 transitions and 661 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 135/135 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 135
Applied a total of 1 rules in 19 ms. Remains 135 /136 variables (removed 1) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 135 cols
[2024-05-23 16:17:22] [INFO ] Computed 33 invariants in 14 ms
[2024-05-23 16:17:22] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-23 16:17:22] [INFO ] Invariant cache hit.
[2024-05-23 16:17:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 16:17:23] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-23 16:17:23] [INFO ] Invariant cache hit.
[2024-05-23 16:17:23] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 336 constraints, problems are : Problem set: 0 solved, 134 unsolved in 10616 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 134/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 470 constraints, problems are : Problem set: 0 solved, 134 unsolved in 12228 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 23029ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 23047ms
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 135/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23565 ms. Remains : 135/136 places, 135/135 transitions.
Support contains 61 out of 135 places after structural reductions.
[2024-05-23 16:17:46] [INFO ] Flatten gal took : 39 ms
[2024-05-23 16:17:46] [INFO ] Flatten gal took : 18 ms
[2024-05-23 16:17:46] [INFO ] Input system was already deterministic with 135 transitions.
Reduction of identical properties reduced properties to check from 68 to 67
RANDOM walk for 40000 steps (77 resets) in 1989 ms. (20 steps per ms) remains 3/67 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-23 16:17:47] [INFO ] Invariant cache hit.
[2024-05-23 16:17:47] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 127/134 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 127/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/269 variables, 1/334 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/335 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/270 variables, 1/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/270 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 336 constraints, problems are : Problem set: 1 solved, 1 unsolved in 211 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 129/134 variables, 33/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 129/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/334 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/334 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/335 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/270 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 337 constraints, problems are : Problem set: 1 solved, 1 unsolved in 178 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 10 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 11 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 135 transitions.
Support contains 60 out of 135 places (down from 61) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 9 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 9 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 31 Pre rules applied. Total rules applied 1 place count 101 transition count 102
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 70 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 65 place count 69 transition count 101
Applied a total of 65 rules in 27 ms. Remains 69 /135 variables (removed 66) and now considering 101/135 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 69/135 places, 101/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 9 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 102 transition count 105
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 73 transition count 105
Applied a total of 59 rules in 11 ms. Remains 73 /135 variables (removed 62) and now considering 105/135 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 73/135 places, 105/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 102 transition count 115
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 83 transition count 115
Applied a total of 39 rules in 10 ms. Remains 83 /135 variables (removed 52) and now considering 115/135 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 83/135 places, 115/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 7 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 16:17:47] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 26 Pre rules applied. Total rules applied 1 place count 102 transition count 108
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 53 place count 76 transition count 108
Applied a total of 53 rules in 9 ms. Remains 76 /135 variables (removed 59) and now considering 108/135 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 76/135 places, 108/135 transitions.
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 16 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 135/135 places, 135/135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 16:17:48] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 16:17:48] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-23 16:17:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 135 transitions and 591 arcs took 2 ms.
Total runtime 25951 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running GPUForwardProgress-PT-32a

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: 135
TRANSITIONS: 135
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.003s]


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: 553
MODEL NAME: /home/mcc/execution/412/model
135 places, 135 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 GPUForwardProgress-PT-32a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-32a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716481146625

--------------------
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 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="GPUForwardProgress-PT-32a"
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 GPUForwardProgress-PT-32a, 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 r179-tall-171640601800578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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