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.r496-tall-171640603600511.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 ltsminxred
Input is GPUForwardProgress-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603600511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 65K 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 GPUForwardProgress-PT-12b-ReachabilityFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717197755224

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:22:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:22:36] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-31 23:22:36] [INFO ] Transformed 264 places.
[2024-05-31 23:22:36] [INFO ] Transformed 277 transitions.
[2024-05-31 23:22:36] [INFO ] Found NUPN structural information;
[2024-05-31 23:22:36] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (354 resets) in 1270 ms. (31 steps per ms) remains 7/16 properties
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (30 resets) in 753 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (60 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (61 resets) in 462 ms. (86 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (53 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (48 resets) in 48 ms. (816 steps per ms) remains 6/7 properties
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 277 rows 264 cols
[2024-05-31 23:22:37] [INFO ] Computed 14 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 148/264 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 148/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem GPUForwardProgress-PT-12b-ReachabilityFireability-2024-05 is UNSAT
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 277/541 variables, 264/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/541 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 542 constraints, problems are : Problem set: 1 solved, 5 unsolved in 614 ms.
Refiners :[Domain max(s): 264/264 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 159/264 variables, 13/119 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 159/278 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem GPUForwardProgress-PT-12b-ReachabilityFireability-2024-00 is UNSAT
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPUForwardProgress-PT-12b-ReachabilityFireability-2024-03 is UNSAT
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 277/541 variables, 264/542 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 3/545 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/545 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/541 variables, 0/545 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 545 constraints, problems are : Problem set: 3 solved, 3 unsolved in 642 ms.
Refiners :[Domain max(s): 264/264 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 442 ms.
Support contains 44 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 277/277 transitions.
Graph (trivial) has 163 edges and 264 vertex of which 5 / 264 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 391 edges and 260 vertex of which 246 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 246 transition count 188
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 106 rules applied. Total rules applied 191 place count 163 transition count 165
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 211 place count 145 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 211 place count 145 transition count 143
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 251 place count 125 transition count 143
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 264 place count 112 transition count 130
Iterating global reduction 3 with 13 rules applied. Total rules applied 277 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 112 transition count 129
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 328 place count 87 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 332 place count 85 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 335 place count 85 transition count 101
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 338 place count 85 transition count 101
Applied a total of 338 rules in 70 ms. Remains 85 /264 variables (removed 179) and now considering 101/277 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 85/264 places, 101/277 transitions.
RANDOM walk for 40000 steps (1067 resets) in 749 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (266 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (200 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (162 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1525543 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :0 out of 3
Probabilistic random walk after 1525543 steps, saw 307679 distinct states, run finished after 3004 ms. (steps per millisecond=507 ) properties seen :0
[2024-05-31 23:22:42] [INFO ] Flow matrix only has 100 transitions (discarded 1 similar events)
// Phase 1: matrix 100 rows 85 cols
[2024-05-31 23:22:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:22:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/150 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 35/185 variables, 35/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 87 constraints, problems are : Problem set: 0 solved, 3 unsolved in 123 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 100/150 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 35/185 variables, 35/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 209 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 137 ms.
Support contains 25 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 101/101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 85 transition count 94
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 78 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 76 transition count 92
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 18 place count 76 transition count 83
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 36 place count 67 transition count 83
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 41 place count 62 transition count 78
Iterating global reduction 3 with 5 rules applied. Total rules applied 46 place count 62 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 62 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 61 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 61 transition count 75
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 59 place count 56 transition count 68
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 61 place count 54 transition count 64
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 54 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 54 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 53 transition count 63
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 68 place count 53 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 69 place count 52 transition count 62
Applied a total of 69 rules in 19 ms. Remains 52 /85 variables (removed 33) and now considering 62/101 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 52/85 places, 62/101 transitions.
RANDOM walk for 40000 steps (1206 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (500 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (289 resets) in 33 ms. (1176 steps per ms) remains 1/2 properties
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 23:22:43] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
// Phase 1: matrix 61 rows 52 cols
[2024-05-31 23:22:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 23:22:43] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/70 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/104 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/112 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/113 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 54 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/70 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/104 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/112 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/113 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/113 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 55 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 158ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1692 steps, including 96 resets, run visited all 1 properties in 3 ms. (steps per millisecond=564 )
FORMULA GPUForwardProgress-PT-12b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
All properties solved without resorting to model-checking.
Total runtime 7205 ms.
ITS solved all properties within timeout

BK_STOP 1717197763574

--------------------
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="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-12b, 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 r496-tall-171640603600511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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