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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 51K 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 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 17K Apr 11 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 20:12 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 247K 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 1716403445333

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-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-22 18:44:06] [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:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:44:06] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-22 18:44:06] [INFO ] Transformed 100 places.
[2024-05-22 18:44:06] [INFO ] Transformed 440 transitions.
[2024-05-22 18:44:06] [INFO ] Found NUPN structural information;
[2024-05-22 18:44:06] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 208 ms.
Built sparse matrix representations for Structural reductions in 7 ms.17041KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 100/100 places, 440/440 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 57 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 71 ms. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 100/100 places, 440/440 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 23 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 18:44:06] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-22 18:44:06] [INFO ] Computed 60 invariants in 12 ms
[2024-05-22 18:44:07] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 18:44:07] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 18:44:07] [INFO ] Invariant cache hit.
[2024-05-22 18:44:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 18:44:07] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-22 18:44:07] [INFO ] Redundant transitions in 21 ms returned []
Running 420 sub problems to find dead transitions.
[2024-05-22 18:44:07] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 18:44:07] [INFO ] Invariant cache hit.
[2024-05-22 18:44:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 9 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:44:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 6 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 6 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:44:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 8 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:44:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:44:12] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 20/100 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (OVERLAPS) 80/180 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 350 constraints, problems are : Problem set: 0 solved, 420 unsolved in 14286 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 70/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 20/100 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 80/180 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 420/770 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 770 constraints, problems are : Problem set: 0 solved, 420 unsolved in 11237 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 70/70 constraints]
After SMT, in 25844ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 25860ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 26266 ms. Remains : 100/100 places, 440/440 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4421 ms (no deadlock found). (steps per millisecond=282 )
Random directed walk for 1250017 steps, including 0 resets, run took 3977 ms (no deadlock found). (steps per millisecond=314 )
[2024-05-22 18:44:41] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 18:44:41] [INFO ] Invariant cache hit.
[2024-05-22 18:44:41] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2024-05-22 18:44:41] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 14 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 18:44:41] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 18:44:41] [INFO ] Invariant cache hit.
[2024-05-22 18:44:41] [INFO ] Implicit Places using invariants in 180 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 183 ms to find 20 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 80/100 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 192 ms. Remains : 80/100 places, 440/440 transitions.
Discarding 20 transitions out of 440. Remains 420
[2024-05-22 18:44:42] [INFO ] Flatten gal took : 154 ms
[2024-05-22 18:44:42] [INFO ] Flatten gal took : 107 ms
[2024-05-22 18:44:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14106746543055414518.gal : 33 ms
[2024-05-22 18:44:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10456248480591157102.prop : 6 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/ReachabilityCardinality14106746543055414518.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10456248480591157102.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...330
Loading property file /tmp/ReachabilityCardinality10456248480591157102.prop.
RANDOM walk for 40000 steps (8 resets) in 3186 ms. (12 steps per ms) remains 30/420 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 2/3 properties
BEST_FIRST walk for 2179 steps (4 resets) in 6 ms. (311 steps per ms) remains 0/2 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 420 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 18:44:42] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 18:44:42] [INFO ] Invariant cache hit.
[2024-05-22 18:44:43] [INFO ] Implicit Places using invariants in 196 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 198 ms to find 20 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 80/100 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 204 ms. Remains : 80/100 places, 440/440 transitions.
Discarding 20 transitions out of 440. Remains 420
Net is quasi-live, checking if it is reversible to establish liveness.
[2024-05-22 18:44:43] [INFO ] Flatten gal took : 33 ms
[2024-05-22 18:44:43] [INFO ] Flatten gal took : 29 ms
[2024-05-22 18:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6183934378268393341.gal : 6 ms
[2024-05-22 18:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability538266209776563627.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/CTLFireability6183934378268393341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability538266209776563627.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 -...282
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,1.15343e+07,0.101729,8376,2,252,5,7566,6,0,763,3181,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==...1262
=> 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_...1322
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...332
(forward)formula 0,1,0.347967,14648,1,0,910,71835,901,444,7064,42360,894
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 37201 ms.

BK_STOP 1716403483692

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

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