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-171624275000479.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-14ringLRLarge, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624275000479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 13 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 13 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 13:50 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 14 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 135K 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-14ringLRLarge-ReachabilityFireability-2024-00
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-01
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-02
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-03
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-04
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-05
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-06
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-07
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-08
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-09
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-10
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-11
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-12
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-13
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-14
FORMULA_NAME DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716535720320

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-14ringLRLarge
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 07:28:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 07:28:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:28:42] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-24 07:28:42] [INFO ] Transformed 33 places.
[2024-05-24 07:28:42] [INFO ] Transformed 312 transitions.
[2024-05-24 07:28:42] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (3093 resets) in 2329 ms. (17 steps per ms) remains 14/16 properties
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (215 resets) in 1118 ms. (35 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (189 resets) in 1072 ms. (37 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (228 resets) in 752 ms. (53 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (177 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (198 resets) in 247 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (190 resets) in 232 ms. (171 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (189 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (173 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (177 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (226 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (185 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (177 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (221 resets) in 89 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (213 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
[2024-05-24 07:28:45] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2024-05-24 07:28:45] [INFO ] Computed 0 invariants in 10 ms
[2024-05-24 07:28:45] [INFO ] State equation strengthened by 71 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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 308/339 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 70/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/343 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4442 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
[2024-05-24 07:28:50] [INFO ] Deduced a trap composed of 1 places in 40 ms of which 11 ms to minimize.
[2024-05-24 07:28:50] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 308/339 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 70/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 119 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5014 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 9917ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 33 transition count 308
Applied a total of 4 rules in 28 ms. Remains 33 /33 variables (removed 0) and now considering 308/312 (removed 4) transitions.
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 308 rows 33 cols
[2024-05-24 07:28:55] [INFO ] Computed 0 invariants in 13 ms
[2024-05-24 07:28:55] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 10/341 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 103 constraints, problems are : Problem set: 0 solved, 280 unsolved in 15084 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 280/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 10/341 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 383 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20026 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 35544ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 35551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35602 ms. Remains : 33/33 places, 308/312 transitions.
RANDOM walk for 40000 steps (3072 resets) in 632 ms. (63 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (215 resets) in 219 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (191 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (234 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (188 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (205 resets) in 235 ms. (169 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (197 resets) in 227 ms. (175 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (194 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (172 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (175 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (230 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (197 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (183 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (230 resets) in 64 ms. (615 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (218 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 589157 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 14
Probabilistic random walk after 589157 steps, saw 88760 distinct states, run finished after 3007 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-24 07:29:34] [INFO ] Invariant cache hit.
[2024-05-24 07:29:34] [INFO ] State equation strengthened by 70 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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 308/339 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 70/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/341 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 103 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2921 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
[2024-05-24 07:29:37] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
[2024-05-24 07:29:37] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 308/339 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 70/103 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 14/117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 119 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45012 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 48025ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 308/308 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 33/33 places, 308/308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 308/308 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-05-24 07:30:22] [INFO ] Invariant cache hit.
[2024-05-24 07:30:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 07:30:22] [INFO ] Invariant cache hit.
[2024-05-24 07:30:22] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-24 07:30:22] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-24 07:30:22] [INFO ] Redundant transitions in 33 ms returned []
Running 280 sub problems to find dead transitions.
[2024-05-24 07:30:22] [INFO ] Invariant cache hit.
[2024-05-24 07:30:22] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 10/341 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 103 constraints, problems are : Problem set: 0 solved, 280 unsolved in 12427 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 280/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 10/341 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 383 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30014 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 42843ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 42849ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43066 ms. Remains : 33/33 places, 308/308 transitions.
[2024-05-24 07:31:05] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-24 07:31:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 308 transitions and 910 arcs took 7 ms.
[2024-05-24 07:31:05] [INFO ] Flatten gal took : 60 ms
Total runtime 143467 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DNAwalker-PT-14ringLRLarge

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 591
MODEL NAME: /home/mcc/execution/412/model
33 places, 308 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-14ringLRLarge-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716535873590

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

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