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.r399-tall-171690531200841.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 Szymanski-PT-a10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531200841
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 11 15:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K May 18 16:43 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 Szymanski-PT-a10-CTLCardinality-2024-00
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-01
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-02
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-03
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-04
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-05
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-06
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-07
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-08
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-09
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-10
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2024-11
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2023-12
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2023-13
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2023-14
FORMULA_NAME Szymanski-PT-a10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717093397046

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 18:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 18:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:23:18] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-30 18:23:18] [INFO ] Transformed 61 places.
[2024-05-30 18:23:18] [INFO ] Transformed 224 transitions.
[2024-05-30 18:23:18] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a10-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 49 /49 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 18:23:18] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-30 18:23:18] [INFO ] Computed 3 invariants in 10 ms
[2024-05-30 18:23:18] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-30 18:23:18] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:23:18] [INFO ] Invariant cache hit.
[2024-05-30 18:23:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 18:23:18] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-30 18:23:18] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:23:18] [INFO ] Invariant cache hit.
[2024-05-30 18:23:18] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-30 18:23:19] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 8 ms to minimize.
[2024-05-30 18:23:20] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 63 constraints, problems are : Problem set: 0 solved, 214 unsolved in 4663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 214/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 277 constraints, problems are : Problem set: 0 solved, 214 unsolved in 3832 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints]
After SMT, in 8626ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 8655ms
Finished structural reductions in LTL mode , in 1 iterations and 8957 ms. Remains : 49/49 places, 216/216 transitions.
Support contains 44 out of 49 places after structural reductions.
[2024-05-30 18:23:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 18:23:27] [INFO ] Flatten gal took : 55 ms
FORMULA Szymanski-PT-a10-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:23:27] [INFO ] Flatten gal took : 17 ms
[2024-05-30 18:23:27] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 42 out of 49 places (down from 44) after GAL structural reductions.
RANDOM walk for 40003 steps (53 resets) in 868 ms. (46 steps per ms) remains 9/54 properties
BEST_FIRST walk for 40004 steps (14 resets) in 141 ms. (281 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (19 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 211 ms. (188 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (18 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
[2024-05-30 18:23:28] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:23:28] [INFO ] Invariant cache hit.
[2024-05-30 18:23:28] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/49 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 79/128 variables, 49/52 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 9/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 61 constraints, problems are : Problem set: 6 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-30 18:23:28] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/48 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/49 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/128 variables, 49/53 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 9/62 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/63 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-30 18:23:29] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 1/64 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/128 variables, 0/64 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 64 constraints, problems are : Problem set: 6 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 503ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 47 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 42 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 42 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 42 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 41 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 41 transition count 172
Applied a total of 33 rules in 52 ms. Remains 41 /49 variables (removed 8) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 41/49 places, 172/216 transitions.
RANDOM walk for 15043 steps (3 resets) in 16 ms. (884 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 11 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 17 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 39 out of 49 places (down from 41) after GAL structural reductions.
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 44 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 44 transition count 200
Applied a total of 9 rules in 4 ms. Remains 44 /49 variables (removed 5) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 44/49 places, 200/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 43 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 43 transition count 200
Applied a total of 10 rules in 3 ms. Remains 43 /49 variables (removed 6) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/49 places, 200/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 44 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 44 transition count 200
Applied a total of 9 rules in 3 ms. Remains 44 /49 variables (removed 5) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/49 places, 200/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 10 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 45 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 45 transition count 208
Applied a total of 6 rules in 3 ms. Remains 45 /49 variables (removed 4) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/49 places, 208/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 20 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 45 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 45 transition count 208
Applied a total of 6 rules in 3 ms. Remains 45 /49 variables (removed 4) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/49 places, 208/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 23 place count 42 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 41 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 41 transition count 180
Applied a total of 25 rules in 29 ms. Remains 41 /49 variables (removed 8) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 41/49 places, 180/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 14 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 27 place count 42 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 41 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 41 transition count 176
Applied a total of 29 rules in 14 ms. Remains 41 /49 variables (removed 8) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 41/49 places, 176/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 41 transition count 176
Applied a total of 29 rules in 13 ms. Remains 41 /49 variables (removed 8) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 41/49 places, 176/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 3 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/49 places, 196/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 44 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 44 transition count 204
Applied a total of 8 rules in 2 ms. Remains 44 /49 variables (removed 5) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/49 places, 204/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 43 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 43 transition count 200
Applied a total of 10 rules in 2 ms. Remains 43 /49 variables (removed 6) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/49 places, 200/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 42 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 42 transition count 196
Applied a total of 12 rules in 2 ms. Remains 42 /49 variables (removed 7) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/49 places, 196/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 44 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 19 place count 44 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 42 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 42 transition count 184
Applied a total of 23 rules in 13 ms. Remains 42 /49 variables (removed 7) and now considering 184/216 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 42/49 places, 184/216 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 5 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 18:23:29] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 7 ms
[2024-05-30 18:23:29] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:23:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-30 18:23:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 216 transitions and 868 arcs took 2 ms.
Total runtime 11561 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-a10

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: 49
TRANSITIONS: 216
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, 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: 557
MODEL NAME: /home/mcc/execution/411/model
49 places, 216 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 Szymanski-PT-a10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717093927429

--------------------
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="Szymanski-PT-a10"
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 Szymanski-PT-a10, 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 r399-tall-171690531200841"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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