Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r531-tall-167987252500286.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PGCD-PT-D03N050, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r531-tall-167987252500286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.4K Mar 31 16:48 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 1680812103834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-D03N050
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2023-04-06 20:15:05] [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]
[2023-04-06 20:15:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:15:05] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-06 20:15:05] [INFO ] Transformed 12 places.
[2023-04-06 20:15:05] [INFO ] Transformed 12 transitions.
[2023-04-06 20:15:05] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 83 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 3 ms.24169KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 14 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-06 20:15:05] [INFO ] Computed 5 invariants in 5 ms
[2023-04-06 20:15:05] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 189 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 20:15:05] [INFO ] Invariant cache hit.
[2023-04-06 20:15:05] [INFO ] Implicit Places using invariants in 50 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 8/12 places, 12/12 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 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 56 ms. Remains : 8/12 places, 12/12 transitions.
Random walk for 1250049 steps, including 0 resets, run took 235 ms (no deadlock found). (steps per millisecond=5319 )
Random directed walk for 1250037 steps, including 0 resets, run took 176 ms (no deadlock found). (steps per millisecond=7102 )
// Phase 1: matrix 12 rows 8 cols
[2023-04-06 20:15:06] [INFO ] Computed 1 invariants in 5 ms
[2023-04-06 20:15:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 20:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:15:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-04-06 20:15:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 20:15:06] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-04-06 20:15:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:15:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 20:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:15:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-06 20:15:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 20:15:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-04-06 20:15:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 3 ms to minimize.
[2023-04-06 20:15:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-06 20:15:06] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-06 20:15:06] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 8500 steps, including 190 resets, run took 13 ms. (steps per millisecond=653 )
Random directed walk for 500049 steps, including 0 resets, run took 63 ms (no deadlock found). (steps per millisecond=7937 )
Random walk for 500009 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6756 )
Random directed walk for 500040 steps, including 0 resets, run took 73 ms (no deadlock found). (steps per millisecond=6849 )
Random walk for 500018 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 8/8 places, 12/12 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 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 20:15:06] [INFO ] Invariant cache hit.
[2023-04-06 20:15:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-06 20:15:06] [INFO ] Invariant cache hit.
[2023-04-06 20:15:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 20:15:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-06 20:15:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-06 20:15:06] [INFO ] Invariant cache hit.
[2023-04-06 20:15:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 86 ms. Remains : 8/8 places, 12/12 transitions.
Random walk for 1250000 steps, including 0 resets, run took 156 ms (no deadlock found). (steps per millisecond=8012 )
Random directed walk for 1250011 steps, including 0 resets, run took 152 ms (no deadlock found). (steps per millisecond=8223 )
[2023-04-06 20:15:06] [INFO ] Invariant cache hit.
[2023-04-06 20:15:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 20:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 20:15:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-04-06 20:15:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 20:15:07] [INFO ] [Real]Added 4 Read/Feed constraints in 6 ms returned sat
[2023-04-06 20:15:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 20:15:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 20:15:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 20:15:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-06 20:15:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 20:15:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-06 20:15:07] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2023-04-06 20:15:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-06 20:15:07] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-06 20:15:07] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 8500 steps, including 192 resets, run took 11 ms. (steps per millisecond=772 )
Random directed walk for 500061 steps, including 0 resets, run took 58 ms (no deadlock found). (steps per millisecond=8621 )
Random walk for 500049 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6757 )
Random directed walk for 500020 steps, including 0 resets, run took 73 ms (no deadlock found). (steps per millisecond=6849 )
Random walk for 500010 steps, including 0 resets, run took 66 ms (no deadlock found). (steps per millisecond=7575 )
[2023-04-06 20:15:07] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14524408479721330129
[2023-04-06 20:15:07] [INFO ] Applying decomposition
[2023-04-06 20:15:07] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2023-04-06 20:15:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 20:15:07] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2023-04-06 20:15:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 20:15:07] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2023-04-06 20:15:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 20:15:07] [INFO ] Flatten gal took : 4 ms
[2023-04-06 20:15:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14524408479721330129
Running compilation step : cd /tmp/ltsmin14524408479721330129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.202304061127/bin/convert-linux64' '-i' '/tmp/graph1491036588308624544.txt' '-o' '/tmp/graph1491036588308624544.bin' '-w' '/tmp/graph1491036588308624544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1491036588308624544.bin' '-l' '-1' '-v' '-w' '/tmp/graph1491036588308624544.weights' '-q' '0' '-e' '0.001'
[2023-04-06 20:15:07] [INFO ] Decomposing Gal with order
[2023-04-06 20:15:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 20:15:07] [INFO ] Flatten gal took : 35 ms
[2023-04-06 20:15:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-06 20:15:07] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock13908867588344411640.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.202304061127/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock13908867588344411640.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.202304061127/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...235
No direction supplied, using forward translation only.
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin14524408479721330129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14524408479721330129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 12, guards 12
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 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( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 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( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 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.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.017: State length is 12, there are 12 groups
pins2lts-mc-linux64( 0/ 8), 0.017: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.017: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.017: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.017: Visible groups: 0 / 12, labels: 0 / 12
pins2lts-mc-linux64( 0/ 8), 0.017: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.017: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.029: ~4 levels ~960 states ~4744 transitions
pins2lts-mc-linux64( 0/ 8), 0.170: ~6 levels ~1920 states ~8856 transitions
pins2lts-mc-linux64( 0/ 8), 0.211: ~8 levels ~3840 states ~16224 transitions
pins2lts-mc-linux64( 0/ 8), 0.265: ~9 levels ~7680 states ~29936 transitions
pins2lts-mc-linux64( 0/ 8), 0.346: ~10 levels ~15360 states ~56176 transitions
pins2lts-mc-linux64( 3/ 8), 0.515: ~8 levels ~30720 states ~99952 transitions
pins2lts-mc-linux64( 0/ 8), 0.768: ~14 levels ~61440 states ~205848 transitions
pins2lts-mc-linux64( 4/ 8), 1.119: ~12 levels ~122880 states ~401456 transitions
pins2lts-mc-linux64( 7/ 8), 1.588: ~16 levels ~245760 states ~801728 transitions
pins2lts-mc-linux64( 7/ 8), 3.026: ~19 levels ~491520 states ~1577952 transitions
pins2lts-mc-linux64( 1/ 8), 3.968: ~19 levels ~983040 states ~3085640 transitions
pins2lts-mc-linux64( 4/ 8), 5.044: ~24 levels ~1966080 states ~6049848 transitions
pins2lts-mc-linux64( 4/ 8), 6.941: ~28 levels ~3932160 states ~12062120 transitions
pins2lts-mc-linux64( 1/ 8), 11.626: ~31 levels ~7864320 states ~23837400 transitions
pins2lts-mc-linux64( 1/ 8), 20.000: ~37 levels ~15728640 states ~47504448 transitions
pins2lts-mc-linux64( 7/ 8), 37.593: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 37.643:
pins2lts-mc-linux64( 0/ 8), 37.643: mean standard work distribution: 2.4% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 37.643:
pins2lts-mc-linux64( 0/ 8), 37.643: Explored 28236351 states 85641913 transitions, fanout: 3.033
pins2lts-mc-linux64( 0/ 8), 37.643: Total exploration time 37.620 sec (37.580 sec minimum, 37.596 sec on average)
pins2lts-mc-linux64( 0/ 8), 37.643: States per second: 750568, Transitions per second: 2276500
pins2lts-mc-linux64( 0/ 8), 37.643:
pins2lts-mc-linux64( 0/ 8), 37.643: Queue width: 8B, total height: 3533318, memory: 26.96MB
pins2lts-mc-linux64( 0/ 8), 37.644: Tree memory: 498.4MB, 16.4 B/state, compr.: 32.9%
pins2lts-mc-linux64( 0/ 8), 37.644: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 37.644: Stored 12 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 37.644: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 37.644: Est. total memory use: 525.3MB (~1051.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14524408479721330129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14524408479721330129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
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,4.17215e+11,331.677,1329364,1386,10995,948228,98675,32,399738,24,573927,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,354.802,1338164,1,0,948228,1.3138e+06,67,399738,692,4.1851e+06,9213

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 378573 ms.

BK_STOP 1680812484997

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-D03N050"
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-5348"
echo " Executing tool itstools"
echo " Input is PGCD-PT-D03N050, 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 r531-tall-167987252500286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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