About the Execution of ITS-Tools for SafeBus-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 476465.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-174889272700481.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-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-174889272700481
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 203K 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 7.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 791K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 303K 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 1748944304964
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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2025-06-03 09:51:46] [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:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:51:46] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-03 09:51:46] [INFO ] Transformed 144 places.
[2025-06-03 09:51:46] [INFO ] Transformed 451 transitions.
[2025-06-03 09:51:46] [INFO ] Found NUPN structural information;
[2025-06-03 09:51:46] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 214 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 6 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.15958KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 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 74 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 100 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 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 45 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2025-06-03 09:51:46] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-03 09:51:46] [INFO ] Computed 29 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:51:47] [INFO ] Implicit Places using invariants in 1074 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1107 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 132/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 445
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 445
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 559
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 24 rules in 77 ms. Remains 120 /132 variables (removed 12) and now considering 559/451 (removed -108) transitions.
[2025-06-03 09:51:47] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2025-06-03 09:51:47] [INFO ] Computed 23 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:51:48] [INFO ] Implicit Places using invariants in 770 ms returned []
[2025-06-03 09:51:48] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 09:51:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:51:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 09:51:49] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 120/138 places, 559/451 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 2869 ms. Remains : 120/138 places, 559/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4172 ms (no deadlock found). (steps per millisecond=299 )
Random directed walk for 1250000 steps, including 0 resets, run took 3270 ms (no deadlock found). (steps per millisecond=382 )
[2025-06-03 09:51:56] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 09:51:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:51:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 09:51:57] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 247 ms returned sat
[2025-06-03 09:51:57] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-06-03 09:51:57] [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:51:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-03 09:51:57] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 183 ms returned sat
[2025-06-03 09:51:57] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-06-03 09:51:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 09:51:57] [INFO ] [Nat]Added 43 Read/Feed constraints in 47 ms returned sat
[2025-06-03 09:51:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 49 ms.
[2025-06-03 09:51:58] [INFO ] Added : 1 causal constraints over 1 iterations in 131 ms. Result :sat
Parikh directed walk for 8000 steps, including 826 resets, run took 58 ms. (steps per millisecond=137 )
Random directed walk for 500000 steps, including 0 resets, run took 1315 ms (no deadlock found). (steps per millisecond=380 )
Random walk for 500000 steps, including 0 resets, run took 1581 ms (no deadlock found). (steps per millisecond=316 )
Random directed walk for 500001 steps, including 0 resets, run took 1321 ms (no deadlock found). (steps per millisecond=378 )
Random walk for 500000 steps, including 0 resets, run took 1543 ms (no deadlock found). (steps per millisecond=324 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 120/120 places, 559/559 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 39 ms. Remains 120 /120 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2025-06-03 09:52:04] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 09:52:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:52:04] [INFO ] Implicit Places using invariants in 619 ms returned []
[2025-06-03 09:52:04] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 09:52:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:52:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 09:52:05] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:52:05] [INFO ] Redundant transitions in 31 ms returned []
Running 553 sub problems to find dead transitions.
[2025-06-03 09:52:05] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 09:52:05] [INFO ] Invariant cache hit.
[2025-06-03 09:52:05] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 553 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 36 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:08] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:09] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:10] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:11] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:12] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 17/160 constraints. Problems are: Problem set: 36 solved, 517 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:52:16] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/161 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/161 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 350/470 variables, 120/281 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 43/324 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/324 constraints. Problems are: Problem set: 36 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 324 constraints, problems are : Problem set: 36 solved, 517 unsolved in 30034 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 517 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/161 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/161 constraints. Problems are: Problem set: 36 solved, 517 unsolved
SMT process timed out in 60934ms, After SMT, problems are : Problem set: 36 solved, 517 unsolved
Search for dead transitions found 36 dead transitions in 60946ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 120/120 places, 523/559 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 23 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:53:06] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 62545 ms. Remains : 120/120 places, 523/559 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3710 ms (no deadlock found). (steps per millisecond=336 )
Random directed walk for 1250000 steps, including 0 resets, run took 3041 ms (no deadlock found). (steps per millisecond=411 )
[2025-06-03 09:53:13] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2025-06-03 09:53:13] [INFO ] Computed 23 invariants in 16 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:53:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 09:53:13] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 474 ms returned sat
[2025-06-03 09:53:14] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2025-06-03 09:53:14] [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:53:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 09:53:14] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 286 ms returned sat
[2025-06-03 09:53:14] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-06-03 09:53:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 09:53:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 37 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:14] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:14] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:14] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:15] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:15] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:53:15] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
[2025-06-03 09:53:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 636 ms
[2025-06-03 09:53:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 43 ms.
[2025-06-03 09:53:15] [INFO ] Added : 4 causal constraints over 2 iterations in 113 ms. Result :sat
Parikh directed walk for 10300 steps, including 913 resets, run took 46 ms. (steps per millisecond=223 )
Random directed walk for 500000 steps, including 0 resets, run took 1298 ms (no deadlock found). (steps per millisecond=385 )
Random walk for 500000 steps, including 0 resets, run took 1562 ms (no deadlock found). (steps per millisecond=320 )
Random directed walk for 500000 steps, including 0 resets, run took 1282 ms (no deadlock found). (steps per millisecond=390 )
Random walk for 500000 steps, including 0 resets, run took 1538 ms (no deadlock found). (steps per millisecond=325 )
[2025-06-03 09:53:21] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4672264780062069266
[2025-06-03 09:53:21] [INFO ] Applying decomposition
[2025-06-03 09:53:21] [INFO ] Computing symmetric may disable matrix : 451 transitions.
[2025-06-03 09:53:21] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:53:21] [INFO ] Flatten gal took : 39 ms
[2025-06-03 09:53:21] [INFO ] Computing symmetric may enable matrix : 451 transitions.
[2025-06-03 09:53:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2225484753489595254.txt' '-o' '/tmp/graph2225484753489595254.bin' '-w' '/tmp/graph2225484753489595254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2225484753489595254.bin' '-l' '-1' '-v' '-w' '/tmp/graph2225484753489595254.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:53:21] [INFO ] Decomposing Gal with order
[2025-06-03 09:53:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:53:21] [INFO ] Computing Do-Not-Accords matrix : 451 transitions.
[2025-06-03 09:53:21] [INFO ] Computation of Completed DNA matrix. took 82 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:53:21] [INFO ] Built C files in 409ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4672264780062069266
[2025-06-03 09:53:21] [INFO ] Removed a total of 928 redundant transitions.
Running compilation step : cd /tmp/ltsmin4672264780062069266;'/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'
[2025-06-03 09:53:22] [INFO ] Flatten gal took : 278 ms
[2025-06-03 09:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 28 ms.
[2025-06-03 09:53:22] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock1559044516354689232.gal : 15 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/ReachabilityDeadlock1559044516354689232.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 1505 ms.
Running link step : cd /tmp/ltsmin4672264780062069266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4672264780062069266;'/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'
LTSmin run took 377684 ms.
FORMULA ReachabilityDeadlock FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 475258 ms.
BK_STOP 1748944781429
--------------------
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
++ 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.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-06"
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-06, 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-174889272700481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 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 '
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 ;