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.r549-tall-171734898000193.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 FireWire-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898000193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 FireWire-PT-04-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717365676217

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:01:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:01:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:01:17] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 22:01:17] [INFO ] Transformed 113 places.
[2024-06-02 22:01:17] [INFO ] Transformed 364 transitions.
[2024-06-02 22:01:17] [INFO ] Found NUPN structural information;
[2024-06-02 22:01:17] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 113 transition count 302
Applied a total of 6 rules in 23 ms. Remains 113 /113 variables (removed 0) and now considering 302/308 (removed 6) transitions.
[2024-06-02 22:01:17] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 22:01:17] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 22:01:17] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-02 22:01:17] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 22:01:17] [INFO ] Invariant cache hit.
[2024-06-02 22:01:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:01:18] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [61, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 477 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/113 places, 302/308 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 111/113 places, 302/308 transitions.
Support contains 68 out of 111 places after structural reductions.
[2024-06-02 22:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:01:18] [INFO ] Flatten gal took : 47 ms
[2024-06-02 22:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-04-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-04-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:01:18] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:01:18] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 62 out of 111 places (down from 68) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 60 to 59
RANDOM walk for 40000 steps (2189 resets) in 1731 ms. (23 steps per ms) remains 18/59 properties
BEST_FIRST walk for 4004 steps (55 resets) in 37 ms. (105 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (62 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (57 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (62 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (74 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (62 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (53 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (62 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (67 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (113 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (60 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (53 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
[2024-06-02 22:01:19] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 22:01:19] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 22:01:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 80/102 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 80/106 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:19] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 8 ms to minimize.
[2024-06-02 22:01:19] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 4/106 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:01:20] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 272/378 variables, 106/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 38/260 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:20] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:20] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 5/383 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 3/386 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/386 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 1/387 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/387 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (OVERLAPS) 0/387 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 274 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2188 ms.
Refiners :[Domain max(s): 111/111 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 80/102 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 80/106 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 4/106 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:21] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 272/378 variables, 106/225 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 38/263 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:22] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 5/383 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:01:22] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/383 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/383 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (OVERLAPS) 3/386 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/386 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/386 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 1/387 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/387 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 0/387 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 292 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2167 ms.
Refiners :[Domain max(s): 111/111 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 9/9 constraints]
After SMT, in 4426ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 8924 ms.
Support contains 22 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 110 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 109 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 108 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 108 transition count 295
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 106 transition count 299
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 106 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 106 transition count 293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 106 transition count 294
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 25 place count 104 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 104 transition count 290
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 104 transition count 290
Applied a total of 28 rules in 88 ms. Remains 104 /111 variables (removed 7) and now considering 290/302 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 104/111 places, 290/302 transitions.
RANDOM walk for 40000 steps (2451 resets) in 736 ms. (54 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40003 steps (634 resets) in 92 ms. (430 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (617 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (616 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (602 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (602 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (645 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (639 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1480 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (572 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (465 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (608 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
[2024-06-02 22:01:33] [INFO ] Flow matrix only has 263 transitions (discarded 27 similar events)
// Phase 1: matrix 263 rows 104 cols
[2024-06-02 22:01:33] [INFO ] Computed 6 invariants in 7 ms
[2024-06-02 22:01:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 80/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:01:33] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 262/363 variables, 101/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 4/367 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:01:33] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:01:34] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/367 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/367 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 154 constraints, problems are : Problem set: 0 solved, 11 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 80/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:01:34] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/101 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:01:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 262/363 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 40/152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 11/163 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:01:34] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 4/367 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/367 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/367 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 168 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1320 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 2280ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 2013 ms.
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 290/290 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 103 transition count 291
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 103 transition count 291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 102 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 101 transition count 289
Applied a total of 9 rules in 55 ms. Remains 101 /104 variables (removed 3) and now considering 289/290 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 101/104 places, 289/290 transitions.
RANDOM walk for 40000 steps (2545 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (657 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (647 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (696 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (627 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (630 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (634 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (654 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1544 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (610 resets) in 37 ms. (1052 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (448 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (687 resets) in 35 ms. (1111 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 31864 steps, run visited all 10 properties in 125 ms. (steps per millisecond=254 )
Probabilistic random walk after 31864 steps, saw 9091 distinct states, run finished after 133 ms. (steps per millisecond=239 ) properties seen :10
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 302 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 5 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 299
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 108 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 297
Applied a total of 6 rules in 15 ms. Remains 107 /111 variables (removed 4) and now considering 297/302 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 107/111 places, 297/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 297 transitions.
RANDOM walk for 40000 steps (2617 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (671 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 515 steps, run visited all 1 properties in 4 ms. (steps per millisecond=128 )
Probabilistic random walk after 515 steps, saw 292 distinct states, run finished after 4 ms. (steps per millisecond=128 ) properties seen :1
FORMULA FireWire-PT-04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 110 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 109 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 108 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 298
Applied a total of 6 rules in 13 ms. Remains 108 /111 variables (removed 3) and now considering 298/302 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 108/111 places, 298/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 110 transition count 300
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 109 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 108 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 298
Applied a total of 6 rules in 12 ms. Remains 108 /111 variables (removed 3) and now considering 298/302 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 108/111 places, 298/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:38] [INFO ] Input system was already deterministic with 300 transitions.
[2024-06-02 22:01:38] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:01:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:01:39] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-02 22:01:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 302 transitions and 1097 arcs took 2 ms.
Total runtime 21663 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-04

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: 111
TRANSITIONS: 302
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.004s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
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: 595
MODEL NAME: /home/mcc/execution/411/model
111 places, 302 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-04-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-04-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365717031

--------------------
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="FireWire-PT-04"
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 FireWire-PT-04, 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 r549-tall-171734898000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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