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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K 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.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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 86K 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-02-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-02-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717365346132

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:55:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:55:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:55:47] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 21:55:47] [INFO ] Transformed 108 places.
[2024-06-02 21:55:47] [INFO ] Transformed 355 transitions.
[2024-06-02 21:55:47] [INFO ] Found NUPN structural information;
[2024-06-02 21:55:47] [INFO ] Parsed PT model containing 108 places and 355 transitions and 1311 arcs in 174 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 54 transitions
Reduce redundant transitions removed 54 transitions.
FORMULA FireWire-PT-02-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2181 resets) in 1809 ms. (22 steps per ms) remains 13/15 properties
FORMULA FireWire-PT-02-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-02-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (637 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1330 resets) in 653 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (838 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (19 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1521 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (641 resets) in 136 ms. (291 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (22 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (565 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (851 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (595 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (653 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (565 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (609 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
[2024-06-02 21:55:48] [INFO ] Flow matrix only has 269 transitions (discarded 32 similar events)
// Phase 1: matrix 269 rows 108 cols
[2024-06-02 21:55:49] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 21:55:49] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem FireWire-PT-02-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-02-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-02-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-02-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-02-ReachabilityFireability-2024-09 is UNSAT
FORMULA FireWire-PT-02-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 11/108 variables, 7/105 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 11/116 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 268/376 variables, 108/224 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 39/263 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/263 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/377 variables, 1/264 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/264 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/377 variables, 0/264 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 264 constraints, problems are : Problem set: 3 solved, 10 unsolved in 813 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/93 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem FireWire-PT-02-ReachabilityFireability-2024-05 is UNSAT
FORMULA FireWire-PT-02-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-02-ReachabilityFireability-2024-11 is UNSAT
FORMULA FireWire-PT-02-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 16/108 variables, 7/100 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 16/116 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-02 21:55:50] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 13 ms to minimize.
[2024-06-02 21:55:50] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/118 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/118 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 268/376 variables, 108/226 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 39/265 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 8/273 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/273 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/377 variables, 1/274 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/274 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/377 variables, 0/274 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 274 constraints, problems are : Problem set: 5 solved, 8 unsolved in 2334 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 3502ms problems are : Problem set: 5 solved, 8 unsolved
FORMULA FireWire-PT-02-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-02-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2360 ms.
Support contains 79 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 301/301 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 297
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 11 place count 107 transition count 291
Applied a total of 11 rules in 45 ms. Remains 107 /108 variables (removed 1) and now considering 291/301 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 107/108 places, 291/301 transitions.
RANDOM walk for 40000 steps (2281 resets) in 412 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1554 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (37 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (744 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (639 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (575 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (672 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1123605 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :5 out of 6
Probabilistic random walk after 1123605 steps, saw 228484 distinct states, run finished after 3005 ms. (steps per millisecond=373 ) properties seen :5
FORMULA FireWire-PT-02-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-02-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-02-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-02-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-02-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 21:55:58] [INFO ] Flow matrix only has 267 transitions (discarded 24 similar events)
// Phase 1: matrix 267 rows 107 cols
[2024-06-02 21:55:58] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 21:55:58] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 61/107 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 61/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 267/374 variables, 107/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 39/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 61/107 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 61/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 267/374 variables, 107/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 39/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 46 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 291/291 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 284
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 104 transition count 282
Applied a total of 8 rules in 25 ms. Remains 104 /107 variables (removed 3) and now considering 282/291 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 104/107 places, 282/291 transitions.
RANDOM walk for 40000 steps (2310 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (633 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2078006 steps, run timeout after 3001 ms. (steps per millisecond=692 ) properties seen :0 out of 1
Probabilistic random walk after 2078006 steps, saw 412892 distinct states, run finished after 3001 ms. (steps per millisecond=692 ) properties seen :0
[2024-06-02 21:56:02] [INFO ] Flow matrix only has 258 transitions (discarded 24 similar events)
// Phase 1: matrix 258 rows 104 cols
[2024-06-02 21:56:02] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 21:56:02] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/362 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/362 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/362 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/362 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 46 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 282/282 transitions.
Applied a total of 0 rules in 16 ms. Remains 104 /104 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 104/104 places, 282/282 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 282/282 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-02 21:56:02] [INFO ] Flow matrix only has 258 transitions (discarded 24 similar events)
[2024-06-02 21:56:02] [INFO ] Invariant cache hit.
[2024-06-02 21:56:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:56:02] [INFO ] Flow matrix only has 258 transitions (discarded 24 similar events)
[2024-06-02 21:56:02] [INFO ] Invariant cache hit.
[2024-06-02 21:56:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:56:03] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-02 21:56:03] [INFO ] Redundant transitions in 18 ms returned []
Running 281 sub problems to find dead transitions.
[2024-06-02 21:56:03] [INFO ] Flow matrix only has 258 transitions (discarded 24 similar events)
[2024-06-02 21:56:03] [INFO ] Invariant cache hit.
[2024-06-02 21:56:03] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 21:56:04] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-02 21:56:04] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:56:04] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:56:04] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:56:05] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:56:05] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-06-02 21:56:05] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:56:05] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 258/362 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 21:56:07] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 159 constraints, problems are : Problem set: 0 solved, 281 unsolved in 9709 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 258/362 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 38/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 281/440 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 440 constraints, problems are : Problem set: 0 solved, 281 unsolved in 10410 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 9/9 constraints]
After SMT, in 20305ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 20310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20580 ms. Remains : 104/104 places, 282/282 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 14 edges and 104 vertex of which 2 / 104 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 102 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 102 transition count 241
Applied a total of 17 rules in 30 ms. Remains 102 /104 variables (removed 2) and now considering 241/282 (removed 41) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 241 rows 102 cols
[2024-06-02 21:56:23] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 21:56:23] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:56:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 21:56:23] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:56:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 21:56:23] [INFO ] After 80ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:56:23] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:56:23] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 540 ms.
[2024-06-02 21:56:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-02 21:56:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 282 transitions and 1037 arcs took 4 ms.
[2024-06-02 21:56:24] [INFO ] Flatten gal took : 48 ms
Total runtime 36788 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-02

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 604
MODEL NAME: /home/mcc/execution/401/model
104 places, 282 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-02-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365386377

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-02"
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-02, 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-171734898000183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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