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-171631130400105.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-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130400105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.2K 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 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 21:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 20:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Apr 11 20:52 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 1.5M 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-050-CTLCardinality-2024-00
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-01
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-02
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-03
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-04
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-05
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-06
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-07
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-08
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-09
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-10
FORMULA_NAME Dekker-PT-050-CTLCardinality-2024-11
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-12
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-13
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-14
FORMULA_NAME Dekker-PT-050-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334062190

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-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:27:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 23:27:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:27:43] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-21 23:27:43] [INFO ] Transformed 250 places.
[2024-05-21 23:27:43] [INFO ] Transformed 2600 transitions.
[2024-05-21 23:27:43] [INFO ] Found NUPN structural information;
[2024-05-21 23:27:43] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 86 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 70 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2024-05-21 23:27:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2024-05-21 23:27:44] [INFO ] Computed 150 invariants in 19 ms
[2024-05-21 23:27:45] [INFO ] Implicit Places using invariants in 1548 ms returned [100, 109, 112, 115, 124, 133, 136, 145, 148, 151, 157, 160, 166, 169, 172, 178, 187, 190, 193, 196, 202, 205, 208, 211, 214, 220, 223, 235, 238, 241, 247]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1591 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 219/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 26 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1704 ms. Remains : 219/250 places, 2600/2600 transitions.
Support contains 86 out of 219 places after structural reductions.
[2024-05-21 23:27:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 315 ms
[2024-05-21 23:27:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Dekker-PT-050-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:27:46] [INFO ] Flatten gal took : 164 ms
[2024-05-21 23:27:46] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 65 out of 219 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2056 ms. (19 steps per ms) remains 7/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
[2024-05-21 23:27:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 219 cols
[2024-05-21 23:27:48] [INFO ] Computed 119 invariants in 9 ms
[2024-05-21 23:27:48] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 24/35 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 21 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:27:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 5 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 5/40 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 3/43 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 40/83 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/83 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 80/163 variables, 50/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 216/379 variables, 136/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 136/467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 24/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/379 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 40/419 variables, 56/547 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 40/587 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/419 variables, 16/603 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/419 variables, 40/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/419 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 0/419 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 643 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2826 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 219/219 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 24/35 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 5/40 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/43 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 40/83 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/83 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 80/163 variables, 50/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 216/379 variables, 136/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/379 variables, 136/467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/379 variables, 24/491 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/379 variables, 7/498 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/379 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/379 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/379 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/379 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 40/419 variables, 56/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/419 variables, 40/611 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/419 variables, 16/627 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/419 variables, 40/667 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/419 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 14 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/419 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/419 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 0/419 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 670 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2690 ms.
Refiners :[Domain max(s): 219/219 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 219/219 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 56/56 constraints]
After SMT, in 5628ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 3269 steps, including 43 resets, run visited all 4 properties in 61 ms. (steps per millisecond=53 )
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 7 properties in 804 ms.
[2024-05-21 23:27:54] [INFO ] Flatten gal took : 91 ms
[2024-05-21 23:27:54] [INFO ] Flatten gal took : 99 ms
[2024-05-21 23:27:55] [INFO ] Input system was already deterministic with 2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 31 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:55] [INFO ] Flatten gal took : 91 ms
[2024-05-21 23:27:55] [INFO ] Flatten gal took : 97 ms
[2024-05-21 23:27:55] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:55] [INFO ] Flatten gal took : 80 ms
[2024-05-21 23:27:55] [INFO ] Flatten gal took : 87 ms
[2024-05-21 23:27:55] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 36 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:55] [INFO ] Flatten gal took : 79 ms
[2024-05-21 23:27:56] [INFO ] Flatten gal took : 86 ms
[2024-05-21 23:27:56] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:56] [INFO ] Flatten gal took : 89 ms
[2024-05-21 23:27:56] [INFO ] Flatten gal took : 87 ms
[2024-05-21 23:27:56] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:56] [INFO ] Flatten gal took : 82 ms
[2024-05-21 23:27:56] [INFO ] Flatten gal took : 96 ms
[2024-05-21 23:27:56] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 14 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:57] [INFO ] Flatten gal took : 76 ms
[2024-05-21 23:27:57] [INFO ] Flatten gal took : 85 ms
[2024-05-21 23:27:57] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 238 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:57] [INFO ] Flatten gal took : 96 ms
[2024-05-21 23:27:57] [INFO ] Flatten gal took : 81 ms
[2024-05-21 23:27:57] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 114 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:58] [INFO ] Flatten gal took : 124 ms
[2024-05-21 23:27:58] [INFO ] Flatten gal took : 109 ms
[2024-05-21 23:27:58] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:58] [INFO ] Flatten gal took : 75 ms
[2024-05-21 23:27:58] [INFO ] Flatten gal took : 83 ms
[2024-05-21 23:27:58] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:58] [INFO ] Flatten gal took : 75 ms
[2024-05-21 23:27:58] [INFO ] Flatten gal took : 85 ms
[2024-05-21 23:27:59] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:59] [INFO ] Flatten gal took : 84 ms
[2024-05-21 23:27:59] [INFO ] Flatten gal took : 88 ms
[2024-05-21 23:27:59] [INFO ] Input system was already deterministic with 2600 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 2600/2600 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 219/219 places, 2600/2600 transitions.
[2024-05-21 23:27:59] [INFO ] Flatten gal took : 73 ms
[2024-05-21 23:27:59] [INFO ] Flatten gal took : 87 ms
[2024-05-21 23:27:59] [INFO ] Input system was already deterministic with 2600 transitions.
[2024-05-21 23:27:59] [INFO ] Flatten gal took : 93 ms
[2024-05-21 23:27:59] [INFO ] Flatten gal took : 106 ms
[2024-05-21 23:27:59] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 23:27:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 2600 transitions and 18519 arcs took 19 ms.
Total runtime 16445 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 219
TRANSITIONS: 2600
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.083s, Sys 0.007s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 715
MODEL NAME: /home/mcc/execution/411/model
219 places, 2600 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-050-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-050-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716334084940

--------------------
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-050"
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-050, 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-171631130400105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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