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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-12-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-12-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717367866105

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:37:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:37:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:37:47] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 22:37:47] [INFO ] Transformed 169 places.
[2024-06-02 22:37:47] [INFO ] Transformed 508 transitions.
[2024-06-02 22:37:47] [INFO ] Found NUPN structural information;
[2024-06-02 22:37:47] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-12-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 440/440 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 169 transition count 434
Applied a total of 6 rules in 27 ms. Remains 169 /169 variables (removed 0) and now considering 434/440 (removed 6) transitions.
[2024-06-02 22:37:47] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 169 cols
[2024-06-02 22:37:47] [INFO ] Computed 10 invariants in 21 ms
[2024-06-02 22:37:47] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-02 22:37:47] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
[2024-06-02 22:37:47] [INFO ] Invariant cache hit.
[2024-06-02 22:37:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:37:48] [INFO ] Implicit Places using invariants and state equation in 419 ms returned [115, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 726 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 167/169 places, 434/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 167 /167 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 774 ms. Remains : 167/169 places, 434/440 transitions.
Support contains 78 out of 167 places after structural reductions.
[2024-06-02 22:37:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 22:37:48] [INFO ] Flatten gal took : 73 ms
FORMULA FireWire-PT-12-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:37:48] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:37:48] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 67 out of 167 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (1084 resets) in 3006 ms. (13 steps per ms) remains 10/47 properties
BEST_FIRST walk for 40003 steps (207 resets) in 342 ms. (116 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (209 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (189 resets) in 244 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (221 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (259 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (202 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (206 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (212 resets) in 101 ms. (392 steps per ms) remains 6/8 properties
[2024-06-02 22:37:49] [INFO ] Flow matrix only has 402 transitions (discarded 32 similar events)
// Phase 1: matrix 402 rows 167 cols
[2024-06-02 22:37:49] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:37:49] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 2 (OVERLAPS) 121/134 variables, 4/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 121/138 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/157 variables, 4/142 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 23/165 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 394/551 variables, 157/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 56/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:37:50] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 1/379 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 17/568 variables, 10/389 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 10/399 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 1/400 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/400 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/569 variables, 1/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 0/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/569 variables, 0/401 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 401 constraints, problems are : Problem set: 2 solved, 4 unsolved in 698 ms.
Refiners :[Domain max(s): 167/167 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 85/90 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 85/93 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 66/156 variables, 5/99 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 66/165 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:37:50] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/166 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 393/549 variables, 156/322 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 55/377 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 3/380 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 22:37:51] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:37:51] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 7 ms to minimize.
[2024-06-02 22:37:51] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 3/383 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 19/568 variables, 11/394 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 11/405 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/568 variables, 2/407 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/568 variables, 1/408 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/568 variables, 0/408 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/569 variables, 1/409 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 0/409 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/569 variables, 0/409 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 409 constraints, problems are : Problem set: 2 solved, 4 unsolved in 955 ms.
Refiners :[Domain max(s): 167/167 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 1692ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 3 properties in 439 ms.
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 434/434 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 167 transition count 431
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 167 transition count 425
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 161 transition count 425
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 158 transition count 419
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 158 transition count 419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 155 transition count 428
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 155 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 155 transition count 419
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 155 transition count 428
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 57 place count 149 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 149 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 148 transition count 412
Applied a total of 64 rules in 121 ms. Remains 148 /167 variables (removed 19) and now considering 412/434 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 148/167 places, 412/434 transitions.
RANDOM walk for 40000 steps (1271 resets) in 1140 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (272 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1220694 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 1
Probabilistic random walk after 1220694 steps, saw 334910 distinct states, run finished after 3006 ms. (steps per millisecond=406 ) properties seen :0
[2024-06-02 22:37:55] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 148 cols
[2024-06-02 22:37:55] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:37:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/504 variables, 79/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 38/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 17/521 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/523 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/523 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/504 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 17/521 variables, 11/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/521 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/523 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/523 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/523 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/523 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 412/412 transitions.
Applied a total of 0 rules in 11 ms. Remains 148 /148 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 148/148 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 412/412 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 22:37:56] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:37:56] [INFO ] Invariant cache hit.
[2024-06-02 22:37:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 22:37:56] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:37:56] [INFO ] Invariant cache hit.
[2024-06-02 22:37:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:37:56] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 370 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 147/148 places, 412/412 transitions.
Applied a total of 0 rules in 16 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 396 ms. Remains : 147/148 places, 412/412 transitions.
RANDOM walk for 40000 steps (1318 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (293 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1346212 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1346212 steps, saw 364176 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-06-02 22:37:59] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 22:37:59] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 22:37:59] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/504 variables, 79/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 38/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/520 variables, 10/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/522 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/158 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/344 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/504 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/520 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/522 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 22:38:00] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:38:00] [INFO ] Invariant cache hit.
[2024-06-02 22:38:00] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-02 22:38:00] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:38:00] [INFO ] Invariant cache hit.
[2024-06-02 22:38:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:38:00] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-02 22:38:00] [INFO ] Redundant transitions in 25 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 22:38:00] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:38:00] [INFO ] Invariant cache hit.
[2024-06-02 22:38:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:38:03] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:38:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 22:38:10] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:38:10] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:38:10] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 220 constraints, problems are : Problem set: 0 solved, 406 unsolved in 18990 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 406/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 626 constraints, problems are : Problem set: 0 solved, 406 unsolved in 21513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
After SMT, in 40942ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 40949ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41557 ms. Remains : 147/147 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 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 121 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 120 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 118 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 118 transition count 216
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 118 transition count 201
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 109 transition count 198
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 109 transition count 198
Applied a total of 46 rules in 46 ms. Remains 109 /147 variables (removed 38) and now considering 198/412 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:38:41] [INFO ] Flow matrix only has 196 transitions (discarded 2 similar events)
// Phase 1: matrix 196 rows 109 cols
[2024-06-02 22:38:41] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 22:38:41] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:38:41] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:38:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:38:41] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:38:41] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
TRAPS : Iteration 1
[2024-06-02 22:38:41] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:38:41] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 389 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-06-02 22:38:41] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 434 transitions.
Support contains 55 out of 167 places (down from 60) after GAL structural reductions.
Computed a total of 23 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 4 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 4 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 4 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 5 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 4 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 4 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 4 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 4 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 38 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 166 transition count 427
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 160 transition count 427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 157 transition count 421
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 157 transition count 421
Applied a total of 18 rules in 51 ms. Remains 157 /167 variables (removed 10) and now considering 421/434 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 157/167 places, 421/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:38:42] [INFO ] Input system was already deterministic with 421 transitions.
RANDOM walk for 6208 steps (205 resets) in 55 ms. (110 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-12-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 166 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 432
Applied a total of 2 rules in 3 ms. Remains 166 /167 variables (removed 1) and now considering 432/434 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 166/167 places, 432/434 transitions.
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:38:42] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:38:43] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 428
Applied a total of 6 rules in 4 ms. Remains 164 /167 variables (removed 3) and now considering 428/434 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 164/167 places, 428/434 transitions.
[2024-06-02 22:38:43] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:38:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:38:43] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 434/434 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 165 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 165 transition count 430
Applied a total of 4 rules in 4 ms. Remains 165 /167 variables (removed 2) and now considering 430/434 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 165/167 places, 430/434 transitions.
[2024-06-02 22:38:43] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:38:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:38:43] [INFO ] Input system was already deterministic with 430 transitions.
[2024-06-02 22:38:43] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:38:43] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:38:43] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 22:38:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 434 transitions and 1587 arcs took 3 ms.
Total runtime 55982 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 167
TRANSITIONS: 434
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.004s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 646
MODEL NAME: /home/mcc/execution/412/model
167 places, 434 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-12-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-12-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA FireWire-PT-12-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717369018958

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

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