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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 20:12 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 247K 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-020-CTLCardinality-2024-00
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-01
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-02
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-03
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-04
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-05
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-06
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-07
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-08
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-09
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-10
FORMULA_NAME Dekker-PT-020-CTLCardinality-2024-11
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-12
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-13
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-14
FORMULA_NAME Dekker-PT-020-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333994202

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-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:26:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 23:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:26:35] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 23:26:35] [INFO ] Transformed 100 places.
[2024-05-21 23:26:35] [INFO ] Transformed 440 transitions.
[2024-05-21 23:26:35] [INFO ] Found NUPN structural information;
[2024-05-21 23:26:35] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-020-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-21 23:26:35] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-21 23:26:35] [INFO ] Computed 60 invariants in 12 ms
[2024-05-21 23:26:35] [INFO ] Implicit Places using invariants in 236 ms returned [40, 58, 67, 73]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 267 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/100 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 96/100 places, 440/440 transitions.
Support contains 67 out of 96 places after structural reductions.
[2024-05-21 23:26:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:26:36] [INFO ] Flatten gal took : 70 ms
FORMULA Dekker-PT-020-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:26:36] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:26:36] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 59 out of 96 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 40000 steps (8 resets) in 1684 ms. (23 steps per ms) remains 9/42 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
[2024-05-21 23:26:37] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 96 cols
[2024-05-21 23:26:37] [INFO ] Computed 56 invariants in 3 ms
[2024-05-21 23:26:37] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 35/50 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 35/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3/53 variables, 3/77 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 3/80 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 10/63 variables, 10/90 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 10/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 52/115 variables, 63/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 14/129 variables, 20/183 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 40/169 variables, 26/209 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 26/235 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/169 variables, 2/237 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/169 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 7/176 variables, 12/249 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/176 variables, 7/256 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 5/261 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 7/268 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/176 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 268 constraints, problems are : Problem set: 1 solved, 6 unsolved in 397 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 29/41 variables, 19/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 29/60 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 9 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:26:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 16/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 3/44 variables, 3/79 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 3/82 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 5/87 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/53 variables, 9/96 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 9/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 44/97 variables, 53/158 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 18/115 variables, 20/178 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/115 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 52/167 variables, 34/212 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 34/246 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 2/248 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 6/254 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:26:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 9/263 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/167 variables, 0/263 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 9/176 variables, 16/279 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 9/288 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/176 variables, 7/295 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/176 variables, 9/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/176 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/176 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 304 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1197 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 30/30 constraints]
After SMT, in 1634ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 564 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 33 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 96/96 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 605535 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 3
Probabilistic random walk after 605535 steps, saw 318188 distinct states, run finished after 3004 ms. (steps per millisecond=201 ) properties seen :0
[2024-05-21 23:26:42] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:26:42] [INFO ] Invariant cache hit.
[2024-05-21 23:26:42] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 17/23 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/29 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 24/53 variables, 29/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 28/81 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 81/162 variables, 53/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 53/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 14/176 variables, 25/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/176 variables, 14/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/176 variables, 11/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 14/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/176 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 268 constraints, problems are : Problem set: 0 solved, 3 unsolved in 116 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 17/23 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 5/29 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/29 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 24/53 variables, 29/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/53 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 28/81 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/81 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 81/162 variables, 53/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 53/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/162 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 14/176 variables, 25/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 14/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 11/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 14/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/176 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/176 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 274 constraints, problems are : Problem set: 0 solved, 3 unsolved in 249 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 125 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 25 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 96/96 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1666707 steps, run timeout after 3001 ms. (steps per millisecond=555 ) properties seen :0 out of 1
Probabilistic random walk after 1666707 steps, saw 782796 distinct states, run finished after 3001 ms. (steps per millisecond=555 ) properties seen :0
[2024-05-21 23:26:46] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-21 23:26:46] [INFO ] Invariant cache hit.
[2024-05-21 23:26:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/10 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/10 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/18 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/54 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/54 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 104/158 variables, 68/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 68/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/158 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/158 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 18/176 variables, 32/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/176 variables, 18/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 14/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 18/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/176 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/10 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/10 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/18 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/18 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/54 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/54 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 104/158 variables, 68/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 68/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/158 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/158 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/158 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 18/176 variables, 32/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 18/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/176 variables, 18/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/176 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/176 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 96/96 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 19 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 15 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:46] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:47] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:47] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:47] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:47] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/96 places, 440/440 transitions.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:26:47] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:47] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 23:26:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 440 transitions and 3156 arcs took 5 ms.
Total runtime 12156 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-020

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: 96
TRANSITIONS: 440
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 658
MODEL NAME: /home/mcc/execution/411/model
96 places, 440 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.
Building monolithic NSF...
FORMULA Dekker-PT-020-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Dekker-PT-020-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716334008254

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

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