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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 153K 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717371841184

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:44:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 23:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:44:02] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-02 23:44:02] [INFO ] Transformed 428 places.
[2024-06-02 23:44:02] [INFO ] Transformed 656 transitions.
[2024-06-02 23:44:02] [INFO ] Found NUPN structural information;
[2024-06-02 23:44:02] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (13 resets) in 1637 ms. (24 steps per ms) remains 8/12 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (16 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (9 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (17 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (16 resets) in 168 ms. (236 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 207 ms. (192 steps per ms) remains 6/7 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (20 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
// Phase 1: matrix 656 rows 428 cols
[2024-06-02 23:44:03] [INFO ] Computed 9 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 351/401 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 351/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 27/428 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 27/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 656/1084 variables, 428/865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 865 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1112 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 351/401 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 351/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:05] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 24 ms to minimize.
[2024-06-02 23:44:05] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:44:05] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:44:05] [INFO ] Deduced a trap composed of 121 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:44:06] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 5/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:06] [INFO ] Deduced a trap composed of 117 places in 159 ms of which 9 ms to minimize.
[2024-06-02 23:44:06] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:44:06] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:44:06] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:44:06] [INFO ] Deduced a trap composed of 105 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 5/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:07] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 27/428 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 27/448 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:07] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:44:07] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 656/1084 variables, 428/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1084 variables, 6/884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:08] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1084 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:08] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1084 variables, 1/886 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:09] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1084 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:44:09] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1084 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 888 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5008 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 17/17 constraints]
After SMT, in 6222ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 285 edges and 428 vertex of which 9 / 428 are part of one of the 2 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1094 edges and 421 vertex of which 415 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 415 transition count 548
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 100 rules applied. Total rules applied 201 place count 318 transition count 545
Reduce places removed 2 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 14 rules applied. Total rules applied 215 place count 316 transition count 533
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 227 place count 304 transition count 533
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 227 place count 304 transition count 524
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 245 place count 295 transition count 524
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 281 place count 259 transition count 488
Iterating global reduction 4 with 36 rules applied. Total rules applied 317 place count 259 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 318 place count 259 transition count 487
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 318 place count 259 transition count 480
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 332 place count 252 transition count 480
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 339 place count 245 transition count 450
Iterating global reduction 5 with 7 rules applied. Total rules applied 346 place count 245 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 348 place count 245 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 349 place count 244 transition count 448
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 409 place count 214 transition count 418
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 447 place count 195 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 451 place count 195 transition count 487
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 473 place count 195 transition count 465
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 499 place count 173 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 504 place count 173 transition count 456
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 505 place count 173 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 506 place count 172 transition count 455
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 509 place count 172 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 510 place count 171 transition count 454
Applied a total of 510 rules in 207 ms. Remains 171 /428 variables (removed 257) and now considering 454/656 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 171/428 places, 454/656 transitions.
RANDOM walk for 40000 steps (1224 resets) in 784 ms. (50 steps per ms) remains 5/6 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (298 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (272 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (313 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (304 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (311 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
[2024-06-02 23:44:10] [INFO ] Flow matrix only has 445 transitions (discarded 9 similar events)
// Phase 1: matrix 445 rows 171 cols
[2024-06-02 23:44:10] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:44:10] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 445/610 variables, 165/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 47/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/616 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/616 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 616/616 variables, and 225 constraints, problems are : Problem set: 0 solved, 5 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 116/165 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:11] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:44:11] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:44:11] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:44:11] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 445/610 variables, 165/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 47/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:11] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:44:11] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:44:12] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/616 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/616 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 616/616 variables, and 237 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 171/171 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4621 ms.
Support contains 49 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 454/454 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 171 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 170 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 170 transition count 452
Applied a total of 3 rules in 22 ms. Remains 170 /171 variables (removed 1) and now considering 452/454 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 170/171 places, 452/454 transitions.
RANDOM walk for 40000 steps (1197 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (284 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (269 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (313 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (292 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (317 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 534452 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 5
Probabilistic random walk after 534452 steps, saw 144360 distinct states, run finished after 3007 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-02 23:44:20] [INFO ] Flow matrix only has 443 transitions (discarded 9 similar events)
// Phase 1: matrix 443 rows 170 cols
[2024-06-02 23:44:20] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:44:20] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 115/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 443/607 variables, 164/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 46/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/613 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/613 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 223 constraints, problems are : Problem set: 0 solved, 5 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 115/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 443/607 variables, 164/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 46/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/613 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:44:21] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/613 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/613 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 234 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1780ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3096 ms.
Support contains 49 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 452/452 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/170 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 452/452 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2024-06-02 23:44:25] [INFO ] Flow matrix only has 443 transitions (discarded 9 similar events)
[2024-06-02 23:44:25] [INFO ] Invariant cache hit.
[2024-06-02 23:44:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:44:25] [INFO ] Flow matrix only has 443 transitions (discarded 9 similar events)
[2024-06-02 23:44:25] [INFO ] Invariant cache hit.
[2024-06-02 23:44:25] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 23:44:25] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-02 23:44:25] [INFO ] Redundant transitions in 35 ms returned []
Running 450 sub problems to find dead transitions.
[2024-06-02 23:44:25] [INFO ] Flow matrix only has 443 transitions (discarded 9 similar events)
[2024-06-02 23:44:25] [INFO ] Invariant cache hit.
[2024-06-02 23:44:25] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:44:29] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:44:29] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:44:29] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 0 ms to minimize.
[2024-06-02 23:44:29] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 6 ms to minimize.
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:44:30] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:44:31] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:44:31] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:44:32] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:44:34] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 6 (OVERLAPS) 443/613 variables, 170/191 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 46/237 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 9 (OVERLAPS) 0/613 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 450 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 237 constraints, problems are : Problem set: 0 solved, 450 unsolved in 27808 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 6 (OVERLAPS) 443/613 variables, 170/191 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 46/237 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 450/687 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:45:07] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-02 23:45:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
[2024-06-02 23:45:12] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:45:15] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:45:15] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 4/692 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/613 variables, and 692 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 19/19 constraints]
After SMT, in 58175ms problems are : Problem set: 0 solved, 450 unsolved
Search for dead transitions found 0 dead transitions in 58182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58596 ms. Remains : 170/170 places, 452/452 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 53 edges and 170 vertex of which 14 / 170 are part of one of the 3 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 627 edges and 159 vertex of which 157 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 156 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 156 transition count 347
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 156 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 28 place count 156 transition count 323
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 156 transition count 323
Applied a total of 32 rules in 21 ms. Remains 156 /170 variables (removed 14) and now considering 323/452 (removed 129) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 323 rows 156 cols
[2024-06-02 23:45:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:45:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:45:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:45:24] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:45:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 23:45:24] [INFO ] After 83ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 23:45:24] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:45:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
TRAPS : Iteration 1
[2024-06-02 23:45:24] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 23:45:24] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 762 ms.
[2024-06-02 23:45:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-02 23:45:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 452 transitions and 1651 arcs took 5 ms.
[2024-06-02 23:45:25] [INFO ] Flatten gal took : 61 ms
Total runtime 82744 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-17

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 734
MODEL NAME: /home/mcc/execution/410/model
170 places, 452 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-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717372429002

--------------------
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 ReachabilityCardinality -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-17"
export BK_EXAMINATION="ReachabilityCardinality"
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-17, examination is ReachabilityCardinality"
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-171734898300302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;