Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876820000456.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
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 r147-tall-174876820000456
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 9.3K May 29 14:32 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 1748815603256

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 202505121319
[2025-06-01 22:06:44] [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]
[2025-06-01 22:06:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:06:44] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2025-06-01 22:06:44] [INFO ] Transformed 15 places.
[2025-06-01 22:06:44] [INFO ] Transformed 15 transitions.
[2025-06-01 22:06:44] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 111 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.13870KB 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 10 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
[2025-06-01 22:06:44] [INFO ] Computed 6 invariants in 4 ms
[2025-06-01 22:06:44] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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 285 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
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 267 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 596ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 643 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 3 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-01 22:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:45] [INFO ] Implicit Places using invariants in 51 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 59 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 64 ms. Remains : 10/15 places, 15/15 transitions.
Random walk for 1250023 steps, including 0 resets, run took 360 ms (no deadlock found). (steps per millisecond=3472 )
Random directed walk for 1250002 steps, including 0 resets, run took 215 ms (no deadlock found). (steps per millisecond=5813 )
// Phase 1: matrix 15 rows 10 cols
[2025-06-01 22:06:45] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 22:06:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:06:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 22:06:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 22:06:45] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-01 22:06:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 22:06:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:06:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 22:06:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 22:06:46] [INFO ] [Nat]Added 5 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:06:46] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 6 ms to minimize.
[2025-06-01 22:06:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2025-06-01 22:06:46] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 22:06:46] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Parikh directed walk for 4800 steps, including 225 resets, run took 23 ms. (steps per millisecond=208 )
Random directed walk for 500024 steps, including 0 resets, run took 83 ms (no deadlock found). (steps per millisecond=6024 )
Random walk for 500000 steps, including 0 resets, run took 95 ms (no deadlock found). (steps per millisecond=5263 )
Random directed walk for 500043 steps, including 0 resets, run took 87 ms (no deadlock found). (steps per millisecond=5747 )
Random walk for 500005 steps, including 0 resets, run took 97 ms (no deadlock found). (steps per millisecond=5154 )
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 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-01 22:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 22:06:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:06:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 22:06:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:06:46] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-01 22:06:46] [INFO ] Invariant cache hit.
[2025-06-01 22:06:46] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 63 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 75 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 199 ms. Remains : 10/10 places, 15/15 transitions.
Random walk for 1250056 steps, including 0 resets, run took 191 ms (no deadlock found). (steps per millisecond=6544 )
Random directed walk for 1250016 steps, including 0 resets, run took 197 ms (no deadlock found). (steps per millisecond=6345 )
[2025-06-01 22:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 22:06:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:06:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 22:06:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 22:06:47] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-01 22:06:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 22:06:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 22:06:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 22:06:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 22:06:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 22:06:47] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 7 ms to minimize.
[2025-06-01 22:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-01 22:06:47] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 22:06:47] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Parikh directed walk for 4800 steps, including 230 resets, run took 7 ms. (steps per millisecond=685 )
Random directed walk for 500002 steps, including 0 resets, run took 84 ms (no deadlock found). (steps per millisecond=5952 )
Random walk for 500001 steps, including 0 resets, run took 76 ms (no deadlock found). (steps per millisecond=6578 )
Random directed walk for 500013 steps, including 0 resets, run took 83 ms (no deadlock found). (steps per millisecond=6024 )
Random walk for 500022 steps, including 0 resets, run took 84 ms (no deadlock found). (steps per millisecond=5952 )
[2025-06-01 22:06:47] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13508346393226050930
[2025-06-01 22:06:47] [INFO ] Applying decomposition
[2025-06-01 22:06:47] [INFO ] Flatten gal took : 3 ms
[2025-06-01 22:06:47] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2025-06-01 22:06:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:06:47] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2025-06-01 22:06:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:06:47] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2025-06-01 22:06:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 22:06:47] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13508346393226050930
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15910291576603075921.txt' '-o' '/tmp/graph15910291576603075921.bin' '-w' '/tmp/graph15910291576603075921.weights'
Running compilation step : cd /tmp/ltsmin13508346393226050930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15910291576603075921.bin' '-l' '-1' '-v' '-w' '/tmp/graph15910291576603075921.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:06:47] [INFO ] Decomposing Gal with order
[2025-06-01 22:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:06:47] [INFO ] Flatten gal took : 55 ms
[2025-06-01 22:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 22:06:47] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock16990295029315776985.gal : 4 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock16990295029315776985.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.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...235
No direction supplied, using forward translation only.
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin13508346393226050930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13508346393226050930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 15, guards 15
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.034: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.034: State length is 15, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.034: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.034: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.034: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.034: Visible groups: 0 / 15, labels: 0 / 15
pins2lts-mc-linux64( 0/ 8), 0.034: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.034: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.576: ~3 levels ~960 states ~5472 transitions
pins2lts-mc-linux64( 1/ 8), 0.623: ~4 levels ~1920 states ~9240 transitions
pins2lts-mc-linux64( 4/ 8), 0.847: ~5 levels ~3840 states ~15360 transitions
pins2lts-mc-linux64( 2/ 8), 1.007: ~6 levels ~7680 states ~30640 transitions
pins2lts-mc-linux64( 6/ 8), 1.228: ~7 levels ~15360 states ~61040 transitions
pins2lts-mc-linux64( 7/ 8), 1.570: ~7 levels ~30720 states ~115824 transitions
pins2lts-mc-linux64( 7/ 8), 2.898: ~8 levels ~61440 states ~220280 transitions
pins2lts-mc-linux64( 7/ 8), 6.590: ~10 levels ~122880 states ~445648 transitions
pins2lts-mc-linux64( 7/ 8), 9.331: ~11 levels ~245760 states ~867624 transitions
pins2lts-mc-linux64( 7/ 8), 9.999: ~13 levels ~491520 states ~1679912 transitions
pins2lts-mc-linux64( 7/ 8), 11.222: ~15 levels ~983040 states ~3291664 transitions
pins2lts-mc-linux64( 1/ 8), 14.041: ~18 levels ~1966080 states ~6796096 transitions
pins2lts-mc-linux64( 5/ 8), 17.171: ~20 levels ~3932160 states ~12841896 transitions
pins2lts-mc-linux64( 6/ 8), 23.883: ~23 levels ~7864320 states ~25699328 transitions
pins2lts-mc-linux64( 4/ 8), 36.098: ~26 levels ~15728640 states ~49871936 transitions
pins2lts-mc-linux64( 4/ 8), 62.696: ~29 levels ~31457280 states ~98655336 transitions
pins2lts-mc-linux64( 3/ 8), 85.338: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 85.410:
pins2lts-mc-linux64( 0/ 8), 85.410: mean standard work distribution: 1.8% (states) 1.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 85.410:
pins2lts-mc-linux64( 0/ 8), 85.410: Explored 44022070 states 138041486 transitions, fanout: 3.136
pins2lts-mc-linux64( 0/ 8), 85.410: Total exploration time 85.370 sec (85.300 sec minimum, 85.332 sec on average)
pins2lts-mc-linux64( 0/ 8), 85.411: States per second: 515662, Transitions per second: 1616979
pins2lts-mc-linux64( 0/ 8), 85.411:
pins2lts-mc-linux64( 0/ 8), 85.411: Queue width: 8B, total height: 9602050, memory: 73.26MB
pins2lts-mc-linux64( 0/ 8), 85.411: Tree memory: 665.1MB, 13.0 B/state, compr.: 21.0%
pins2lts-mc-linux64( 0/ 8), 85.411: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 85.411: Stored 15 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 85.411: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 85.411: Est. total memory use: 738.4MB (~1097.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13508346393226050930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13508346393226050930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
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,131.154,768668,1088,4803,778637,66639,38,438617,25,363659,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,141.033,773424,456,134,778637,587115,81,438617,484,1.73595e+06,8517

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=48 ]
} u1={[ p1_4=48 ]
} u2={[ p1_1=30 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=48 ]
} u2={[ p2_1=2 p0_1=2 ]
} u3={[ p1_3=30 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=48 ]
} u2={[ p2_1=2 p0_1=2 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p1_2=30 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=22 ]
} u2={[ p1_1=56 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=22 ]
} u2={[ p2_1=2 p0_1=2 ]
} u3={[ p1_3=56 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=22 ]
} u2={[ p2_1=2 p0_1=2 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p1_2=56 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=16 ]
} u2={[ p1_1=62 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=16 ]
} u2={[ p2_1=2 p0_1=2 ]
} u3={[ p1_3=62 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=16 ]
} u2={[ p2_1=2 p0_1=2 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p1_2=62 ]
} ]
[ u4={[ p1_5=48 ]
} u1={[ p1_4=10 ]
} u2={[ p1_1=68 ]
} u3={[ p2_3=2 p0_3=2 ]
} u0={[ p2_2=2 p0_2=2 ]
} ]
Total runtime 192872 ms.

BK_STOP 1748815797397

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r147-tall-174876820000456"
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.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 ;