Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r217-smll-167840359100197.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is HealthRecord-PT-11, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217-smll-167840359100197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 18:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 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 1678626336838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-11
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 13:05:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-12 13:05:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:05:40] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-12 13:05:40] [INFO ] Transformed 159 places.
[2023-03-12 13:05:40] [INFO ] Transformed 334 transitions.
[2023-03-12 13:05:40] [INFO ] Found NUPN structural information;
[2023-03-12 13:05:40] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 204 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 159/159 places, 334/334 transitions.
Graph (trivial) has 270 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 0 with 126 rules applied. Total rules applied 127 place count 91 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 128 place count 91 transition count 238
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 1 with 54 rules applied. Total rules applied 182 place count 64 transition count 271
Applied a total of 182 rules in 54 ms. Remains 64 /159 variables (removed 95) and now considering 271/334 (removed 63) transitions.
[2023-03-12 13:05:40] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
// Phase 1: matrix 220 rows 64 cols
[2023-03-12 13:05:40] [INFO ] Computed 18 place invariants in 22 ms
[2023-03-12 13:05:40] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-12 13:05:40] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
[2023-03-12 13:05:40] [INFO ] Invariant cache hit.
[2023-03-12 13:05:40] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-12 13:05:40] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-12 13:05:40] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
[2023-03-12 13:05:40] [INFO ] Invariant cache hit.
[2023-03-12 13:05:41] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 64/159 places, 271/334 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 1084 ms. Remains : 64/159 places, 271/334 transitions.
Discarding 220 transitions out of 271. Remains 51
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1395 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 50) seen :20
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :3
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-12 13:05:42] [INFO ] Flow matrix only has 220 transitions (discarded 51 similar events)
[2023-03-12 13:05:42] [INFO ] Invariant cache hit.
[2023-03-12 13:05:42] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-12 13:05:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 13:05:43] [INFO ] After 503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13 real:11
[2023-03-12 13:05:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-12 13:05:43] [INFO ] After 163ms SMT Verify possible using 84 Read/Feed constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 13:05:43] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-12 13:05:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 13:05:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 13:05:43] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-12 13:05:44] [INFO ] After 371ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-12 13:05:44] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-03-12 13:05:45] [INFO ] After 1873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 37 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 271/271 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 64 transition count 253
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 58 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 58 transition count 223
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 48 place count 58 transition count 205
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 58 transition count 181
Applied a total of 72 rules in 43 ms. Remains 58 /64 variables (removed 6) and now considering 181/271 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 58/64 places, 181/271 transitions.
Incomplete random walk after 1000000 steps, including 121388 resets, run finished after 26364 ms. (steps per millisecond=37 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 1000001 steps, including 20951 resets, run finished after 4837 ms. (steps per millisecond=206 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 20892 resets, run finished after 3449 ms. (steps per millisecond=289 ) properties (out of 12) seen :0
Interrupted Best-First random walk after 884025 steps, including 22092 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 20550 resets, run finished after 3779 ms. (steps per millisecond=264 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 1000001 steps, including 19410 resets, run finished after 3285 ms. (steps per millisecond=304 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 13:06:31] [INFO ] Flow matrix only has 164 transitions (discarded 17 similar events)
// Phase 1: matrix 164 rows 58 cols
[2023-03-12 13:06:31] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-12 13:06:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:06:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 13:06:32] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-12 13:06:32] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-12 13:06:32] [INFO ] After 102ms SMT Verify possible using 69 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 13:06:32] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 13:06:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-12 13:06:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 13:06:32] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 13:06:32] [INFO ] After 57ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 13:06:32] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-12 13:06:32] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 14 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 181/181 transitions.
Graph (complete) has 329 edges and 58 vertex of which 49 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 45 transition count 168
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 45 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 45 transition count 167
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 43 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 43 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 41 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 41 transition count 141
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 30 place count 41 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 40 transition count 131
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 41 place count 40 transition count 131
Applied a total of 41 rules in 33 ms. Remains 40 /58 variables (removed 18) and now considering 131/181 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 40/58 places, 131/181 transitions.
Incomplete random walk after 1000000 steps, including 142824 resets, run finished after 15471 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22852 resets, run finished after 2945 ms. (steps per millisecond=339 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 22921 resets, run finished after 2958 ms. (steps per millisecond=338 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 26877 resets, run finished after 3316 ms. (steps per millisecond=301 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 14710 resets, run finished after 2193 ms. (steps per millisecond=455 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-12 13:06:59] [INFO ] Flow matrix only has 118 transitions (discarded 13 similar events)
// Phase 1: matrix 118 rows 40 cols
[2023-03-12 13:06:59] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 13:06:59] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 13:06:59] [INFO ] [Real]Absence check using 1 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 13:06:59] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 13:06:59] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-12 13:06:59] [INFO ] After 22ms SMT Verify possible using 48 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:06:59] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:06:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:06:59] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 13:06:59] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:06:59] [INFO ] After 31ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:06:59] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 13:06:59] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 131/131 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 39 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 38 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 38 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 37 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 37 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 13 place count 37 transition count 108
Applied a total of 13 rules in 18 ms. Remains 37 /40 variables (removed 3) and now considering 108/131 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 37/40 places, 108/131 transitions.
Incomplete random walk after 1000000 steps, including 142927 resets, run finished after 11222 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 22958 resets, run finished after 2002 ms. (steps per millisecond=499 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 22932 resets, run finished after 2049 ms. (steps per millisecond=488 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 26794 resets, run finished after 2365 ms. (steps per millisecond=422 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1862 steps, run visited all 3 properties in 33 ms. (steps per millisecond=56 )
Probabilistic random walk after 1862 steps, saw 739 distinct states, run finished after 33 ms. (steps per millisecond=56 ) properties seen :3
Able to resolve query QuasiLiveness after proving 51 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 97685 ms.
ITS solved all properties within timeout

BK_STOP 1678626438539

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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="HealthRecord-PT-11"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is HealthRecord-PT-11, 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 r217-smll-167840359100197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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