Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898100217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717366182238

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:09:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:09:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:09:43] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 22:09:43] [INFO ] Transformed 126 places.
[2024-06-02 22:09:43] [INFO ] Transformed 396 transitions.
[2024-06-02 22:09:43] [INFO ] Found NUPN structural information;
[2024-06-02 22:09:43] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 126 transition count 337
Applied a total of 6 rules in 20 ms. Remains 126 /126 variables (removed 0) and now considering 337/343 (removed 6) transitions.
[2024-06-02 22:09:43] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 22:09:43] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 22:09:43] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-02 22:09:43] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 22:09:43] [INFO ] Invariant cache hit.
[2024-06-02 22:09:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:09:44] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-02 22:09:44] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 22:09:44] [INFO ] Invariant cache hit.
[2024-06-02 22:09:44] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 22:09:46] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 7 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 1/437 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (OVERLAPS) 0/437 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 314 constraints, problems are : Problem set: 0 solved, 336 unsolved in 13274 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 310/436 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 44/313 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 336/649 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 1/437 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 650 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30020 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 9/9 constraints]
After SMT, in 43637ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 43660ms
Starting structural reductions in LTL mode, iteration 1 : 126/126 places, 337/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44112 ms. Remains : 126/126 places, 337/343 transitions.
Support contains 100 out of 126 places after structural reductions.
[2024-06-02 22:10:27] [INFO ] Flatten gal took : 48 ms
[2024-06-02 22:10:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FireWire-PT-07-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:10:27] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:10:28] [INFO ] Input system was already deterministic with 337 transitions.
Support contains 94 out of 126 places (down from 100) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 78
RANDOM walk for 40000 steps (2195 resets) in 1795 ms. (22 steps per ms) remains 41/78 properties
BEST_FIRST walk for 4003 steps (60 resets) in 47 ms. (83 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (71 resets) in 44 ms. (88 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (61 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (74 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (51 resets) in 28 ms. (138 steps per ms) remains 38/41 properties
BEST_FIRST walk for 4004 steps (56 resets) in 57 ms. (69 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (63 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (61 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (71 resets) in 12 ms. (307 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (52 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (56 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (49 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (77 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (60 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (62 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (56 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (58 resets) in 21 ms. (182 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4003 steps (74 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (61 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (49 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (104 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (62 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (47 resets) in 46 ms. (85 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (57 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (52 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (63 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
[2024-06-02 22:10:29] [INFO ] Flow matrix only has 311 transitions (discarded 26 similar events)
[2024-06-02 22:10:29] [INFO ] Invariant cache hit.
[2024-06-02 22:10:29] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 68/121 variables, 6/59 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 68/127 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-06-02 22:10:29] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:10:29] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:10:29] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:10:29] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/131 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 4/125 variables, 2/133 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/137 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-06-02 22:10:29] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 310/435 variables, 125/263 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 44/307 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 1/436 variables, 1/308 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 1/437 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-06-02 22:10:30] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/437 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 0/437 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 311 constraints, problems are : Problem set: 1 solved, 32 unsolved in 2392 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 69/121 variables, 6/58 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 69/127 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 5/132 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-06-02 22:10:31] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 4/125 variables, 2/135 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/139 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 310/435 variables, 125/265 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 44/309 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 29/338 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-06-02 22:10:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:10:32] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 2/340 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 1/436 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 3/345 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/436 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 20 (OVERLAPS) 1/437 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/437 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 22 (OVERLAPS) 0/437 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 346 constraints, problems are : Problem set: 1 solved, 32 unsolved in 4332 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 32/33 constraints, Known Traps: 9/9 constraints]
After SMT, in 6749ms problems are : Problem set: 1 solved, 32 unsolved
Fused 32 Parikh solutions to 30 different solutions.
Parikh walk visited 7 properties in 2884 ms.
Support contains 46 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 337/337 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 126 transition count 334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 332
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 124 transition count 334
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 124 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 124 transition count 331
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 124 transition count 333
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 123 transition count 331
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 16 place count 123 transition count 329
Applied a total of 16 rules in 63 ms. Remains 123 /126 variables (removed 3) and now considering 329/337 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 123/126 places, 329/337 transitions.
RANDOM walk for 40000 steps (2266 resets) in 397 ms. (100 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (73 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (62 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (61 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (61 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (51 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (65 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (56 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (62 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (56 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (38 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (63 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (118 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (57 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (55 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (69 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (58 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (59 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (41 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 888032 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :20 out of 23
Probabilistic random walk after 888032 steps, saw 195912 distinct states, run finished after 3011 ms. (steps per millisecond=294 ) properties seen :20
[2024-06-02 22:10:42] [INFO ] Flow matrix only has 304 transitions (discarded 25 similar events)
// Phase 1: matrix 304 rows 123 cols
[2024-06-02 22:10:42] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:10:42] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/122 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 304/426 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/427 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/427 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/122 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 304/426 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/427 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/427 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 359 ms.
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 16 place count 116 transition count 315
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 116 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 116 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 116 transition count 336
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 115 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 115 transition count 320
Applied a total of 37 rules in 61 ms. Remains 115 /123 variables (removed 8) and now considering 320/329 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 115/123 places, 320/329 transitions.
RANDOM walk for 40000 steps (2219 resets) in 672 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (560 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1142 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (542 resets) in 30 ms. (1290 steps per ms) remains 2/3 properties
[2024-06-02 22:10:43] [INFO ] Flow matrix only has 292 transitions (discarded 28 similar events)
// Phase 1: matrix 292 rows 115 cols
[2024-06-02 22:10:43] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:10:43] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/405 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/407 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/407 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 58/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 292/405 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 45/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/407 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/407 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 359ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 112 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 112 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 111 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 111 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 110 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 109 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 109 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 108 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 108 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 107 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 107 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 106 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 106 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 105 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 105 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 104 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 104 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 103 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 103 transition count 291
Applied a total of 24 rules in 55 ms. Remains 103 /115 variables (removed 12) and now considering 291/320 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 103/115 places, 291/320 transitions.
RANDOM walk for 40000 steps (2166 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (613 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1145 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 877549 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :0 out of 2
Probabilistic random walk after 877549 steps, saw 199595 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
[2024-06-02 22:10:46] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
// Phase 1: matrix 263 rows 103 cols
[2024-06-02 22:10:46] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:10:46] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/366 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/101 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/364 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/366 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/366 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 153 constraints, problems are : Problem set: 0 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 291/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 291/291 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-06-02 22:10:47] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:10:47] [INFO ] Invariant cache hit.
[2024-06-02 22:10:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:10:47] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:10:47] [INFO ] Invariant cache hit.
[2024-06-02 22:10:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 22:10:47] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-02 22:10:47] [INFO ] Redundant transitions in 13 ms returned []
Running 290 sub problems to find dead transitions.
[2024-06-02 22:10:47] [INFO ] Flow matrix only has 263 transitions (discarded 28 similar events)
[2024-06-02 22:10:47] [INFO ] Invariant cache hit.
[2024-06-02 22:10:47] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 22:10:48] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-02 22:10:49] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 263/366 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 159 constraints, problems are : Problem set: 0 solved, 290 unsolved in 7954 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 263/366 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 290/449 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 449 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13001 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 8/8 constraints]
After SMT, in 21118ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 21121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21347 ms. Remains : 103/103 places, 291/291 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 94 edges and 103 vertex of which 20 / 103 are part of one of the 3 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 103 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 85 transition count 187
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 85 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 85 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 84 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 84 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 83 transition count 170
Free-agglomeration rule applied 7 times with reduction of 4 identical transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 83 transition count 159
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 41 place count 76 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 76 transition count 153
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 76 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 75 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 75 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 75 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 74 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 74 transition count 148
Applied a total of 52 rules in 35 ms. Remains 74 /103 variables (removed 29) and now considering 148/291 (removed 143) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:11:08] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 74 cols
[2024-06-02 22:11:08] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:11:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:11:08] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:11:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:11:08] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:11:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:11:08] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:11:08] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:11:08] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 264 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-06-02 22:11:08] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 337 transitions.
Computed a total of 22 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 118 transition count 316
Applied a total of 19 rules in 5 ms. Remains 118 /126 variables (removed 8) and now considering 316/337 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 118/126 places, 316/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 329
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 329
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 117 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 117 transition count 315
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 20 place count 116 transition count 314
Applied a total of 20 rules in 25 ms. Remains 116 /126 variables (removed 10) and now considering 314/337 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 116/126 places, 314/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 326
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 323
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 292
Applied a total of 39 rules in 17 ms. Remains 108 /126 variables (removed 18) and now considering 292/337 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 108/126 places, 292/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 325
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 121 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 119 transition count 318
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 119 transition count 318
Applied a total of 17 rules in 4 ms. Remains 119 /126 variables (removed 7) and now considering 318/337 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 119/126 places, 318/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 120 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 117 transition count 313
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 106 transition count 287
Applied a total of 43 rules in 14 ms. Remains 106 /126 variables (removed 20) and now considering 287/337 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 106/126 places, 287/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 330
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 120 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 321
Applied a total of 13 rules in 5 ms. Remains 120 /126 variables (removed 6) and now considering 321/337 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/126 places, 321/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 321 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 122 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 122 transition count 328
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 120 transition count 321
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 109 transition count 295
Applied a total of 36 rules in 15 ms. Remains 109 /126 variables (removed 17) and now considering 295/337 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 109/126 places, 295/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 36 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 331
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 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 324
Applied a total of 12 rules in 5 ms. Remains 121 /126 variables (removed 5) and now considering 324/337 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 121/126 places, 324/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 332
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 332
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 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 123 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 123 transition count 329
Applied a total of 7 rules in 3 ms. Remains 123 /126 variables (removed 3) and now considering 329/337 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 123/126 places, 329/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 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 27 place count 113 transition count 306
Applied a total of 27 rules in 17 ms. Remains 113 /126 variables (removed 13) and now considering 306/337 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 113/126 places, 306/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 337/337 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 119 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 119 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 119 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 116 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 105 transition count 286
Applied a total of 43 rules in 30 ms. Remains 105 /126 variables (removed 21) and now considering 286/337 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 105/126 places, 286/337 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:11:09] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:11:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:11:09] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-02 22:11:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 337 transitions and 1245 arcs took 3 ms.
Total runtime 86516 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-07

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 685
MODEL NAME: /home/mcc/execution/411/model
126 places, 337 transitions.

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

BK_STOP 1717366312532

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-07"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-07, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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