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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 11 15:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 15:39 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 5.6K 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 1716637861212

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-D02N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-25 11:51:02] [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:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:51:02] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2024-05-25 11:51:02] [INFO ] Transformed 9 places.
[2024-05-25 11:51:02] [INFO ] Transformed 9 transitions.
[2024-05-25 11:51:02] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 119 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.18543KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 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 15 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-25 11:51:02] [INFO ] Computed 4 invariants in 4 ms
[2024-05-25 11:51:02] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 286ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 339 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 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 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-25 11:51:02] [INFO ] Invariant cache hit.
[2024-05-25 11:51:02] [INFO ] Implicit Places using invariants in 45 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 6/9 places, 9/9 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 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 53 ms. Remains : 6/9 places, 9/9 transitions.
Random walk for 1250037 steps, including 0 resets, run took 205 ms (no deadlock found). (steps per millisecond=6097 )
Random directed walk for 1250064 steps, including 0 resets, run took 140 ms (no deadlock found). (steps per millisecond=8929 )
// Phase 1: matrix 9 rows 6 cols
[2024-05-25 11:51:03] [INFO ] Computed 1 invariants in 2 ms
[2024-05-25 11:51:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:51:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 11:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 11:51:03] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:51:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:51:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 11:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 11:51:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:51:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 6 ms to minimize.
[2024-05-25 11:51:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-25 11:51:03] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 11:51:03] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Parikh directed walk for 15600 steps, including 299 resets, run took 19 ms. (steps per millisecond=821 )
Random directed walk for 500039 steps, including 0 resets, run took 45 ms (no deadlock found). (steps per millisecond=11111 )
Random walk for 500096 steps, including 0 resets, run took 48 ms (no deadlock found). (steps per millisecond=10418 )
Random directed walk for 500091 steps, including 0 resets, run took 52 ms (no deadlock found). (steps per millisecond=9617 )
Random walk for 500080 steps, including 0 resets, run took 53 ms (no deadlock found). (steps per millisecond=9435 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 6/6 places, 9/9 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 0 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-25 11:51:03] [INFO ] Invariant cache hit.
[2024-05-25 11:51:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 11:51:03] [INFO ] Invariant cache hit.
[2024-05-25 11:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 11:51:03] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 11:51:03] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 11:51:03] [INFO ] Invariant cache hit.
[2024-05-25 11:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 13 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 135 ms. Remains : 6/6 places, 9/9 transitions.
Random walk for 1250008 steps, including 0 resets, run took 125 ms (no deadlock found). (steps per millisecond=10000 )
Random directed walk for 1250100 steps, including 0 resets, run took 120 ms (no deadlock found). (steps per millisecond=10417 )
[2024-05-25 11:51:03] [INFO ] Invariant cache hit.
[2024-05-25 11:51:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:51:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 11:51:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 11:51:03] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:51:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:51:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 11:51:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 11:51:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-25 11:51:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-25 11:51:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-25 11:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-25 11:51:04] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 11:51:04] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Parikh directed walk for 15600 steps, including 328 resets, run took 20 ms. (steps per millisecond=780 )
Random directed walk for 500087 steps, including 0 resets, run took 50 ms (no deadlock found). (steps per millisecond=10001 )
Random walk for 500016 steps, including 0 resets, run took 54 ms (no deadlock found). (steps per millisecond=9259 )
Random directed walk for 500022 steps, including 0 resets, run took 52 ms (no deadlock found). (steps per millisecond=9615 )
Random walk for 500069 steps, including 0 resets, run took 48 ms (no deadlock found). (steps per millisecond=10418 )
[2024-05-25 11:51:04] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7141865087524420223
[2024-05-25 11:51:04] [INFO ] Applying decomposition
[2024-05-25 11:51:04] [INFO ] Flatten gal took : 2 ms
[2024-05-25 11:51:04] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-25 11:51:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:51:04] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-25 11:51:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:51:04] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-25 11:51:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 11:51:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7141865087524420223
Running compilation step : cd /tmp/ltsmin7141865087524420223;'/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/graph14241004942033173267.txt' '-o' '/tmp/graph14241004942033173267.bin' '-w' '/tmp/graph14241004942033173267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14241004942033173267.bin' '-l' '-1' '-v' '-w' '/tmp/graph14241004942033173267.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:51:04] [INFO ] Decomposing Gal with order
[2024-05-25 11:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:51:04] [INFO ] Flatten gal took : 32 ms
[2024-05-25 11:51:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 11:51:04] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock3130196707496379931.gal : 1 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/ReachabilityDeadlock3130196707496379931.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 -...234
No direction supplied, using forward translation only.
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin7141865087524420223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7141865087524420223;'/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( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: 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( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Initializing POR dependencies: labels 9, guards 9
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( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: There are 9 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.010: State length is 9, there are 9 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 / 9, labels: 0 / 9
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.019: ~5 levels ~960 states ~3600 transitions
pins2lts-mc-linux64( 0/ 8), 0.025: ~6 levels ~1920 states ~6704 transitions
pins2lts-mc-linux64( 0/ 8), 0.035: ~7 levels ~3840 states ~13104 transitions
pins2lts-mc-linux64( 0/ 8), 0.070: ~9 levels ~7680 states ~25536 transitions
pins2lts-mc-linux64( 0/ 8), 0.121: ~11 levels ~15360 states ~49800 transitions
pins2lts-mc-linux64( 0/ 8), 0.245: ~14 levels ~30720 states ~96888 transitions
pins2lts-mc-linux64( 0/ 8), 0.453: ~17 levels ~61440 states ~190248 transitions
pins2lts-mc-linux64( 0/ 8), 0.775: ~22 levels ~122880 states ~375520 transitions
pins2lts-mc-linux64( 0/ 8), 1.107: ~28 levels ~245760 states ~745408 transitions
pins2lts-mc-linux64( 0/ 8), 1.713: ~34 levels ~491520 states ~1486936 transitions
pins2lts-mc-linux64( 1/ 8), 2.318: ~31 levels ~983040 states ~2964136 transitions
pins2lts-mc-linux64( 1/ 8), 3.195: ~38 levels ~1966080 states ~5919792 transitions
pins2lts-mc-linux64( 7/ 8), 4.802: ~59 levels ~3932160 states ~11818400 transitions
pins2lts-mc-linux64( 6/ 8), 7.963: ~60 levels ~7864320 states ~23637480 transitions
pins2lts-mc-linux64( 5/ 8), 14.417: ~80 levels ~15728640 states ~47208112 transitions
pins2lts-mc-linux64( 5/ 8), 27.385: ~94 levels ~31457280 states ~94405560 transitions
pins2lts-mc-linux64( 5/ 8), 53.545: ~108 levels ~62914560 states ~188790944 transitions
pins2lts-mc-linux64( 3/ 8), 108.924: ~115 levels ~125829120 states ~377598096 transitions
pins2lts-mc-linux64( 1/ 8), 123.879: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 123.907:
pins2lts-mc-linux64( 0/ 8), 123.907: mean standard work distribution: 1.0% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 123.907:
pins2lts-mc-linux64( 0/ 8), 123.907: Explored 129437136 states 388447087 transitions, fanout: 3.001
pins2lts-mc-linux64( 0/ 8), 123.907: Total exploration time 123.890 sec (123.870 sec minimum, 123.878 sec on average)
pins2lts-mc-linux64( 0/ 8), 123.907: States per second: 1044775, Transitions per second: 3135419
pins2lts-mc-linux64( 0/ 8), 123.907:
pins2lts-mc-linux64( 0/ 8), 123.907: Queue width: 8B, total height: 4782902, memory: 36.49MB
pins2lts-mc-linux64( 0/ 8), 123.907: Tree memory: 1185.4MB, 9.3 B/state, compr.: 24.4%
pins2lts-mc-linux64( 0/ 8), 123.907: Tree fill ratio (roots/leafs): 99.0%/63.0%
pins2lts-mc-linux64( 0/ 8), 123.907: Stored 9 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 123.907: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 123.907: Est. total memory use: 1221.9MB (~1060.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7141865087524420223;'/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/ltsmin7141865087524420223;'/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,5.58817e+09,452.879,1512292,1639,23995,268316,294069,26,713178,23,1.99928e+06,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,0,525.053,2561572,1,0,268316,4.0338e+06,51,713178,987,1.21342e+07,8945

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
Total runtime 596613 ms.

BK_STOP 1716638459001

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

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