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

About the Execution of GreatSPN+red for CSRepetitions-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3097.212 285675.00 458158.00 640.30 FFTTFTTTFTFTFFTF 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-171620504100233.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 CSRepetitions-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504100233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 26K Apr 12 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 12 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 12 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 181K Apr 12 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 40K 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 CSRepetitions-PT-03-CTLCardinality-2024-00
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-01
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-02
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-03
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-04
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-05
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-06
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-07
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-08
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-09
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-10
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-11
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-12
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-13
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-14
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716418149132

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:49:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 22:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:49:10] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 22:49:10] [INFO ] Transformed 58 places.
[2024-05-22 22:49:10] [INFO ] Transformed 81 transitions.
[2024-05-22 22:49:10] [INFO ] Parsed PT model containing 58 places and 81 transitions and 279 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Support contains 58 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2024-05-22 22:49:10] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 22:49:10] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 22:49:10] [INFO ] Invariant cache hit.
[2024-05-22 22:49:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 22:49:10] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-22 22:49:10] [INFO ] Invariant cache hit.
[2024-05-22 22:49:10] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 9/58 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 81/139 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 79 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 9/58 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 81/139 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 72/151 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 151 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2366ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2383ms
Finished structural reductions in LTL mode , in 1 iterations and 2669 ms. Remains : 58/58 places, 81/81 transitions.
Support contains 58 out of 58 places after structural reductions.
[2024-05-22 22:49:13] [INFO ] Flatten gal took : 29 ms
[2024-05-22 22:49:13] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:49:13] [INFO ] Input system was already deterministic with 81 transitions.
RANDOM walk for 40000 steps (1320 resets) in 2532 ms. (15 steps per ms) remains 43/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (24 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (15 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (11 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
[2024-05-22 22:49:14] [INFO ] Invariant cache hit.
[2024-05-22 22:49:14] [INFO ] State equation strengthened by 9 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 12/12 constraints. Problems are: Problem set: 34 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 34 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 139/139 variables, and 70 constraints, problems are : Problem set: 43 solved, 0 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 43 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 43 atomic propositions for a total of 16 simplifications.
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:49:14] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:49:14] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Support contains 32 out of 58 places (down from 58) after GAL structural reductions.
Computed a total of 0 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 58/58 places, 81/81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:49:14] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 22:49:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 81 transitions and 279 arcs took 2 ms.
Total runtime 4646 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CSRepetitions-PT-03

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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/413/model
58 places, 81 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 CSRepetitions-PT-03-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CSRepetitions-PT-03-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716418434807

--------------------
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 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="CSRepetitions-PT-03"
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 CSRepetitions-PT-03, 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 r069-tall-171620504100233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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