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.r255-tall-171654365400481.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 PGCD-PT-D04N025, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-171654365400481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.5K Apr 11 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 15:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 9.3K May 18 16:43 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716638141195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-PT-D04N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-25 11:55:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-25 11:55:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:55:42] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-05-25 11:55:42] [INFO ] Transformed 15 places.
[2024-05-25 11:55:42] [INFO ] Transformed 15 transitions.
[2024-05-25 11:55:42] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 127 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.18809KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 15/15 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 16 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 15 cols
[2024-05-25 11:55:42] [INFO ] Computed 6 invariants in 3 ms
[2024-05-25 11:55:42] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 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/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 323ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 381 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 15/15 places, 15/15 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 2 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-25 11:55:42] [INFO ] Invariant cache hit.
[2024-05-25 11:55:42] [INFO ] Implicit Places using invariants in 50 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 57 ms to find 5 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 10/15 places, 15/15 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 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 60 ms. Remains : 10/15 places, 15/15 transitions.
Random walk for 1250004 steps, including 0 resets, run took 373 ms (no deadlock found). (steps per millisecond=3351 )
Random directed walk for 1250016 steps, including 0 resets, run took 181 ms (no deadlock found). (steps per millisecond=6906 )
// Phase 1: matrix 15 rows 10 cols
[2024-05-25 11:55:43] [INFO ] Computed 1 invariants in 4 ms
[2024-05-25 11:55:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:55:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 11:55:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:55:43] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-05-25 11:55:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:55:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:55:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 11:55:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:55:43] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-05-25 11:55:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 6 ms to minimize.
[2024-05-25 11:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-25 11:55:43] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 11:55:43] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Parikh directed walk for 5200 steps, including 125 resets, run took 9 ms. (steps per millisecond=577 )
Random directed walk for 500018 steps, including 0 resets, run took 77 ms (no deadlock found). (steps per millisecond=6493 )
Random walk for 500017 steps, including 0 resets, run took 72 ms (no deadlock found). (steps per millisecond=6944 )
Random directed walk for 500013 steps, including 0 resets, run took 66 ms (no deadlock found). (steps per millisecond=7575 )
Random walk for 500020 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6757 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 10/10 places, 15/15 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 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2024-05-25 11:55:43] [INFO ] Invariant cache hit.
[2024-05-25 11:55:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 11:55:43] [INFO ] Invariant cache hit.
[2024-05-25 11:55:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:55:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 11:55:43] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-25 11:55:43] [INFO ] Invariant cache hit.
[2024-05-25 11:55:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 227 ms. Remains : 10/10 places, 15/15 transitions.
Random walk for 1250015 steps, including 0 resets, run took 177 ms (no deadlock found). (steps per millisecond=7062 )
Random directed walk for 1250017 steps, including 0 resets, run took 177 ms (no deadlock found). (steps per millisecond=7062 )
[2024-05-25 11:55:44] [INFO ] Invariant cache hit.
[2024-05-25 11:55:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:55:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 11:55:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:55:44] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-05-25 11:55:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:55:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:55:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 11:55:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 11:55:44] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-05-25 11:55:44] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-25 11:55:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2024-05-25 11:55:44] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 11:55:44] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Parikh directed walk for 5200 steps, including 121 resets, run took 7 ms. (steps per millisecond=742 )
Random directed walk for 500012 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
Random walk for 500035 steps, including 0 resets, run took 68 ms (no deadlock found). (steps per millisecond=7353 )
Random directed walk for 500030 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
Random walk for 500035 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
[2024-05-25 11:55:45] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14725349094238568647
[2024-05-25 11:55:45] [INFO ] Applying decomposition
[2024-05-25 11:55:45] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2024-05-25 11:55:45] [INFO ] Flatten gal took : 8 ms
[2024-05-25 11:55:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:55:45] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2024-05-25 11:55:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:55:45] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2024-05-25 11:55:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:55:45] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14725349094238568647
Running compilation step : cd /tmp/ltsmin14725349094238568647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5830781858087341669.txt' '-o' '/tmp/graph5830781858087341669.bin' '-w' '/tmp/graph5830781858087341669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5830781858087341669.bin' '-l' '-1' '-v' '-w' '/tmp/graph5830781858087341669.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:55:45] [INFO ] Decomposing Gal with order
[2024-05-25 11:55:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:55:45] [INFO ] Flatten gal took : 34 ms
[2024-05-25 11:55:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 11:55:45] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock15792486852849887491.gal : 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/ReachabilityDeadlock15792486852849887491.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

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 -...235
No direction supplied, using forward translation only.
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin14725349094238568647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14725349094238568647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 15, guards 15
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.010: State length is 15, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.010: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.010: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.010: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.010: Visible groups: 0 / 15, labels: 0 / 15
pins2lts-mc-linux64( 0/ 8), 0.010: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.010: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.051: ~4 levels ~960 states ~5912 transitions
pins2lts-mc-linux64( 0/ 8), 0.075: ~4 levels ~1920 states ~12000 transitions
pins2lts-mc-linux64( 0/ 8), 0.122: ~6 levels ~3840 states ~21232 transitions
pins2lts-mc-linux64( 0/ 8), 0.184: ~7 levels ~7680 states ~38320 transitions
pins2lts-mc-linux64( 0/ 8), 0.287: ~8 levels ~15360 states ~68720 transitions
pins2lts-mc-linux64( 1/ 8), 0.455: ~4 levels ~30720 states ~111328 transitions
pins2lts-mc-linux64( 5/ 8), 0.746: ~7 levels ~61440 states ~226840 transitions
pins2lts-mc-linux64( 5/ 8), 1.124: ~8 levels ~122880 states ~441856 transitions
pins2lts-mc-linux64( 5/ 8), 1.657: ~10 levels ~245760 states ~860560 transitions
pins2lts-mc-linux64( 5/ 8), 2.223: ~11 levels ~491520 states ~1676136 transitions
pins2lts-mc-linux64( 5/ 8), 2.997: ~13 levels ~983040 states ~3281104 transitions
pins2lts-mc-linux64( 4/ 8), 4.229: ~16 levels ~1966080 states ~6305952 transitions
pins2lts-mc-linux64( 5/ 8), 6.718: ~18 levels ~3932160 states ~12735136 transitions
pins2lts-mc-linux64( 5/ 8), 11.522: ~20 levels ~7864320 states ~25204272 transitions
pins2lts-mc-linux64( 5/ 8), 21.379: ~23 levels ~15728640 states ~50010216 transitions
pins2lts-mc-linux64( 5/ 8), 40.992: ~26 levels ~31457280 states ~99051920 transitions
pins2lts-mc-linux64( 2/ 8), 60.551: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 60.582:
pins2lts-mc-linux64( 0/ 8), 60.582: mean standard work distribution: 2.2% (states) 2.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 60.582:
pins2lts-mc-linux64( 0/ 8), 60.582: Explored 44059231 states 138036208 transitions, fanout: 3.133
pins2lts-mc-linux64( 0/ 8), 60.582: Total exploration time 60.570 sec (60.540 sec minimum, 60.554 sec on average)
pins2lts-mc-linux64( 0/ 8), 60.582: States per second: 727410, Transitions per second: 2278954
pins2lts-mc-linux64( 0/ 8), 60.582:
pins2lts-mc-linux64( 0/ 8), 60.582: Queue width: 8B, total height: 9566774, memory: 72.99MB
pins2lts-mc-linux64( 0/ 8), 60.582: Tree memory: 665.1MB, 13.0 B/state, compr.: 21.0%
pins2lts-mc-linux64( 0/ 8), 60.582: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 60.582: Stored 15 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 60.582: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 60.582: Est. total memory use: 738.1MB (~1097.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14725349094238568647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14725349094238568647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
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,2.57364e+12,121.81,766452,1088,4803,713357,42093,36,304147,23,193588,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,21435,130.67,771244,456,134,713357,597619,75,304147,474,1.70028e+06,7943

System contains 21435 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 21435 states ] showing 10 first states
[ u4={[ p1_5=34 ]
} u3={[ p1_4=34 ]
} u2={[ p1_3=58 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ p1_4=34 ]
} u2={[ p2_3=2 p0_3=2 ]
} u1={[ p1_2=58 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ p1_4=34 ]
} u2={[ p2_3=2 p0_3=2 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p1_1=58 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ p1_4=50 ]
} u2={[ p1_3=42 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ p1_4=50 ]
} u2={[ p2_3=2 p0_3=2 ]
} u1={[ p1_2=42 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ p1_4=50 ]
} u2={[ p2_3=2 p0_3=2 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p1_1=42 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ ]
} u2={[ p1_3=92 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ ]
} u2={[ p2_3=2 p0_3=2 ]
} u1={[ p1_2=92 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ ]
} u2={[ p2_3=2 p0_3=2 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p1_1=92 ]
} ]
[ u4={[ p1_5=34 ]
} u3={[ p1_4=22 ]
} u2={[ p1_3=70 ]
} u1={[ p2_2=2 p0_2=2 ]
} u0={[ p2_1=2 p0_1=2 ]
} ]
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 167409 ms.

BK_STOP 1716638309714

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -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 ReachabilityDeadlock -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="PGCD-PT-D04N025"
export BK_EXAMINATION="ReachabilityDeadlock"
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 PGCD-PT-D04N025, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r255-tall-171654365400481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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