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.r145-tall-171631144400059.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 Dekker-PT-015, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r145-tall-171631144400059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 11 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 Liveness

=== Now, execution of the tool begins

BK_START 1716403400245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-015
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-22 18:43:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-22 18:43:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:43:21] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 18:43:21] [INFO ] Transformed 75 places.
[2024-05-22 18:43:21] [INFO ] Transformed 255 transitions.
[2024-05-22 18:43:21] [INFO ] Found NUPN structural information;
[2024-05-22 18:43:21] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 177 ms.
Built sparse matrix representations for Structural reductions in 6 ms.20709KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 75/75 places, 255/255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 41 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 52 ms. Remains : 75/75 places, 255/255 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 75/75 places, 255/255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 20 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 18:43:21] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2024-05-22 18:43:21] [INFO ] Computed 45 invariants in 10 ms
[2024-05-22 18:43:21] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 18:43:21] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 18:43:21] [INFO ] Invariant cache hit.
[2024-05-22 18:43:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-22 18:43:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-22 18:43:22] [INFO ] Redundant transitions in 9 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-22 18:43:22] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 18:43:22] [INFO ] Invariant cache hit.
[2024-05-22 18:43:22] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-22 18:43:22] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 16 ms to minimize.
[2024-05-22 18:43:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:43:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:43:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:43:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:43:23] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 5 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:43:24] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 15/75 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 60/135 variables, 75/233 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 248 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6993 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 15/75 variables, 15/143 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 60/135 variables, 75/233 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 240/488 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 488 constraints, problems are : Problem set: 0 solved, 240 unsolved in 4603 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 75/75 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
After SMT, in 11772ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 11787ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 12142 ms. Remains : 75/75 places, 255/255 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3596 ms (no deadlock found). (steps per millisecond=347 )
Random directed walk for 1250015 steps, including 0 resets, run took 2979 ms (no deadlock found). (steps per millisecond=419 )
[2024-05-22 18:43:40] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 18:43:40] [INFO ] Invariant cache hit.
[2024-05-22 18:43:40] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2024-05-22 18:43:40] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 18:43:40] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 18:43:40] [INFO ] Invariant cache hit.
[2024-05-22 18:43:40] [INFO ] Implicit Places using invariants in 122 ms returned [30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 129 ms to find 15 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 60/75 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 133 ms. Remains : 60/75 places, 255/255 transitions.
Discarding 15 transitions out of 255. Remains 240
RANDOM walk for 40000 steps (8 resets) in 1493 ms. (26 steps per ms) remains 17/240 properties
[2024-05-22 18:43:41] [INFO ] Flatten gal took : 80 ms
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 14/16 properties
[2024-05-22 18:43:41] [INFO ] Flatten gal took : 33 ms
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 11/12 properties
[2024-05-22 18:43:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4911981598898353316.gal : 13 ms
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 10/11 properties
[2024-05-22 18:43:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3599335184295640067.prop : 1 ms
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 9/10 properties
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/ReachabilityCardinality4911981598898353316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3599335184295640067.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 6/8 properties

BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 1/3 properties
BEST_FIRST walk for 128 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 240 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 18:43:41] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 18:43:41] [INFO ] Invariant cache hit.
[2024-05-22 18:43:41] [INFO ] Implicit Places using invariants in 117 ms returned [30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 119 ms to find 15 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 60/75 places, 255/255 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 123 ms. Remains : 60/75 places, 255/255 transitions.
Discarding 15 transitions out of 255. Remains 240
Net is quasi-live, checking if it is reversible to establish liveness.
[2024-05-22 18:43:41] [INFO ] Flatten gal took : 19 ms
[2024-05-22 18:43:41] [INFO ] Flatten gal took : 18 ms
[2024-05-22 18:43:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3214067499560995415.gal : 4 ms
[2024-05-22 18:43:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14868038724316560508.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3214067499560995415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14868038724316560508.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,278528,0.053377,6176,2,187,5,4281,6,0,498,2016,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((flag_0_0==1)&&(flag_1_0==0))&&((flag_0_1==1)&&(flag_1_1==0)))&&(((flag_0_2==1)&&(flag_1_2==0))&&((flag_0_3==1)&&(flag_1_3==0...942
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((flag_0_0==1)&&(flag_1_0==0))&&((flag_0_1==1)&&(flag_1_1==0)))&&(((flag_0_2...1002
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_1, exit_2, exit_3, exit_4, exit_5, exit_6, exit_7, exit_8, exit_9, exit_10, exit...287
(forward)formula 0,1,0.165308,8832,1,0,535,32250,531,259,4400,20925,524
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 1 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS BESTFIRST_WALK TOPOLOGICAL QUASI_LIVE_REVERSIBLE
Total runtime 20317 ms.

BK_STOP 1716403421690

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="Dekker-PT-015"
export BK_EXAMINATION="Liveness"
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 Dekker-PT-015, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r145-tall-171631144400059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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