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.r113-smll-171624274900423.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 DNAwalker-PT-07track28RR, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274900423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 13 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 108K May 18 16:42 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 DNAwalker-PT-07track28RR-ReachabilityFireability-2024-00
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-01
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-02
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-03
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-04
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-05
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-06
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-07
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-08
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-09
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-10
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-11
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-12
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-13
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-14
FORMULA_NAME DNAwalker-PT-07track28RR-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716485501747

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-07track28RR
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 17:31:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 17:31:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:31:44] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-23 17:31:44] [INFO ] Transformed 34 places.
[2024-05-23 17:31:44] [INFO ] Transformed 250 transitions.
[2024-05-23 17:31:44] [INFO ] Parsed PT model containing 34 places and 250 transitions and 728 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2549 resets) in 2723 ms. (14 steps per ms) remains 13/16 properties
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (233 resets) in 299 ms. (133 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (233 resets) in 598 ms. (66 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (239 resets) in 940 ms. (42 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (273 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (231 resets) in 322 ms. (123 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (258 resets) in 249 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (242 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (228 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (279 resets) in 57 ms. (689 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (253 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (224 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (246 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (252 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
[2024-05-23 17:31:46] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2024-05-23 17:31:46] [INFO ] Computed 0 invariants in 10 ms
[2024-05-23 17:31:46] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 244/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 53/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/280 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/281 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 88 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3562 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
[2024-05-23 17:31:50] [INFO ] Deduced a trap composed of 1 places in 37 ms of which 12 ms to minimize.
[2024-05-23 17:31:50] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 244/276 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 53/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/281 variables, and 102 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5009 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/54 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
After SMT, in 8879ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 250/250 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 34 transition count 244
Applied a total of 6 rules in 32 ms. Remains 34 /34 variables (removed 0) and now considering 244/250 (removed 6) transitions.
Running 230 sub problems to find dead transitions.
// Phase 1: matrix 244 rows 34 cols
[2024-05-23 17:31:55] [INFO ] Computed 0 invariants in 3 ms
[2024-05-23 17:31:55] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 240/268 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 10/278 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 87 constraints, problems are : Problem set: 0 solved, 230 unsolved in 12713 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 240/268 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 230/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 10/278 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 317 constraints, problems are : Problem set: 0 solved, 230 unsolved in 20034 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 33073ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 33079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33142 ms. Remains : 34/34 places, 244/250 transitions.
RANDOM walk for 40000 steps (2507 resets) in 646 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (241 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (234 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (248 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (270 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (229 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (261 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (239 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (233 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (271 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (259 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (230 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (260 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (260 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 468697 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 13
Probabilistic random walk after 468697 steps, saw 82940 distinct states, run finished after 3020 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-23 17:32:32] [INFO ] Invariant cache hit.
[2024-05-23 17:32:32] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 244/276 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 53/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/278 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 87 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2365 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
[2024-05-23 17:32:34] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 244/276 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 53/86 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DNAwalker-PT-07track28RR-ReachabilityFireability-2024-06 is UNSAT
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 101 constraints, problems are : Problem set: 1 solved, 12 unsolved in 45010 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 47495ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 244/244 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 243
Applied a total of 1 rules in 11 ms. Remains 34 /34 variables (removed 0) and now considering 243/244 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 34/34 places, 243/244 transitions.
RANDOM walk for 40000 steps (2503 resets) in 246 ms. (161 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (244 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (242 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (254 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (279 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (241 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (246 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (234 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (280 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (266 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (236 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (257 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (264 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 577649 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 12
Probabilistic random walk after 577649 steps, saw 101571 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 243 rows 34 cols
[2024-05-23 17:33:23] [INFO ] Computed 0 invariants in 8 ms
[2024-05-23 17:33:23] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 243/274 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 53/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/277 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 87 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1564 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
[2024-05-23 17:33:24] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-23 17:33:25] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 243/274 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 53/86 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 101 constraints, problems are : Problem set: 0 solved, 12 unsolved in 75009 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 76668ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 243/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 34 /34 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 34/34 places, 243/243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-23 17:34:39] [INFO ] Invariant cache hit.
[2024-05-23 17:34:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 17:34:39] [INFO ] Invariant cache hit.
[2024-05-23 17:34:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-23 17:34:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-23 17:34:40] [INFO ] Redundant transitions in 13 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-23 17:34:40] [INFO ] Invariant cache hit.
[2024-05-23 17:34:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 240/268 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 9/277 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 87 constraints, problems are : Problem set: 0 solved, 230 unsolved in 11149 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 240/268 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 53/81 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 230/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 9/277 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 317 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30025 ms.
Refiners :[State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 41347ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 41351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41509 ms. Remains : 34/34 places, 243/243 transitions.
[2024-05-23 17:35:21] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2024-05-23 17:35:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 243 transitions and 717 arcs took 12 ms.
[2024-05-23 17:35:21] [INFO ] Flatten gal took : 64 ms
Total runtime 218012 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DNAwalker-PT-07track28RR

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/423/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 34
TRANSITIONS: 243
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.001s]


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


----------------------------------------------------------------------
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: 617
MODEL NAME: /home/mcc/execution/423/model
34 places, 243 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 DNAwalker-PT-07track28RR-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-07track28RR-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716485728238

--------------------
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="DNAwalker-PT-07track28RR"
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 DNAwalker-PT-07track28RR, 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 r113-smll-171624274900423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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