fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r189-tall-174889272700476
Last Updated
June 24, 2025

About the Execution of ITS-Tools for SafeBus-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 19064.00 0.00 0.00 F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r189-tall-174889272700476.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 SafeBus-PT-03, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-174889272700476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K 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 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 95K 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 1748944242127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-06-03 09:50:43] [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-03 09:50:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:50:43] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-03 09:50:43] [INFO ] Transformed 57 places.
[2025-06-03 09:50:43] [INFO ] Transformed 91 transitions.
[2025-06-03 09:50:43] [INFO ] Found NUPN structural information;
[2025-06-03 09:50:43] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 154 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 3 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.14629KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 16 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 27 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 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 7 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-03 09:50:43] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-03 09:50:43] [INFO ] Computed 17 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:50:43] [INFO ] Implicit Places using invariants in 276 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 319 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 51/54 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 88
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 91
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 12 rules in 17 ms. Remains 45 /51 variables (removed 6) and now considering 91/91 (removed 0) transitions.
[2025-06-03 09:50:43] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 45 cols
[2025-06-03 09:50:43] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:50:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-03 09:50:43] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 09:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:50:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 09:50:44] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 45/54 places, 91/91 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 566 ms. Remains : 45/54 places, 91/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1559 ms (no deadlock found). (steps per millisecond=801 )
Random directed walk for 1250002 steps, including 0 resets, run took 1050 ms (no deadlock found). (steps per millisecond=1190 )
[2025-06-03 09:50:46] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 09:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:50:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 09:50:46] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 16 ms returned sat
[2025-06-03 09:50:46] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-03 09:50:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:50:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 09:50:46] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-03 09:50:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 09:50:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 09:50:46] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
[2025-06-03 09:50:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2025-06-03 09:50:47] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 8 ms.
[2025-06-03 09:50:47] [INFO ] Added : 22 causal constraints over 5 iterations in 61 ms. Result :sat
Parikh directed walk for 10300 steps, including 838 resets, run took 27 ms. (steps per millisecond=381 )
Random directed walk for 500000 steps, including 0 resets, run took 411 ms (no deadlock found). (steps per millisecond=1216 )
Random walk for 500000 steps, including 0 resets, run took 528 ms (no deadlock found). (steps per millisecond=946 )
Random directed walk for 500000 steps, including 0 resets, run took 408 ms (no deadlock found). (steps per millisecond=1225 )
Random walk for 500000 steps, including 0 resets, run took 546 ms (no deadlock found). (steps per millisecond=915 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 45/45 places, 91/91 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 7 ms. Remains 45 /45 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-03 09:50:49] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 09:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:50:49] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-03 09:50:49] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 09:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:50:49] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 09:50:49] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:50:49] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-03 09:50:49] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 09:50:49] [INFO ] Invariant cache hit.
[2025-06-03 09:50:49] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:50] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:50] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:50] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 12/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/116 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/129 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/130 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:50:51] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/131 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/131 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/131 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 131 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3100 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/50 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 9/59 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 14/73 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/73 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/113 variables, 45/118 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/131 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 79/210 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 210 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3587 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6766ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 6773ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 45/45 places, 82/91 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 5 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:50:56] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 7017 ms. Remains : 45/45 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1241 ms (no deadlock found). (steps per millisecond=1007 )
Random directed walk for 1250000 steps, including 0 resets, run took 966 ms (no deadlock found). (steps per millisecond=1293 )
[2025-06-03 09:50:58] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 45 cols
[2025-06-03 09:50:58] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:50:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-03 09:50:58] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 27 ms returned sat
[2025-06-03 09:50:58] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-03 09:50:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:50:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 09:50:58] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2025-06-03 09:50:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 09:50:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 09:50:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2025-06-03 09:50:58] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 28 transitions) in 6 ms.
[2025-06-03 09:50:58] [INFO ] Added : 23 causal constraints over 5 iterations in 54 ms. Result :sat
Parikh directed walk for 12600 steps, including 844 resets, run took 28 ms. (steps per millisecond=450 )
Random directed walk for 500003 steps, including 0 resets, run took 386 ms (no deadlock found). (steps per millisecond=1295 )
Random walk for 500000 steps, including 0 resets, run took 500 ms (no deadlock found). (steps per millisecond=1000 )
Random directed walk for 500000 steps, including 0 resets, run took 389 ms (no deadlock found). (steps per millisecond=1285 )
Random walk for 500000 steps, including 0 resets, run took 507 ms (no deadlock found). (steps per millisecond=986 )
[2025-06-03 09:51:00] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5300008189839552962
[2025-06-03 09:51:00] [INFO ] Applying decomposition
[2025-06-03 09:51:00] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2025-06-03 09:51:00] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:51:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:51:00] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2025-06-03 09:51:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:51:00] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2025-06-03 09:51:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:51:00] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5300008189839552962
Running compilation step : cd /tmp/ltsmin5300008189839552962;'/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/graph3277108717986943456.txt' '-o' '/tmp/graph3277108717986943456.bin' '-w' '/tmp/graph3277108717986943456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3277108717986943456.bin' '-l' '-1' '-v' '-w' '/tmp/graph3277108717986943456.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:51:00] [INFO ] Decomposing Gal with order
[2025-06-03 09:51:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:51:00] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 09:51:00] [INFO ] Flatten gal took : 50 ms
[2025-06-03 09:51:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 6 ms.
[2025-06-03 09:51:00] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock4448308617783458251.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/ReachabilityDeadlock4448308617783458251.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 362 ms.
Running link step : cd /tmp/ltsmin5300008189839552962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5300008189839552962;'/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'
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,4650,0.229902,13960,460,1697,12093,6678,250,34269,161,32706,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,0.319309,14216,1,0,12093,16639,646,34269,876,41684,8738

System contains 0 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 0 ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 17880 ms.

BK_STOP 1748944261191

--------------------
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="SafeBus-PT-03"
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 SafeBus-PT-03, 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 r189-tall-174889272700476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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