Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K 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 1748942266728

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
ReachabilityDeadlock COL
Running Version 202505121319
[2025-06-03 09:17:47] [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:17:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:17:48] [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-03 09:17:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 09:17:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 587 ms
[2025-06-03 09:17:48] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2025-06-03 09:17:48] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 21 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 09:17:48] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 5 ms.
[2025-06-03 09:17:48] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
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.
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2025-06-03 09:17:48] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 59 ms.
[2025-06-03 09:17:48] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 20 places and 20 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.24911KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 366 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 394 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 250 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 09:17:49] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 09:17:49] [INFO ] Computed 45 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:17:50] [INFO ] Implicit Places using invariants in 827 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 867 ms to find 10 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
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 20 rules in 265 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2025-06-03 09:17:50] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-03 09:17:50] [INFO ] Computed 35 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:17:51] [INFO ] Implicit Places using invariants in 505 ms returned []
[2025-06-03 09:17:51] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 09:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:17:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 09:17:52] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 286/306 places, 1621/1631 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 3806 ms. Remains : 286/306 places, 1621/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 7391 ms (no deadlock found). (steps per millisecond=169 )
Random directed walk for 1250000 steps, including 0 resets, run took 5302 ms (no deadlock found). (steps per millisecond=235 )
[2025-06-03 09:18:05] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 09:18:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:18:06] [INFO ] [Real]Absence check using 14 positive place invariants in 122 ms returned sat
[2025-06-03 09:18:06] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 933 ms returned sat
[2025-06-03 09:18:07] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-06-03 09:18:07] [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:18:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 60 ms returned sat
[2025-06-03 09:18:07] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 170 ms returned sat
[2025-06-03 09:18:08] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2025-06-03 09:18:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 09:18:08] [INFO ] [Nat]Added 111 Read/Feed constraints in 119 ms returned sat
[2025-06-03 09:18:08] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 89 ms.
[2025-06-03 09:18:09] [INFO ] Added : 1 causal constraints over 1 iterations in 233 ms. Result :sat
Parikh directed walk for 21100 steps, including 1000 resets, run took 204 ms. (steps per millisecond=103 )
Random directed walk for 500007 steps, including 0 resets, run took 2274 ms (no deadlock found). (steps per millisecond=219 )
Random walk for 500000 steps, including 0 resets, run took 2976 ms (no deadlock found). (steps per millisecond=168 )
Random directed walk for 500000 steps, including 0 resets, run took 2254 ms (no deadlock found). (steps per millisecond=221 )
Random walk for 500000 steps, including 0 resets, run took 2984 ms (no deadlock found). (steps per millisecond=167 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 286/286 places, 1621/1621 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 129 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2025-06-03 09:18:19] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 09:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:18:20] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-06-03 09:18:20] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 09:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:18:20] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 09:18:22] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 2483 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:18:22] [INFO ] Redundant transitions in 117 ms returned []
Running 1611 sub problems to find dead transitions.
[2025-06-03 09:18:22] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 09:18:22] [INFO ] Invariant cache hit.
[2025-06-03 09:18:22] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 10 solved, 1601 unsolved
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:33] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:33] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:34] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:35] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:36] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 20/55 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:36] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:38] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:39] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/75 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:48] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 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:18:49] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:49] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:50] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:50] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:50] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:50] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 20/95 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:51] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:51] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:52] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:53] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:53] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:53] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 108 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1611/1611 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 14/14 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 21/35 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 73/108 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:57] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:58] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:58] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:18:58] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:06] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:06] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:07] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:07] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:07] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:08] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:08] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:09] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:09] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:09] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:09] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:10] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:10] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:10] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:13] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:13] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 20/128 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:15] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:15] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:16] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:19:24] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 132 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1611 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62294ms problems are : Problem set: 100 solved, 1511 unsolved
Search for dead transitions found 100 dead transitions in 62316ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 286/286 places, 1521/1621 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 99 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:19:24] [INFO ] Redundant transitions in 28 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 65206 ms. Remains : 286/286 places, 1521/1621 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6963 ms (no deadlock found). (steps per millisecond=179 )
Random directed walk for 1250000 steps, including 0 resets, run took 5180 ms (no deadlock found). (steps per millisecond=241 )
[2025-06-03 09:19:37] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2025-06-03 09:19:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-03 09:19:37] [INFO ] [Real]Absence check using 14 positive place invariants in 90 ms returned sat
[2025-06-03 09:19:38] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 599 ms returned sat
[2025-06-03 09:19:39] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2025-06-03 09:19:39] [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:19:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 49 ms returned sat
[2025-06-03 09:19:39] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 178 ms returned sat
[2025-06-03 09:19:40] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2025-06-03 09:19:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 09:19:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 73 ms returned sat
[2025-06-03 09:19:40] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 79 ms.
[2025-06-03 09:19:40] [INFO ] Added : 1 causal constraints over 1 iterations in 194 ms. Result :sat
Parikh directed walk for 10300 steps, including 862 resets, run took 80 ms. (steps per millisecond=128 )
Random directed walk for 500003 steps, including 0 resets, run took 2040 ms (no deadlock found). (steps per millisecond=245 )
Random walk for 500000 steps, including 0 resets, run took 2712 ms (no deadlock found). (steps per millisecond=184 )
Random directed walk for 500000 steps, including 0 resets, run took 1989 ms (no deadlock found). (steps per millisecond=251 )
Random walk for 500000 steps, including 0 resets, run took 2710 ms (no deadlock found). (steps per millisecond=184 )
[2025-06-03 09:19:50] [INFO ] Flatten gal took : 219 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7401051666860404273
[2025-06-03 09:19:50] [INFO ] Too many transitions (1631) to apply POR reductions. Disabling POR matrices.
[2025-06-03 09:19:50] [INFO ] Applying decomposition
[2025-06-03 09:19:50] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7401051666860404273
Running compilation step : cd /tmp/ltsmin7401051666860404273;'/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:19:50] [INFO ] Flatten gal took : 126 ms
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/graph9915749072959144035.txt' '-o' '/tmp/graph9915749072959144035.bin' '-w' '/tmp/graph9915749072959144035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9915749072959144035.bin' '-l' '-1' '-v' '-w' '/tmp/graph9915749072959144035.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:19:50] [INFO ] Decomposing Gal with order
[2025-06-03 09:19:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:19:51] [INFO ] Removed a total of 2408 redundant transitions.
[2025-06-03 09:19:51] [INFO ] Flatten gal took : 503 ms
[2025-06-03 09:19:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1073 labels/synchronizations in 78 ms.
[2025-06-03 09:19:51] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock8815741043351972436.gal : 22 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/ReachabilityDeadlock8815741043351972436.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 3446 ms.
Running link step : cd /tmp/ltsmin7401051666860404273;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7401051666860404273;'/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'
Detected timeout of ITS tools.
[2025-06-03 09:30:32] [INFO ] Applying decomposition
[2025-06-03 09:30:32] [INFO ] Flatten gal took : 229 ms
[2025-06-03 09:30:32] [INFO ] Decomposing Gal with order
[2025-06-03 09:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:30:33] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cable_free in partition [AMC_0],[AMC_1, wait_ack_1],[AMC_2, wait_ack_2],[AMC_3, wait_ack_3],[AMC_4, wait_ack_4],[AMC_5, wait_ack_5],[AMC_6, wait_ack_6],[AMC_7, wait_ack_7],[AMC_8, wait_ack_8],[AMC_9, wait_ack_9],[AMC_10, wait_ack_10],[AMC_11],[AMC_12, wait_ack_12],[AMC_13, wait_ack_13],[AMC_14, wait_ack_14],[AMC_15, wait_ack_15],[AMC_16, wait_ack_16],[AMC_17, wait_ack_17],[AMC_18, wait_ack_18],[AMC_19, wait_ack_19],[AMC_20, wait_ack_20],[AMC_21, wait_ack_21],[AMC_22],[AMC_23, wait_ack_23],[AMC_24, wait_ack_24],[AMC_25, wait_ack_25],[AMC_26, wait_ack_26],[AMC_27, wait_ack_27],[AMC_28, wait_ack_28],[AMC_29, wait_ack_29],[AMC_30, wait_ack_30],[AMC_31, wait_ack_31],[AMC_32, wait_ack_32],[AMC_33],[AMC_34, wait_ack_34],[AMC_35, wait_ack_35],[AMC_36, wait_ack_36],[AMC_37, wait_ack_37],[AMC_38, wait_ack_38],[AMC_39, wait_ack_39],[AMC_40, wait_ack_40],[AMC_41, wait_ack_41],[AMC_42, wait_ack_42],[AMC_43, wait_ack_43],[AMC_44],[AMC_45, wait_ack_45],[AMC_46, wait_ack_46],[AMC_47, wait_ack_47],[AMC_48, wait_ack_48],[AMC_49, wait_ack_49],[AMC_50, wait_ack_50],[AMC_51, wait_ack_51],[AMC_52, wait_ack_52],[AMC_53, wait_ack_53],[AMC_54, wait_ack_54],[AMC_55],[AMC_56, wait_ack_56],[AMC_57, wait_ack_57],[AMC_58, wait_ack_58],[AMC_59, wait_ack_59],[AMC_60, wait_ack_60],[AMC_61, wait_ack_61],[AMC_62, wait_ack_62],[AMC_63, wait_ack_63],[AMC_64, wait_ack_64],[AMC_65, wait_ack_65],[AMC_66],[AMC_67, wait_ack_67],[AMC_68, wait_ack_68],[AMC_69, wait_ack_69],[AMC_70, wait_ack_70],[AMC_71, wait_ack_71],[AMC_72, wait_ack_72],[AMC_73, wait_ack_73],[AMC_74, wait_ack_74],[AMC_75, wait_ack_75],[AMC_76, wait_ack_76],[AMC_77],[AMC_78, wait_ack_78],[AMC_79, wait_ack_79],[AMC_80, wait_ack_80],[AMC_81, wait_ack_81],[AMC_82, wait_ack_82],[AMC_83, wait_ack_83],[AMC_84, wait_ack_84],[AMC_85, wait_ack_85],[AMC_86, wait_ack_86],[AMC_87, wait_ack_87],[AMC_88],[AMC_89, wait_ack_89],[AMC_90, wait_ack_90],[AMC_91, wait_ack_91],[AMC_92, wait_ack_92],[AMC_93, wait_ack_93],[AMC_94, wait_ack_94],[AMC_95, wait_ack_95],[AMC_96, wait_ack_96],[AMC_97, wait_ack_97],[AMC_98, wait_ack_98],[AMC_99],[Cpt2_0, Cpt1_0, cable_used_0, FMC_0, wait_cable_0, listen_0, RMC_0, PMC_0, MSG_0, wait_msg_0, loop_em_0],[Cpt2_1, Cpt1_1, cable_used_1, FMC_1, wait_cable_1, listen_1, RMC_1, PMC_1, MSG_1, wait_msg_1, loop_em_1],[Cpt2_2, Cpt1_2, cable_used_2, FMC_2, wait_cable_2, listen_2, RMC_2, PMC_2, MSG_2, wait_msg_2, loop_em_2],[Cpt2_3, Cpt1_3, cable_used_3, FMC_3, wait_cable_3, listen_3, RMC_3, PMC_3, MSG_3, wait_msg_3, loop_em_3],[Cpt2_4, Cpt1_4, cable_used_4, FMC_4, wait_cable_4, listen_4, RMC_4, PMC_4, MSG_4, wait_msg_4, loop_em_4],[Cpt2_5, Cpt1_5, cable_used_5, FMC_5, wait_cable_5, listen_5, RMC_5, PMC_5, MSG_5, wait_msg_5, loop_em_5],[Cpt2_6, Cpt1_6, cable_used_6, FMC_6, wait_cable_6, listen_6, RMC_6, PMC_6, MSG_6, wait_msg_6, loop_em_6],[Cpt2_7, Cpt1_7, cable_used_7, FMC_7, wait_cable_7, listen_7, RMC_7, PMC_7, MSG_7, wait_msg_7, loop_em_7],[Cpt2_8, Cpt1_8, cable_used_8, FMC_8, wait_cable_8, listen_8, RMC_8, PMC_8, MSG_8, wait_msg_8, loop_em_8],[Cpt2_9, Cpt1_9, cable_used_9, FMC_9, wait_cable_9, listen_9, RMC_9, PMC_9, MSG_9, wait_msg_9, loop_em_9],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-03 09:30:33] [INFO ] Flatten gal took : 225 ms
[2025-06-03 09:30:33] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock3198595070571331256.gal : 48 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/ReachabilityDeadlock3198595070571331256.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--gen-order' 'FOLLOW'

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 -...255
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2025-06-03 09:41:14] [INFO ] Flatten gal took : 183 ms
[2025-06-03 09:41:14] [INFO ] Input system was already deterministic with 1631 transitions.
[2025-06-03 09:41:14] [INFO ] Transformed 306 places.
[2025-06-03 09:41:14] [INFO ] Transformed 1631 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 09:41:45] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock3070839013920774978.gal : 27 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/ReachabilityDeadlock3070839013920774978.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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 -...300
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

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

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