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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 101K 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-10-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717367276125

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:27:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:27:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:27:57] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-02 22:27:57] [INFO ] Transformed 131 places.
[2024-06-02 22:27:57] [INFO ] Transformed 409 transitions.
[2024-06-02 22:27:57] [INFO ] Found NUPN structural information;
[2024-06-02 22:27:57] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2248 resets) in 1964 ms. (20 steps per ms) remains 12/16 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 501 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (606 resets) in 225 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 136 ms. (292 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1131 resets) in 1089 ms. (36 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (27 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1084 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (616 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (23 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (71 resets) in 162 ms. (245 steps per ms) remains 11/12 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (32 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
[2024-06-02 22:27:59] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2024-06-02 22:27:59] [INFO ] Computed 8 invariants in 20 ms
[2024-06-02 22:27:59] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem FireWire-PT-10-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityFireability-2024-11 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-10-ReachabilityFireability-2024-12 is UNSAT
FORMULA FireWire-PT-10-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 35/129 variables, 8/102 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 35/137 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 320/449 variables, 129/266 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 44/310 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/451 variables, 2/312 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 2/314 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 0/314 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/452 variables, 1/315 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/452 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 315 constraints, problems are : Problem set: 4 solved, 7 unsolved in 975 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 60/129 variables, 8/77 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 60/137 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-06-02 22:28:00] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 15 ms to minimize.
[2024-06-02 22:28:00] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:28:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:28:00] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:28:01] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 5/142 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/142 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 320/449 variables, 129/271 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 44/315 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 6/321 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/451 variables, 2/323 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 2/325 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 1/326 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/326 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/452 variables, 1/327 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/327 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/452 variables, 0/327 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 327 constraints, problems are : Problem set: 4 solved, 7 unsolved in 2302 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 3609ms problems are : Problem set: 4 solved, 7 unsolved
FORMULA FireWire-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 3568 ms.
Support contains 64 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 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 131 transition count 350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 130 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 130 transition count 348
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 1 with 2 rules applied. Total rules applied 7 place count 129 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 129 transition count 341
Applied a total of 13 rules in 58 ms. Remains 129 /131 variables (removed 2) and now considering 341/353 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 129/131 places, 341/353 transitions.
RANDOM walk for 40000 steps (2236 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (563 resets) in 239 ms. (166 steps per ms) remains 4/5 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (569 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (18 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 66 ms. (597 steps per ms) remains 2/4 properties
FORMULA FireWire-PT-10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 22:28:06] [INFO ] Flow matrix only has 317 transitions (discarded 24 similar events)
// Phase 1: matrix 317 rows 129 cols
[2024-06-02 22:28:06] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:28:06] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/127 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 317/444 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 44/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/446 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/446 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:28:07] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 3 ms to minimize.
[2024-06-02 22:28:07] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:28:07] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/127 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 317/444 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/446 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:28:07] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/446 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/446 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 187 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 129/129 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1303ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 478 ms.
Support contains 59 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 341/341 transitions.
Applied a total of 0 rules in 13 ms. Remains 129 /129 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 129/129 places, 341/341 transitions.
RANDOM walk for 40000 steps (2253 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (562 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (557 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 98678 steps, run visited all 2 properties in 385 ms. (steps per millisecond=256 )
Probabilistic random walk after 98678 steps, saw 22982 distinct states, run finished after 388 ms. (steps per millisecond=254 ) properties seen :2
FORMULA FireWire-PT-10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11832 ms.
ITS solved all properties within timeout

BK_STOP 1717367289220

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

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