fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620503600002
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CANConstruction-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1051.235 31836.00 98568.00 146.00 FTTFTFTTTFFFTFFT normal

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.r069-tall-171620503600002.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 CANConstruction-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503600002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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 167K 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 CANConstruction-PT-005-CTLFireability-2024-00
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-01
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-02
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-03
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-04
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-05
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-06
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-07
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-08
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-09
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-10
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2024-11
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2023-12
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2023-13
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2023-14
FORMULA_NAME CANConstruction-PT-005-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716361399210

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:03:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:03:20] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-22 07:03:20] [INFO ] Transformed 112 places.
[2024-05-22 07:03:20] [INFO ] Transformed 140 transitions.
[2024-05-22 07:03:20] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 72 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Applied a total of 0 rules in 23 ms. Remains 112 /112 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 112 cols
[2024-05-22 07:03:20] [INFO ] Computed 11 invariants in 16 ms
[2024-05-22 07:03:20] [INFO ] Implicit Places using invariants in 201 ms returned [40, 54]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 235 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 140/140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 139
Applied a total of 2 rules in 10 ms. Remains 109 /110 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 109 cols
[2024-05-22 07:03:20] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 07:03:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 07:03:21] [INFO ] Invariant cache hit.
[2024-05-22 07:03:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 07:03:21] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/112 places, 139/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 453 ms. Remains : 109/112 places, 139/140 transitions.
Support contains 72 out of 109 places after structural reductions.
[2024-05-22 07:03:21] [INFO ] Flatten gal took : 30 ms
[2024-05-22 07:03:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:03:21] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 40000 steps (516 resets) in 1266 ms. (31 steps per ms) remains 5/66 properties
BEST_FIRST walk for 40003 steps (122 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (134 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (130 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (132 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (128 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
[2024-05-22 07:03:22] [INFO ] Invariant cache hit.
[2024-05-22 07:03:22] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/105 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/108 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/247 variables, 108/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 45/162 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 163 constraints, problems are : Problem set: 3 solved, 2 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/108 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/247 variables, 108/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 45/162 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 2/164 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/248 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 165 constraints, problems are : Problem set: 3 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 525ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 139/139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 109 transition count 111
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 81 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 79 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 79 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 77 transition count 107
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 80 place count 61 transition count 76
Iterating global reduction 3 with 16 rules applied. Total rules applied 96 place count 61 transition count 76
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 61 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 59 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 106 place count 56 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 116 place count 51 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 51 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 50 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 120 place count 50 transition count 80
Applied a total of 120 rules in 46 ms. Remains 50 /109 variables (removed 59) and now considering 80/139 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 50/109 places, 80/139 transitions.
RANDOM walk for 40000 steps (1383 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (275 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (275 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Probably explored full state space saw : 4423 states, properties seen :0
Probabilistic random walk after 24818 steps, saw 4423 distinct states, run finished after 82 ms. (steps per millisecond=302 ) properties seen :0
Explored full state space saw : 4423 states, properties seen :0
Exhaustive walk after 24818 steps, saw 4423 distinct states, run finished after 58 ms. (steps per millisecond=427 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 67 out of 109 places (down from 68) after GAL structural reductions.
Computed a total of 20 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 110
Applied a total of 30 rules in 5 ms. Remains 94 /109 variables (removed 15) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 94/109 places, 110/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 95 transition count 111
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 95 transition count 111
Applied a total of 28 rules in 13 ms. Remains 95 /109 variables (removed 14) and now considering 111/139 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 95/109 places, 111/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 118
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 118
Applied a total of 22 rules in 6 ms. Remains 98 /109 variables (removed 11) and now considering 118/139 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 98/109 places, 118/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 93 transition count 108
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 93 transition count 108
Applied a total of 32 rules in 4 ms. Remains 93 /109 variables (removed 16) and now considering 108/139 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 93/109 places, 108/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 93 transition count 108
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 93 transition count 108
Applied a total of 32 rules in 3 ms. Remains 93 /109 variables (removed 16) and now considering 108/139 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 93/109 places, 108/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 116
Applied a total of 24 rules in 3 ms. Remains 97 /109 variables (removed 12) and now considering 116/139 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/109 places, 116/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 110
Applied a total of 30 rules in 12 ms. Remains 94 /109 variables (removed 15) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 94/109 places, 110/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 110
Applied a total of 30 rules in 2 ms. Remains 94 /109 variables (removed 15) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 94/109 places, 110/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 110
Applied a total of 30 rules in 2 ms. Remains 94 /109 variables (removed 15) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/109 places, 110/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 116
Applied a total of 24 rules in 2 ms. Remains 97 /109 variables (removed 12) and now considering 116/139 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/109 places, 116/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 114
Applied a total of 26 rules in 2 ms. Remains 96 /109 variables (removed 13) and now considering 114/139 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 96/109 places, 114/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 95 transition count 112
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 95 transition count 112
Applied a total of 28 rules in 2 ms. Remains 95 /109 variables (removed 14) and now considering 112/139 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 95/109 places, 112/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 116
Applied a total of 24 rules in 2 ms. Remains 97 /109 variables (removed 12) and now considering 116/139 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/109 places, 116/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 93 transition count 108
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 93 transition count 108
Applied a total of 32 rules in 3 ms. Remains 93 /109 variables (removed 16) and now considering 108/139 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 93/109 places, 108/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 110
Applied a total of 30 rules in 3 ms. Remains 94 /109 variables (removed 15) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/109 places, 110/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 110
Applied a total of 30 rules in 2 ms. Remains 94 /109 variables (removed 15) and now considering 110/139 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 94/109 places, 110/139 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 11 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:03:23] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-22 07:03:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 139 transitions and 391 arcs took 4 ms.
Total runtime 3244 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-005

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/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: 538
MODEL NAME: /home/mcc/execution/415/model
109 places, 139 transitions.

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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CANConstruction-PT-005-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CANConstruction-PT-005-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716361431046

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r069-tall-171620503600002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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