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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366373944

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:12:55] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 22:12:55] [INFO ] Transformed 126 places.
[2024-06-02 22:12:55] [INFO ] Transformed 396 transitions.
[2024-06-02 22:12:55] [INFO ] Found NUPN structural information;
[2024-06-02 22:12:55] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-07-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2258 resets) in 1921 ms. (20 steps per ms) remains 14/15 properties
FORMULA FireWire-PT-07-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (16 resets) in 203 ms. (196 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (569 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (58 resets) in 177 ms. (224 steps per ms) remains 10/14 properties
FORMULA FireWire-PT-07-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (1497 resets) in 698 ms. (57 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 1463 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (531 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (605 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1517 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
[2024-06-02 22:12:57] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 22:12:57] [INFO ] Computed 8 invariants in 9 ms
[2024-06-02 22:12:57] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FireWire-PT-07-ReachabilityFireability-2024-06 is UNSAT
FORMULA FireWire-PT-07-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-07-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-07-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-07-ReachabilityFireability-2024-15 is UNSAT
FORMULA FireWire-PT-07-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/107 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/107 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem FireWire-PT-07-ReachabilityFireability-2024-14 is UNSAT
FORMULA FireWire-PT-07-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20/124 variables, 5/112 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/132 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/132 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 310/434 variables, 124/256 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 44/300 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/300 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/436 variables, 2/302 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 2/304 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/304 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/437 variables, 1/305 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/305 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/437 variables, 0/305 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 305 constraints, problems are : Problem set: 4 solved, 6 unsolved in 826 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
Problem FireWire-PT-07-ReachabilityFireability-2024-07 is UNSAT
FORMULA FireWire-PT-07-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem FireWire-PT-07-ReachabilityFireability-2024-04 is UNSAT
FORMULA FireWire-PT-07-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 49/124 variables, 8/83 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 49/132 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-02 22:12:58] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 24 ms to minimize.
[2024-06-02 22:12:58] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:12:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/135 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 310/434 variables, 124/259 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 44/303 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/305 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/305 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/436 variables, 2/307 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 2/309 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 2/311 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/311 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/437 variables, 1/312 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 0/312 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/437 variables, 0/312 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 312 constraints, problems are : Problem set: 6 solved, 4 unsolved in 1385 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 2571ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 2570 ms.
Support contains 47 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 343/343 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 123 transition count 333
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 123 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 123 transition count 331
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 2 with 2 rules applied. Total rules applied 13 place count 122 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 122 transition count 324
Applied a total of 19 rules in 68 ms. Remains 122 /126 variables (removed 4) and now considering 324/343 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 122/126 places, 324/343 transitions.
RANDOM walk for 40000 steps (2241 resets) in 445 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (555 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (83 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (565 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (599 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 836261 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :1 out of 4
Probabilistic random walk after 836261 steps, saw 172673 distinct states, run finished after 3007 ms. (steps per millisecond=278 ) properties seen :1
FORMULA FireWire-PT-07-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:13:05] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
// Phase 1: matrix 300 rows 122 cols
[2024-06-02 22:13:05] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:13:05] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/120 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 300/420 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/422 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/422 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 72/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/120 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:06] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 300/420 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 43/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/422 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:06] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 551 ms.
Support contains 39 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 324/324 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 121 transition count 321
Applied a total of 3 rules in 20 ms. Remains 121 /122 variables (removed 1) and now considering 321/324 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 121/122 places, 321/324 transitions.
RANDOM walk for 40000 steps (2156 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (562 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (54 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (550 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1042664 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 3
Probabilistic random walk after 1042664 steps, saw 214537 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2024-06-02 22:13:10] [INFO ] Flow matrix only has 297 transitions (discarded 24 similar events)
// Phase 1: matrix 297 rows 121 cols
[2024-06-02 22:13:10] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 22:13:10] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 71/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/119 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 297/416 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 43/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/418 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 71/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/119 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:10] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 297/416 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/418 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:13:11] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:13:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/418 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 968ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1558 ms.
Support contains 39 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 321/321 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 121/121 places, 321/321 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 321/321 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-06-02 22:13:13] [INFO ] Flow matrix only has 297 transitions (discarded 24 similar events)
[2024-06-02 22:13:13] [INFO ] Invariant cache hit.
[2024-06-02 22:13:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:13:13] [INFO ] Flow matrix only has 297 transitions (discarded 24 similar events)
[2024-06-02 22:13:13] [INFO ] Invariant cache hit.
[2024-06-02 22:13:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:13:13] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 22:13:13] [INFO ] Redundant transitions in 21 ms returned []
Running 320 sub problems to find dead transitions.
[2024-06-02 22:13:13] [INFO ] Flow matrix only has 297 transitions (discarded 24 similar events)
[2024-06-02 22:13:13] [INFO ] Invariant cache hit.
[2024-06-02 22:13:13] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:13:15] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:13:15] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:13:15] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:13:15] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:13:15] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:13:15] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:13:16] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 3 ms to minimize.
[2024-06-02 22:13:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 297/418 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 180 constraints, problems are : Problem set: 0 solved, 320 unsolved in 8365 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 297/418 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 320/500 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-06-02 22:13:28] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 0/418 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 501 constraints, problems are : Problem set: 0 solved, 320 unsolved in 28258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 9/9 constraints]
After SMT, in 36858ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 36863ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37122 ms. Remains : 121/121 places, 321/321 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 121 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 37 place count 121 transition count 284
Applied a total of 37 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 284/321 (removed 37) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 284 rows 121 cols
[2024-06-02 22:13:50] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:13:50] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:13:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:13:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:13:50] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 22:13:50] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-02 22:13:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:13:50] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 22:13:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-06-02 22:13:50] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 22:13:50] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 761 ms.
[2024-06-02 22:13:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-02 22:13:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 321 transitions and 1189 arcs took 11 ms.
[2024-06-02 22:13:51] [INFO ] Flatten gal took : 54 ms
Total runtime 56065 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-07

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 639
MODEL NAME: /home/mcc/execution/412/model
121 places, 321 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-07-ReachabilityFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-07-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366433970

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-07, examination is ReachabilityFireability"
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-171734898100223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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