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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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-06-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717366148263

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:09:09] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 22:09:09] [INFO ] Transformed 116 places.
[2024-06-02 22:09:09] [INFO ] Transformed 368 transitions.
[2024-06-02 22:09:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:09:09] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1985 resets) in 1843 ms. (21 steps per ms) remains 8/9 properties
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (525 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (581 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (519 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (760 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (961 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (498 resets) in 103 ms. (384 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (526 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
[2024-06-02 22:09:10] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 22:09:10] [INFO ] Computed 9 invariants in 10 ms
[2024-06-02 22:09:10] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FireWire-PT-06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 72/116 variables, 9/53 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 72/125 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 22:09:11] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 8 ms to minimize.
[2024-06-02 22:09:11] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:09:11] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/128 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 22:09:11] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/245 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/285 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/285 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/286 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 286 constraints, problems are : Problem set: 2 solved, 5 unsolved in 968 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 93/116 variables, 9/32 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 93/125 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/129 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 22:09:12] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/130 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/130 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/246 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/286 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 5/291 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 292 constraints, problems are : Problem set: 2 solved, 5 unsolved in 726 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 1794ms problems are : Problem set: 2 solved, 5 unsolved
Parikh walk visited 0 properties in 1931 ms.
Support contains 23 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 312/312 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 116 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 308
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 113 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 111 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 111 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 111 transition count 298
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 110 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 110 transition count 296
Applied a total of 31 rules in 96 ms. Remains 110 /116 variables (removed 6) and now considering 296/312 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 110/116 places, 296/312 transitions.
RANDOM walk for 40000 steps (2138 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (554 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (578 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (858 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (642 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (565 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1092365 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :2 out of 5
Probabilistic random walk after 1092365 steps, saw 224592 distinct states, run finished after 3004 ms. (steps per millisecond=363 ) properties seen :2
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:09:17] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
// Phase 1: matrix 269 rows 110 cols
[2024-06-02 22:09:18] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 22:09:18] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/379 variables, 110/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 42/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:18] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:18] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 269/379 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 42/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1135 ms.
Support contains 21 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 110/110 places, 296/296 transitions.
RANDOM walk for 40000 steps (2126 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (544 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (815 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (513 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1121882 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 3
Probabilistic random walk after 1121882 steps, saw 230062 distinct states, run finished after 3001 ms. (steps per millisecond=373 ) properties seen :0
[2024-06-02 22:09:22] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
[2024-06-02 22:09:22] [INFO ] Invariant cache hit.
[2024-06-02 22:09:22] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:23] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-02 22:09:23] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:09:23] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 22:09:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 269/379 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 269/379 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 42/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 168 constraints, problems are : Problem set: 0 solved, 3 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 719ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 583 ms.
Support contains 21 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 110/110 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-06-02 22:09:24] [INFO ] Flow matrix only has 269 transitions (discarded 27 similar events)
[2024-06-02 22:09:24] [INFO ] Invariant cache hit.
[2024-06-02 22:09:24] [INFO ] Implicit Places using invariants in 69 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/110 places, 296/296 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 109 transition count 295
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 2 place count 108 transition count 295
Applied a total of 2 rules in 12 ms. Remains 108 /109 variables (removed 1) and now considering 295/296 (removed 1) transitions.
[2024-06-02 22:09:24] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
// Phase 1: matrix 268 rows 108 cols
[2024-06-02 22:09:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:09:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:09:24] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
[2024-06-02 22:09:24] [INFO ] Invariant cache hit.
[2024-06-02 22:09:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:09:24] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [36, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 214 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/110 places, 295/296 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 294
Applied a total of 2 rules in 36 ms. Remains 105 /106 variables (removed 1) and now considering 294/295 (removed 1) transitions.
[2024-06-02 22:09:24] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
// Phase 1: matrix 267 rows 105 cols
[2024-06-02 22:09:24] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 22:09:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 22:09:24] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
[2024-06-02 22:09:24] [INFO ] Invariant cache hit.
[2024-06-02 22:09:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:09:24] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 105/110 places, 294/296 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 557 ms. Remains : 105/110 places, 294/296 transitions.
RANDOM walk for 40000 steps (2346 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (584 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (561 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (615 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 2226655 steps, run timeout after 3001 ms. (steps per millisecond=741 ) properties seen :2 out of 3
Probabilistic random walk after 2226655 steps, saw 460734 distinct states, run finished after 3001 ms. (steps per millisecond=741 ) properties seen :2
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 22:09:27] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
[2024-06-02 22:09:27] [INFO ] Invariant cache hit.
[2024-06-02 22:09:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/103 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:09:27] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 267/370 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/372 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/103 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 267/370 variables, 103/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/372 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 294/294 transitions.
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 2 place count 104 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 4 place count 103 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 103 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 103 transition count 290
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 103 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 102 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 101 transition count 288
Applied a total of 12 rules in 58 ms. Remains 101 /105 variables (removed 4) and now considering 288/294 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 101/105 places, 288/294 transitions.
RANDOM walk for 40000 steps (2387 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (546 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1050026 steps, run visited all 1 properties in 1353 ms. (steps per millisecond=776 )
Probabilistic random walk after 1050026 steps, saw 197880 distinct states, run finished after 1356 ms. (steps per millisecond=774 ) properties seen :1
FORMULA FireWire-PT-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 20261 ms.
ITS solved all properties within timeout

BK_STOP 1717366169725

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

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