Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631130400113.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 Dekker-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130400113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 5.9M 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 Dekker-PT-100-CTLCardinality-2024-00
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-01
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-02
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-03
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-04
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-05
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-06
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-07
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-08
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-09
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-10
FORMULA_NAME Dekker-PT-100-CTLCardinality-2024-11
FORMULA_NAME Dekker-PT-100-CTLCardinality-2023-12
FORMULA_NAME Dekker-PT-100-CTLCardinality-2023-13
FORMULA_NAME Dekker-PT-100-CTLCardinality-2023-14
FORMULA_NAME Dekker-PT-100-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334221233

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 23:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:30:22] [INFO ] Load time of PNML (sax parser for PT used): 463 ms
[2024-05-21 23:30:22] [INFO ] Transformed 500 places.
[2024-05-21 23:30:23] [INFO ] Transformed 10200 transitions.
[2024-05-21 23:30:23] [INFO ] Found NUPN structural information;
[2024-05-21 23:30:23] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 630 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA Dekker-PT-100-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 119 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 295 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2024-05-21 23:30:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2024-05-21 23:30:23] [INFO ] Computed 300 invariants in 33 ms
[2024-05-21 23:30:30] [INFO ] Implicit Places using invariants in 6550 ms returned [200, 203, 209, 215, 218, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 269, 272, 275, 284, 287, 293, 296, 302, 305, 308, 311, 314, 320, 323, 326, 329, 332, 335, 338, 341, 347, 350, 353, 356, 362, 365, 368, 374, 377, 380, 383, 389, 392, 395, 398, 404, 407, 416, 422, 425, 431, 437, 440, 443, 449, 452, 455, 464, 467, 473, 476, 482, 488, 491, 494, 497]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 6592 ms to find 75 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 425/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 171 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7078 ms. Remains : 425/500 places, 10200/10200 transitions.
Support contains 119 out of 425 places after structural reductions.
[2024-05-21 23:30:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:30:31] [INFO ] Flatten gal took : 688 ms
FORMULA Dekker-PT-100-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:30:31] [INFO ] Flatten gal took : 453 ms
[2024-05-21 23:30:32] [INFO ] Input system was already deterministic with 10200 transitions.
Support contains 110 out of 425 places (down from 119) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2904 ms. (13 steps per ms) remains 8/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
[2024-05-21 23:30:33] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 425 cols
[2024-05-21 23:30:34] [INFO ] Computed 225 invariants in 4 ms
[2024-05-21 23:30:34] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 20/29 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/36 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 3/39 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/39 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 36/75 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/75 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 182/257 variables, 100/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 477/734 variables, 295/522 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/734 variables, 295/817 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/734 variables, 69/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 91/825 variables, 113/999 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 91/1090 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/825 variables, 22/1112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/825 variables, 91/1203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/825 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/825 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 1203 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3299 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 425/425 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 20/29 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 7/36 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 3/39 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 36/75 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/75 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 182/257 variables, 100/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 477/734 variables, 295/522 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/734 variables, 295/817 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/734 variables, 69/886 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/734 variables, 8/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 91/825 variables, 113/1007 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 91/1098 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/825 variables, 22/1120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/825 variables, 91/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/825 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/825 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 1211 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1833 ms.
Refiners :[Domain max(s): 425/425 constraints, Positive P Invariants (semi-flows): 200/200 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 425/425 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 28/28 constraints]
After SMT, in 5276ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 1534 steps, including 81 resets, run visited all 8 properties in 108 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 136 ms.
[2024-05-21 23:30:39] [INFO ] Flatten gal took : 383 ms
[2024-05-21 23:30:40] [INFO ] Flatten gal took : 418 ms
[2024-05-21 23:30:40] [INFO ] Input system was already deterministic with 10200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 120 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:41] [INFO ] Flatten gal took : 337 ms
[2024-05-21 23:30:42] [INFO ] Flatten gal took : 386 ms
[2024-05-21 23:30:42] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 135 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:43] [INFO ] Flatten gal took : 359 ms
[2024-05-21 23:30:43] [INFO ] Flatten gal took : 386 ms
[2024-05-21 23:30:44] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 88 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:44] [INFO ] Flatten gal took : 371 ms
[2024-05-21 23:30:45] [INFO ] Flatten gal took : 425 ms
[2024-05-21 23:30:46] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 91 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:46] [INFO ] Flatten gal took : 344 ms
[2024-05-21 23:30:46] [INFO ] Flatten gal took : 407 ms
[2024-05-21 23:30:47] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 814 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 814 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:48] [INFO ] Flatten gal took : 372 ms
[2024-05-21 23:30:49] [INFO ] Flatten gal took : 411 ms
[2024-05-21 23:30:49] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 591 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 591 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:50] [INFO ] Flatten gal took : 337 ms
[2024-05-21 23:30:51] [INFO ] Flatten gal took : 370 ms
[2024-05-21 23:30:51] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 82 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:52] [INFO ] Flatten gal took : 322 ms
[2024-05-21 23:30:52] [INFO ] Flatten gal took : 370 ms
[2024-05-21 23:30:53] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 86 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:53] [INFO ] Flatten gal took : 319 ms
[2024-05-21 23:30:54] [INFO ] Flatten gal took : 360 ms
[2024-05-21 23:30:54] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 84 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:55] [INFO ] Flatten gal took : 321 ms
[2024-05-21 23:30:55] [INFO ] Flatten gal took : 361 ms
[2024-05-21 23:30:56] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 556 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 556 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:57] [INFO ] Flatten gal took : 317 ms
[2024-05-21 23:30:57] [INFO ] Flatten gal took : 356 ms
[2024-05-21 23:30:58] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 78 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:58] [INFO ] Flatten gal took : 329 ms
[2024-05-21 23:30:58] [INFO ] Flatten gal took : 370 ms
[2024-05-21 23:30:59] [INFO ] Input system was already deterministic with 10200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 10200/10200 transitions.
Applied a total of 0 rules in 83 ms. Remains 425 /425 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 425/425 places, 10200/10200 transitions.
[2024-05-21 23:30:59] [INFO ] Flatten gal took : 333 ms
[2024-05-21 23:31:00] [INFO ] Flatten gal took : 378 ms
[2024-05-21 23:31:00] [INFO ] Input system was already deterministic with 10200 transitions.
[2024-05-21 23:31:01] [INFO ] Flatten gal took : 368 ms
[2024-05-21 23:31:01] [INFO ] Flatten gal took : 422 ms
[2024-05-21 23:31:01] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 23:31:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 425 places, 10200 transitions and 72625 arcs took 56 ms.
Total runtime 39365 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 425
TRANSITIONS: 10200
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.332s, Sys 0.031s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.042s, 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: 633
MODEL NAME: /home/mcc/execution/406/model
425 places, 10200 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.
Building monolithic NSF...
FORMULA Dekker-PT-100-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-100-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716334297197

--------------------
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="Dekker-PT-100"
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 Dekker-PT-100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631130400113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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