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.r553-tall-171734901200241.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 ltsminxred
Input is FireWire-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901200241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 101K 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-10-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717355013183

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:03:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:03:34] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 19:03:34] [INFO ] Transformed 131 places.
[2024-06-02 19:03:34] [INFO ] Transformed 409 transitions.
[2024-06-02 19:03:34] [INFO ] Found NUPN structural information;
[2024-06-02 19:03:34] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 170 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-10-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 130 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 130 transition count 344
Applied a total of 9 rules in 32 ms. Remains 130 /131 variables (removed 1) and now considering 344/353 (removed 9) transitions.
[2024-06-02 19:03:34] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
// Phase 1: matrix 318 rows 130 cols
[2024-06-02 19:03:34] [INFO ] Computed 8 invariants in 20 ms
[2024-06-02 19:03:34] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-02 19:03:34] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
[2024-06-02 19:03:34] [INFO ] Invariant cache hit.
[2024-06-02 19:03:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 19:03:35] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 452 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/131 places, 344/353 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 510 ms. Remains : 128/131 places, 344/353 transitions.
Support contains 92 out of 128 places after structural reductions.
[2024-06-02 19:03:35] [INFO ] Flatten gal took : 60 ms
[2024-06-02 19:03:35] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:03:35] [INFO ] Input system was already deterministic with 344 transitions.
Support contains 89 out of 128 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (2214 resets) in 1743 ms. (22 steps per ms) remains 27/68 properties
BEST_FIRST walk for 4002 steps (38 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (72 resets) in 43 ms. (91 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (105 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (56 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (69 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (59 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (65 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (72 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (61 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (61 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (54 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (66 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (58 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (61 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (76 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (62 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (61 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (59 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (66 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (66 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (62 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (56 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
[2024-06-02 19:03:36] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
// Phase 1: matrix 318 rows 128 cols
[2024-06-02 19:03:36] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 19:03:36] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/121 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 3/124 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 317/441 variables, 124/130 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 44/174 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 4/445 variables, 4/178 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/446 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/446 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 179 constraints, problems are : Problem set: 1 solved, 26 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/121 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-06-02 19:03:37] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 3/124 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-06-02 19:03:37] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 2 ms to minimize.
[2024-06-02 19:03:37] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-06-02 19:03:37] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-06-02 19:03:38] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 317/441 variables, 124/135 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 44/179 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 22/201 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-06-02 19:03:38] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:03:38] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 2/203 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 4/445 variables, 4/207 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 3/210 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-06-02 19:03:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:03:39] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:03:39] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 3/213 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 0/213 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 18 (OVERLAPS) 1/446 variables, 1/214 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/446 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 20 (OVERLAPS) 0/446 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 214 constraints, problems are : Problem set: 2 solved, 25 unsolved in 4650 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 128/128 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 25/27 constraints, Known Traps: 10/10 constraints]
After SMT, in 5793ms problems are : Problem set: 2 solved, 25 unsolved
Parikh walk visited 2 properties in 1197 ms.
Support contains 36 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 344/344 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 128 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 125 transition count 335
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 125 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 125 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 124 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 124 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 123 transition count 328
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 123 transition count 328
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 122 transition count 325
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 122 transition count 325
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 21 place count 120 transition count 329
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 25 place count 120 transition count 325
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 27 place count 120 transition count 323
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 120 transition count 324
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 33 place count 118 transition count 322
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 35 place count 118 transition count 320
Applied a total of 35 rules in 78 ms. Remains 118 /128 variables (removed 10) and now considering 320/344 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 118/128 places, 320/344 transitions.
RANDOM walk for 40000 steps (2183 resets) in 390 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (67 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (109 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (69 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (71 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (67 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (57 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (68 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (54 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (64 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (72 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (69 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (82 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (47 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (54 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (59 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (70 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (58 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 708634 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :14 out of 23
Probabilistic random walk after 708634 steps, saw 153235 distinct states, run finished after 3004 ms. (steps per millisecond=235 ) properties seen :14
[2024-06-02 19:03:46] [INFO ] Flow matrix only has 293 transitions (discarded 27 similar events)
// Phase 1: matrix 293 rows 118 cols
[2024-06-02 19:03:46] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 19:03:46] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 84/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 15/114 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 293/407 variables, 114/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 44/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 4/411 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 168 constraints, problems are : Problem set: 0 solved, 9 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 84/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:03:46] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 15/114 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:03:47] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 293/407 variables, 114/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 44/166 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:03:47] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 4/411 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:03:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/411 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 181 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 1517 ms.
Support contains 15 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 117 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 116 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 116 transition count 315
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 116 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 115 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 313
Applied a total of 7 rules in 30 ms. Remains 114 /118 variables (removed 4) and now considering 313/320 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 114/118 places, 313/320 transitions.
RANDOM walk for 40000 steps (2349 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (563 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (572 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (627 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (611 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (577 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (786 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (807 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (569 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 822521 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 8
Probabilistic random walk after 822521 steps, saw 174450 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-06-02 19:03:52] [INFO ] Flow matrix only has 286 transitions (discarded 27 similar events)
// Phase 1: matrix 286 rows 114 cols
[2024-06-02 19:03:52] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:03:52] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 80/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 277/372 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 27/399 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 162 constraints, problems are : Problem set: 0 solved, 8 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 80/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:03:53] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 277/372 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 27/399 variables, 18/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 42/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:03:53] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:03:53] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:03:53] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/400 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/400 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 174 constraints, problems are : Problem set: 0 solved, 8 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1073ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1624 ms.
Support contains 15 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 313/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 114/114 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 313/313 transitions.
Applied a total of 0 rules in 18 ms. Remains 114 /114 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-02 19:03:55] [INFO ] Flow matrix only has 286 transitions (discarded 27 similar events)
[2024-06-02 19:03:55] [INFO ] Invariant cache hit.
[2024-06-02 19:03:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:03:55] [INFO ] Flow matrix only has 286 transitions (discarded 27 similar events)
[2024-06-02 19:03:55] [INFO ] Invariant cache hit.
[2024-06-02 19:03:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 19:03:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-02 19:03:55] [INFO ] Redundant transitions in 18 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-02 19:03:55] [INFO ] Flow matrix only has 286 transitions (discarded 27 similar events)
[2024-06-02 19:03:55] [INFO ] Invariant cache hit.
[2024-06-02 19:03:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 19:03:56] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 5 ms to minimize.
[2024-06-02 19:03:56] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:03:56] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:03:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:03:57] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:03:57] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:03:57] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:03:57] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 19:03:58] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 286/399 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 42/170 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 19:04:01] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 172 constraints, problems are : Problem set: 0 solved, 311 unsolved in 14659 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 286/399 variables, 113/129 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 311/482 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 19:04:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 19:04:17] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 1/400 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 486 constraints, problems are : Problem set: 0 solved, 311 unsolved in 29383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 13/13 constraints]
After SMT, in 44296ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 44301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44570 ms. Remains : 114/114 places, 313/313 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 98 edges and 114 vertex of which 20 / 114 are part of one of the 3 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 101 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 18 place count 96 transition count 196
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 96 transition count 194
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 94 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 93 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 93 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 92 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 91 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 91 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 90 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 89 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 89 transition count 157
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 89 transition count 152
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 42 place count 86 transition count 151
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 86 transition count 151
Applied a total of 44 rules in 41 ms. Remains 86 /114 variables (removed 28) and now considering 151/313 (removed 162) transitions.
Running SMT prover for 8 properties.
[2024-06-02 19:04:40] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 86 cols
[2024-06-02 19:04:40] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:04:40] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 19:04:40] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 19:04:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 19:04:40] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 4 ms to minimize.
[2024-06-02 19:04:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
TRAPS : Iteration 1
[2024-06-02 19:04:40] [INFO ] After 404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 19:04:40] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 588 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-06-02 19:04:40] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:04:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:04:40] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:04:40] [INFO ] Input system was already deterministic with 344 transitions.
Support contains 80 out of 128 places (down from 85) after GAL structural reductions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 122 transition count 331
Applied a total of 12 rules in 18 ms. Remains 122 /128 variables (removed 6) and now considering 331/344 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 122/128 places, 331/344 transitions.
[2024-06-02 19:04:40] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:04:40] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:04:40] [INFO ] Input system was already deterministic with 331 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 111 transition count 305
Applied a total of 34 rules in 43 ms. Remains 111 /128 variables (removed 17) and now considering 305/344 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 111/128 places, 305/344 transitions.
[2024-06-02 19:04:40] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:04:40] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 305 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 126 transition count 338
Applied a total of 6 rules in 11 ms. Remains 126 /128 variables (removed 2) and now considering 338/344 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 126/128 places, 338/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 338 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 339
Applied a total of 5 rules in 3 ms. Remains 126 /128 variables (removed 2) and now considering 339/344 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/128 places, 339/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 118 transition count 321
Applied a total of 20 rules in 21 ms. Remains 118 /128 variables (removed 10) and now considering 321/344 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 118/128 places, 321/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 112 transition count 306
Applied a total of 34 rules in 34 ms. Remains 112 /128 variables (removed 16) and now considering 306/344 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 112/128 places, 306/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 306 transitions.
RANDOM walk for 40000 steps (2229 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (704 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 15873 steps, run visited all 1 properties in 29 ms. (steps per millisecond=547 )
Probabilistic random walk after 15873 steps, saw 5157 distinct states, run finished after 32 ms. (steps per millisecond=496 ) properties seen :1
FORMULA FireWire-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 126 transition count 338
Applied a total of 6 rules in 3 ms. Remains 126 /128 variables (removed 2) and now considering 338/344 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/128 places, 338/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 338 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Applied a total of 20 rules in 9 ms. Remains 119 /128 variables (removed 9) and now considering 321/344 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 119/128 places, 321/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 112 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 112 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 111 transition count 305
Applied a total of 34 rules in 31 ms. Remains 111 /128 variables (removed 17) and now considering 305/344 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 111/128 places, 305/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 305 transitions.
RANDOM walk for 40000 steps (2448 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39253 steps (539 resets) in 44 ms. (872 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 125 transition count 339
Applied a total of 5 rules in 15 ms. Remains 125 /128 variables (removed 3) and now considering 339/344 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 125/128 places, 339/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 312
Applied a total of 26 rules in 20 ms. Remains 115 /128 variables (removed 13) and now considering 312/344 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 115/128 places, 312/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 126 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 126 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 125 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 124 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 124 transition count 334
Applied a total of 9 rules in 4 ms. Remains 124 /128 variables (removed 4) and now considering 334/344 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/128 places, 334/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 334 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 307
Applied a total of 32 rules in 27 ms. Remains 113 /128 variables (removed 15) and now considering 307/344 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 113/128 places, 307/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:41] [INFO ] Input system was already deterministic with 307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 338
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 338
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Applied a total of 24 rules in 8 ms. Remains 117 /128 variables (removed 11) and now considering 316/344 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 117/128 places, 316/344 transitions.
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:04:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:42] [INFO ] Input system was already deterministic with 316 transitions.
[2024-06-02 19:04:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:04:42] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:04:42] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 19:04:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 344 transitions and 1271 arcs took 3 ms.
Total runtime 67803 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-00
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-02
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-04
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-09
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-11
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-12
Could not compute solution for formula : FireWire-PT-10-CTLCardinality-2024-13

BK_STOP 1717355082396

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ctl formula name FireWire-PT-10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/661/ctl_0_
ctl formula name FireWire-PT-10-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/661/ctl_1_
ctl formula name FireWire-PT-10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/661/ctl_2_
ctl formula name FireWire-PT-10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/661/ctl_3_
ctl formula name FireWire-PT-10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/661/ctl_4_
ctl formula name FireWire-PT-10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/661/ctl_5_
ctl formula name FireWire-PT-10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/661/ctl_6_
ctl formula name FireWire-PT-10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/661/ctl_7_
ctl formula name FireWire-PT-10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/661/ctl_8_
ctl formula name FireWire-PT-10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/661/ctl_9_
ctl formula name FireWire-PT-10-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/661/ctl_10_
ctl formula name FireWire-PT-10-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/661/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-10, 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 r553-tall-171734901200241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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