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.r101-tall-171624201900412.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 itstools
Input is DES-PT-05b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-171624201900412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K 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 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 73K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716297542055

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-21 13:19:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-21 13:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:19:03] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 13:19:03] [INFO ] Transformed 300 places.
[2024-05-21 13:19:03] [INFO ] Transformed 251 transitions.
[2024-05-21 13:19:03] [INFO ] Found NUPN structural information;
[2024-05-21 13:19:03] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 182 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 297 transition count 228
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 274 transition count 228
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 274 transition count 219
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 265 transition count 219
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 249 place count 174 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 170 transition count 144
Applied a total of 257 rules in 74 ms. Remains 170 /300 variables (removed 130) and now considering 144/251 (removed 107) transitions.
// Phase 1: matrix 144 rows 170 cols
[2024-05-21 13:19:03] [INFO ] Computed 62 invariants in 20 ms
[2024-05-21 13:19:03] [INFO ] Implicit Places using invariants in 345 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 376 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 169/300 places, 144/251 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 471 ms. Remains : 169/300 places, 144/251 transitions.
Discarding 45 transitions out of 144. Remains 99
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1386 resets) in 1826 ms. (21 steps per ms) remains 9/98 properties
[2024-05-21 13:19:04] [INFO ] Flatten gal took : 91 ms
[2024-05-21 13:19:04] [INFO ] Flatten gal took : 49 ms
BEST_FIRST walk for 40004 steps (177 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
[2024-05-21 13:19:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6339216630918593268.gal : 15 ms
[2024-05-21 13:19:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2443389117361664567.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6339216630918593268.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2443389117361664567.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (222 resets) in 182 ms. (218 steps per ms) remains 8/9 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2443389117361664567.prop.
BEST_FIRST walk for 40004 steps (176 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :11 after 75
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :75 after 315
BEST_FIRST walk for 40004 steps (190 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :315 after 11709
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :11709 after 13287
BEST_FIRST walk for 40004 steps (176 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :13287 after 76215
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :76215 after 621385
BEST_FIRST walk for 40002 steps (182 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (181 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :621385 after 809367
BEST_FIRST walk for 40003 steps (187 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
// Phase 1: matrix 144 rows 169 cols
[2024-05-21 13:19:05] [INFO ] Computed 61 invariants in 11 ms
[2024-05-21 13:19:05] [INFO ] State equation strengthened by 6 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :809367 after 1.94064e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 8/23 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 87/110 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 87/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1.94064e+07 after 5.77519e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 49/159 variables, 27/169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 49/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/163 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 144/307 variables, 163/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Reachability property qltransition_23 is true.
Reachability property qltransition_14 is true.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :5.77519e+07 after 6.15979e+08
[2024-05-21 13:19:05] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 1/394 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 6/313 variables, 6/400 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/313 variables, 6/406 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/313 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/313 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 406 constraints, problems are : Problem set: 1 solved, 7 unsolved in 775 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 169/169 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 7/20 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 89/109 variables, 28/52 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 89/141 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 50/159 variables, 27/168 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 50/218 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/163 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 4/225 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 144/307 variables, 163/388 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 6/394 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 5/399 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/307 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 6/313 variables, 6/405 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/313 variables, 6/411 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/313 variables, 2/413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
At refinement iteration 22 (INCLUDED_ONLY) 0/313 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD size :7.42683e+08 after 7.07444e+10
At refinement iteration 23 (OVERLAPS) 0/313 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 413 constraints, problems are : Problem set: 1 solved, 7 unsolved in 997 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 169/169 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1824ms problems are : Problem set: 1 solved, 7 unsolved
Parikh walk visited 1 properties in 3009 ms.
Support contains 12 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 144/144 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 169 transition count 143
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 152 transition count 106
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 152 transition count 106
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 152 transition count 96
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 152 transition count 93
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 149 transition count 93
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 145 transition count 89
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 145 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 145 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 143 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 143 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 142 transition count 86
Applied a total of 69 rules in 64 ms. Remains 142 /169 variables (removed 27) and now considering 86/144 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 142/169 places, 86/144 transitions.
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :5.18773e+11 after 5.3515e+11
RANDOM walk for 4000000 steps (199947 resets) in 13664 ms. (292 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (39160 resets) in 5696 ms. (702 steps per ms) remains 5/5 properties
Reachability property qltransition_98 is true.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5.3515e+11 after 5.7428e+11
BEST_FIRST walk for 4000003 steps (39205 resets) in 5890 ms. (679 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39205 resets) in 5771 ms. (693 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (39366 resets) in 5454 ms. (733 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39704 resets) in 6454 ms. (619 steps per ms) remains 5/5 properties
// Phase 1: matrix 86 rows 142 cols
[2024-05-21 13:19:23] [INFO ] Computed 62 invariants in 2 ms
[2024-05-21 13:19:23] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 75/93 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 45/138 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 86/224 variables, 138/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/228 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/228 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 210 constraints, problems are : Problem set: 0 solved, 5 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 75/93 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 45/138 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 86/224 variables, 138/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/228 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 215 constraints, problems are : Problem set: 0 solved, 5 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1572 ms.
Support contains 11 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 142/142 places, 86/86 transitions.
RANDOM walk for 4000000 steps (200718 resets) in 13880 ms. (288 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :8.39632e+11 after 1.69249e+12
BEST_FIRST walk for 4000003 steps (39190 resets) in 6161 ms. (649 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39183 resets) in 6229 ms. (642 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39325 resets) in 5924 ms. (675 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (39563 resets) in 6182 ms. (646 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (39634 resets) in 5757 ms. (694 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 76265 steps, run visited all 5 properties in 403 ms. (steps per millisecond=189 )
Probabilistic random walk after 76265 steps, saw 20105 distinct states, run finished after 412 ms. (steps per millisecond=185 ) properties seen :5
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 99 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 39614 ms.

BK_STOP 1716297582896

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="DES-PT-05b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is DES-PT-05b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-171624201900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;