Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876819900416.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-COL-D03N050, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876819900416
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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_pt
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 11K 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 1748813991090

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-COL-D03N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityDeadlock COL
Running Version 202505121319
[2025-06-01 21:39:52] [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 21:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:39:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 21:39:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 21:39:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 500 ms
[2025-06-01 21:39:52] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 15 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2025-06-01 21:39:52] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 3 ms.
[2025-06-01 21:39:52] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [1:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2025-06-01 21:39:52] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 11 ms.
[2025-06-01 21:39:52] [INFO ] Unfolded 1 HLPN properties in 1 ms.
Built sparse matrix representations for Structural reductions in 0 ms.12517KB 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 8 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 12 cols
[2025-06-01 21:39:52] [INFO ] Computed 5 invariants in 6 ms
[2025-06-01 21:39:53] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 4 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 475ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 485ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 526 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 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-01 21:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:39:53] [INFO ] Implicit Places using invariants in 51 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 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 63 ms. Remains : 8/12 places, 12/12 transitions.
Random walk for 1250034 steps, including 0 resets, run took 321 ms (no deadlock found). (steps per millisecond=3894 )
Random directed walk for 1250054 steps, including 0 resets, run took 175 ms (no deadlock found). (steps per millisecond=7143 )
// Phase 1: matrix 12 rows 8 cols
[2025-06-01 21:39:54] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 21:39:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:39:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 21:39:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 21:39:54] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 21:39:54] [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 21:39:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:39:54] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 21:39:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 21:39:54] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:39:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
[2025-06-01 21:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-01 21:39:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 21:39:54] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Parikh directed walk for 8500 steps, including 180 resets, run took 12 ms. (steps per millisecond=708 )
Random directed walk for 500019 steps, including 0 resets, run took 68 ms (no deadlock found). (steps per millisecond=7353 )
Random walk for 500018 steps, including 0 resets, run took 73 ms (no deadlock found). (steps per millisecond=6849 )
Random directed walk for 500042 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
Random walk for 500015 steps, including 0 resets, run took 68 ms (no deadlock found). (steps per millisecond=7353 )
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.
[2025-06-01 21:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:39:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-01 21:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:39:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 21:39:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:39:54] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-01 21:39:54] [INFO ] Invariant cache hit.
[2025-06-01 21:39:54] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 200 ms. Remains : 8/8 places, 12/12 transitions.
Random walk for 1250031 steps, including 0 resets, run took 162 ms (no deadlock found). (steps per millisecond=7716 )
Random directed walk for 1250032 steps, including 0 resets, run took 155 ms (no deadlock found). (steps per millisecond=8064 )
[2025-06-01 21:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-01 21:39:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:39:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 21:39:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 21:39:55] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 21:39:55] [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 21:39:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 21:39:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 21:39:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 21:39:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:39:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2025-06-01 21:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2025-06-01 21:39:55] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 21:39:55] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Parikh directed walk for 8500 steps, including 190 resets, run took 9 ms. (steps per millisecond=944 )
Random directed walk for 500025 steps, including 0 resets, run took 71 ms (no deadlock found). (steps per millisecond=7042 )
Random walk for 500041 steps, including 0 resets, run took 82 ms (no deadlock found). (steps per millisecond=6098 )
Random directed walk for 500032 steps, including 0 resets, run took 60 ms (no deadlock found). (steps per millisecond=8333 )
Random walk for 500003 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
[2025-06-01 21:39:55] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13359003207150660869
[2025-06-01 21:39:55] [INFO ] Applying decomposition
[2025-06-01 21:39:55] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:39:55] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-06-01 21:39:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:39:55] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-06-01 21:39:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:39:55] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-06-01 21:39:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 21:39:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13359003207150660869
Running compilation step : cd /tmp/ltsmin13359003207150660869;'/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'
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/graph9458104082508737731.txt' '-o' '/tmp/graph9458104082508737731.bin' '-w' '/tmp/graph9458104082508737731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9458104082508737731.bin' '-l' '-1' '-v' '-w' '/tmp/graph9458104082508737731.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:39:55] [INFO ] Decomposing Gal with order
[2025-06-01 21:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:39:55] [INFO ] Flatten gal took : 18 ms
[2025-06-01 21:39:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-01 21:39:55] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock6280738898699189009.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock6280738898699189009.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 -...234
No direction supplied, using forward translation only.
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin13359003207150660869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13359003207150660869;'/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.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: 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( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Initializing POR dependencies: labels 12, guards 12
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.011: State length is 12, there are 12 groups
pins2lts-mc-linux64( 0/ 8), 0.011: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.011: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.011: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.011: Visible groups: 0 / 12, labels: 0 / 12
pins2lts-mc-linux64( 0/ 8), 0.011: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.011: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.060: ~6 levels ~960 states ~3680 transitions
pins2lts-mc-linux64( 2/ 8), 0.077: ~7 levels ~1920 states ~7624 transitions
pins2lts-mc-linux64( 4/ 8), 0.105: ~7 levels ~3840 states ~14312 transitions
pins2lts-mc-linux64( 4/ 8), 0.159: ~8 levels ~7680 states ~27456 transitions
pins2lts-mc-linux64( 2/ 8), 0.246: ~10 levels ~15360 states ~57224 transitions
pins2lts-mc-linux64( 4/ 8), 0.395: ~10 levels ~30720 states ~102784 transitions
pins2lts-mc-linux64( 6/ 8), 0.556: ~14 levels ~61440 states ~205656 transitions
pins2lts-mc-linux64( 6/ 8), 0.824: ~16 levels ~122880 states ~406680 transitions
pins2lts-mc-linux64( 6/ 8), 1.380: ~18 levels ~245760 states ~802096 transitions
pins2lts-mc-linux64( 6/ 8), 1.954: ~20 levels ~491520 states ~1581184 transitions
pins2lts-mc-linux64( 5/ 8), 2.702: ~23 levels ~983040 states ~3090352 transitions
pins2lts-mc-linux64( 5/ 8), 3.569: ~26 levels ~1966080 states ~6136344 transitions
pins2lts-mc-linux64( 5/ 8), 5.472: ~30 levels ~3932160 states ~12163264 transitions
pins2lts-mc-linux64( 5/ 8), 9.630: ~34 levels ~7864320 states ~24125032 transitions
pins2lts-mc-linux64( 6/ 8), 18.154: ~41 levels ~15728640 states ~47924576 transitions
pins2lts-mc-linux64( 2/ 8), 35.612: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 35.638:
pins2lts-mc-linux64( 0/ 8), 35.638: mean standard work distribution: 3.0% (states) 3.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 35.638:
pins2lts-mc-linux64( 0/ 8), 35.638: Explored 28221439 states 85609334 transitions, fanout: 3.033
pins2lts-mc-linux64( 0/ 8), 35.638: Total exploration time 35.620 sec (35.600 sec minimum, 35.610 sec on average)
pins2lts-mc-linux64( 0/ 8), 35.638: States per second: 792292, Transitions per second: 2403406
pins2lts-mc-linux64( 0/ 8), 35.638:
pins2lts-mc-linux64( 0/ 8), 35.638: Queue width: 8B, total height: 3544822, memory: 27.04MB
pins2lts-mc-linux64( 0/ 8), 35.638: Tree memory: 498.4MB, 16.5 B/state, compr.: 32.9%
pins2lts-mc-linux64( 0/ 8), 35.638: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 35.638: Stored 13 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 35.638: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 35.638: Est. total memory use: 525.4MB (~1051.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13359003207150660869;'/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/ltsmin13359003207150660869;'/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,4.17215e+11,327.532,1329120,1386,10995,948228,98675,31,399552,23,573758,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,350.069,1340208,1,0,948228,1.38598e+06,63,399552,687,4.33656e+06,8916

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

BK_STOP 1748814366033

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-COL-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-5832"
echo " Executing tool itstools"
echo " Input is PGCD-COL-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 r147-tall-174876819900416"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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