MCC'2026- Execution of r143-smll-177955812400003

About the Execution of 2025-gold for FamilyReunion-COL-L00050M0005C002P002G001

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1138.075	298258.00	339917.00	1014.90	51 2 51 51 51 2 51 2 51 51 51 51 51 51 51 51	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r143-smll-177955812400003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.8K Mar 6 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 6 05:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 05:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 05:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 05:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 137K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779612276004

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2026-05-24 08:44:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 08:44:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:44:38] [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.
[2026-05-24 08:44:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-24 08:44:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1522 ms
[2026-05-24 08:44:40] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2026-05-24 08:44:40] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 79 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2026-05-24 08:44:40] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 12 ms.
[2026-05-24 08:44:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2026-05-24 08:44:40] [INFO ] Computed 33 invariants in 17 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 2, 51, 51, 102, 4, 51, 2, 51, 102, 51, 51, 51, 51, 51, 102]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-24 08:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:40] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-24 08:44:40] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2026-05-24 08:44:40] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-24 08:44:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-24 08:44:41] [INFO ] Added : 32 causal constraints over 7 iterations in 179 ms. Result :sat
Minimization took 44 ms.
[2026-05-24 08:44:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2026-05-24 08:44:41] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 21 ms returned sat
[2026-05-24 08:44:41] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-24 08:44:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 15 ms.
[2026-05-24 08:44:41] [INFO ] Added : 32 causal constraints over 7 iterations in 147 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:41] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2026-05-24 08:44:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 24 ms returned sat
[2026-05-24 08:44:41] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-24 08:44:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 18 ms.
[2026-05-24 08:44:41] [INFO ] Added : 25 causal constraints over 5 iterations in 113 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:41] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 30 ms returned sat
[2026-05-24 08:44:42] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2026-05-24 08:44:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-24 08:44:42] [INFO ] Added : 19 causal constraints over 4 iterations in 106 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:42] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 22 ms returned sat
[2026-05-24 08:44:42] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-24 08:44:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 08:44:42] [INFO ] Added : 40 causal constraints over 8 iterations in 164 ms. Result :sat
Minimization took 35 ms.
[2026-05-24 08:44:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:42] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2026-05-24 08:44:42] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-24 08:44:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-24 08:44:43] [INFO ] Added : 40 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 08:44:43] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 08:44:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 08:44:43] [INFO ] Added : 63 causal constraints over 13 iterations in 223 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:43] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:43] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2026-05-24 08:44:43] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 08:44:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-24 08:44:43] [INFO ] Added : 53 causal constraints over 11 iterations in 196 ms. Result :sat
Minimization took 41 ms.
[2026-05-24 08:44:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 19 ms returned sat
[2026-05-24 08:44:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-24 08:44:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-24 08:44:44] [INFO ] Added : 53 causal constraints over 11 iterations in 164 ms. Result :sat
Minimization took 39 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2026-05-24 08:44:44] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 08:44:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-24 08:44:44] [INFO ] Added : 65 causal constraints over 13 iterations in 214 ms. Result :sat
Minimization took 40 ms.
[2026-05-24 08:44:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 08:44:44] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 08:44:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 13 ms.
[2026-05-24 08:44:45] [INFO ] Added : 65 causal constraints over 13 iterations in 208 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:45] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2026-05-24 08:44:45] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 08:44:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-24 08:44:45] [INFO ] Added : 6 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:45] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2026-05-24 08:44:45] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 08:44:45] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 08:44:45] [INFO ] Added : 39 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 35 ms.
[2026-05-24 08:44:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 08:44:46] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-24 08:44:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 08:44:46] [INFO ] Added : 39 causal constraints over 8 iterations in 115 ms. Result :sat
Minimization took 33 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:46] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 08:44:46] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-24 08:44:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 26 ms.
[2026-05-24 08:44:46] [INFO ] Added : 2 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 28 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:46] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 08:44:46] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 08:44:46] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 08:44:46] [INFO ] Added : 64 causal constraints over 13 iterations in 219 ms. Result :sat
Minimization took 46 ms.
[2026-05-24 08:44:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2026-05-24 08:44:47] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-24 08:44:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 08:44:47] [INFO ] Added : 64 causal constraints over 13 iterations in 182 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2026-05-24 08:44:47] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-24 08:44:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 08:44:47] [INFO ] Added : 49 causal constraints over 10 iterations in 175 ms. Result :sat
Minimization took 41 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:47] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 16 ms returned sat
[2026-05-24 08:44:47] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-24 08:44:47] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-24 08:44:48] [INFO ] Added : 52 causal constraints over 11 iterations in 186 ms. Result :sat
Minimization took 42 ms.
[2026-05-24 08:44:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 08:44:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-24 08:44:48] [INFO ] Added : 52 causal constraints over 11 iterations in 111 ms. Result :sat
Minimization took 27 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-24 08:44:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-24 08:44:48] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 15 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-24 08:44:48] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-24 08:44:48] [INFO ] Added : 38 causal constraints over 8 iterations in 110 ms. Result :sat
Minimization took 34 ms.
[2026-05-24 08:44:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-24 08:44:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2026-05-24 08:44:49] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-24 08:44:49] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-24 08:44:49] [INFO ] Added : 38 causal constraints over 8 iterations in 99 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 102, 4, 51, 2, 51, 102, 51, 51, 51, 51, 51, 102]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2026-05-24 08:44:49] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 179 ms.
[2026-05-24 08:44:49] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 51 places in 56 ms
Reduce places removed 64 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 102, 4, 51, 2, 51, 102, 51, 51, 51, 51, 51, 102]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 102, 4, 51, 2, 51, 102, 51, 51, 51, 51, 51, 102]
// Phase 1: matrix 9336 rows 11403 cols
[2026-05-24 08:44:50] [INFO ] Computed 2767 invariants in 984 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 102, 4, 51, 2, 51, 102, 51, 51, 51, 51, 51, 102]
RANDOM walk for 10000 steps (3 resets) in 741 ms. (13 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130013 steps (26 resets) in 568 ms. (228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 9, 10, 9, 2, 49, 29, 5, 28, 7, 9, 31, 7] Max Struct:[51, 51, 51, 102, 4, 51, 51, 102, 51, 51, 51, 51, 102]
[2026-05-24 08:44:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:44:54] [INFO ] [Real]Absence check using 59 positive place invariants in 405 ms returned sat
[2026-05-24 08:44:56] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1933 ms returned sat
[2026-05-24 08:44:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:02] [INFO ] [Real]Absence check using 59 positive place invariants in 443 ms returned sat
[2026-05-24 08:45:04] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 2097 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:07] [INFO ] [Real]Absence check using 59 positive place invariants in 421 ms returned sat
[2026-05-24 08:45:09] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1986 ms returned sat
[2026-05-24 08:45:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:14] [INFO ] [Real]Absence check using 59 positive place invariants in 474 ms returned sat
[2026-05-24 08:45:16] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-24 08:45:16] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 2103 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:19] [INFO ] [Real]Absence check using 59 positive place invariants in 496 ms returned sat
[2026-05-24 08:45:21] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-24 08:45:21] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 2269 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:24] [INFO ] [Real]Absence check using 59 positive place invariants in 400 ms returned sat
[2026-05-24 08:45:26] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1715 ms returned sat
[2026-05-24 08:45:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:29] [INFO ] [Real]Absence check using 59 positive place invariants in 424 ms returned sat
[2026-05-24 08:45:31] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1710 ms returned sat
[2026-05-24 08:45:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:34] [INFO ] [Real]Absence check using 59 positive place invariants in 388 ms returned sat
[2026-05-24 08:45:36] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1593 ms returned sat
[2026-05-24 08:45:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:39] [INFO ] [Real]Absence check using 59 positive place invariants in 416 ms returned sat
[2026-05-24 08:45:41] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1686 ms returned sat
[2026-05-24 08:45:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:44] [INFO ] [Real]Absence check using 59 positive place invariants in 383 ms returned sat
[2026-05-24 08:45:46] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1854 ms returned sat
[2026-05-24 08:45:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 08:45:49] [INFO ] [Real]Absence check using 59 positive place invariants in 401 ms returned sat
[2026-05-24 08:45:51] [INFO ] [Real]Absence check using 59 positive and 2708 generalized place invariants in 1870 ms returned sat
[2026-05-24 08:45:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[7, 9, 10, 9, 2, 49, 29, 5, 28, 7, 9, 31, 7] Max Struct:[51, 51, 51, 102, 4, 51, 51, 102, 51, 51, 51, 51, 102]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 9, 10, 9, 2, 49, 29, 5, 28, 7, 9, 31, 7] Max Struct:[51, 51, 51, 102, 4, 51, 51, 102, 51, 51, 51, 51, 102]
Support contains 1530 out of 11403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Graph (complete) has 16989 edges and 11403 vertex of which 11232 are kept as prefixes of interest. Removing 171 places using SCC suffix rule.32 ms
Discarding 171 places :
Also discarding 54 output transitions
Drop transitions (Output transitions of discarded places.) removed 54 transitions
Discarding 1683 places :
Implicit places reduction removed 1683 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2907 transitions
Trivial Post-agglo rules discarded 2907 transitions
Performed 2907 trivial Post agglomeration. Transition count delta: 2907
Iterating post reduction 0 with 4590 rules applied. Total rules applied 4591 place count 9549 transition count 6375
Reduce places removed 2907 places and 0 transitions.
Performed 408 Post agglomeration using F-continuation condition.Transition count delta: 408
Iterating post reduction 1 with 3315 rules applied. Total rules applied 7906 place count 6642 transition count 5967
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 2 with 408 rules applied. Total rules applied 8314 place count 6234 transition count 5967
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 867 Pre rules applied. Total rules applied 8314 place count 6234 transition count 5100
Deduced a syphon composed of 867 places in 5 ms
Ensure Unique test removed 459 places
Reduce places removed 1326 places and 0 transitions.
Iterating global reduction 3 with 2193 rules applied. Total rules applied 10507 place count 4908 transition count 5100
Discarding 153 places :
Implicit places reduction removed 153 places
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 3 with 306 rules applied. Total rules applied 10813 place count 4755 transition count 4947
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 10966 place count 4602 transition count 4947
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 10966 place count 4602 transition count 4896
Deduced a syphon composed of 51 places in 6 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 11068 place count 4551 transition count 4896
Discarding 765 places :
Symmetric choice reduction at 5 with 765 rule applications. Total rules 11833 place count 3786 transition count 4131
Iterating global reduction 5 with 765 rules applied. Total rules applied 12598 place count 3786 transition count 4131
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 12598 place count 3786 transition count 4080
Deduced a syphon composed of 51 places in 7 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 12700 place count 3735 transition count 4080
Discarding 53 places :
Symmetric choice reduction at 5 with 53 rule applications. Total rules 12753 place count 3682 transition count 3927
Iterating global reduction 5 with 53 rules applied. Total rules applied 12806 place count 3682 transition count 3927
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 5 with 204 rules applied. Total rules applied 13010 place count 3631 transition count 3774
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 13112 place count 3529 transition count 3774
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 4 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 13316 place count 3427 transition count 3672
Free-agglomeration rule (complex) applied 714 times.
Iterating global reduction 7 with 714 rules applied. Total rules applied 14030 place count 3427 transition count 2958
Reduce places removed 714 places and 0 transitions.
Iterating post reduction 7 with 714 rules applied. Total rules applied 14744 place count 2713 transition count 2958
Applied a total of 14744 rules in 3530 ms. Remains 2713 /11403 variables (removed 8690) and now considering 2958/9336 (removed 6378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3544 ms. Remains : 2713/11403 places, 2958/9336 transitions.
// Phase 1: matrix 2958 rows 2713 cols
[2026-05-24 08:45:55] [INFO ] Computed 362 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 9, 10, 9, 2, 49, 29, 5, 28, 7, 9, 31, 7] Max Struct:[51, 51, 51, 102, 4, 51, 51, 102, 51, 51, 51, 51, 102]
RANDOM walk for 729932 steps (747 resets) in 30001 ms. (24 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7268092 steps (123 resets) in 32946 ms. (220 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 51, 2, 19, 15, 32, 51] Max Struct:[51, 102, 4, 102, 51, 51, 102]
[2026-05-24 08:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:46:59] [INFO ] [Real]Absence check using 101 positive place invariants in 80 ms returned sat
[2026-05-24 08:46:59] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 108 ms returned sat
[2026-05-24 08:47:01] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2026-05-24 08:47:02] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 391 ms.
[2026-05-24 08:47:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:47:10] [INFO ] [Nat]Absence check using 101 positive place invariants in 125 ms returned sat
[2026-05-24 08:47:10] [INFO ] [Nat]Absence check using 101 positive and 261 generalized place invariants in 173 ms returned sat
[2026-05-24 08:47:12] [INFO ] [Nat]Absence check using state equation in 2216 ms returned sat
[2026-05-24 08:47:13] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 343 ms.
[2026-05-24 08:47:24] [INFO ] Added : 224 causal constraints over 45 iterations in 12105 ms. Result :sat
Minimization took 2981 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:47:28] [INFO ] [Real]Absence check using 101 positive place invariants in 81 ms returned sat
[2026-05-24 08:47:28] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 102 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:47:29] [INFO ] [Real]Absence check using 101 positive place invariants in 77 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:47:29] [INFO ] [Real]Absence check using 101 positive place invariants in 83 ms returned sat
[2026-05-24 08:47:29] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 155 ms returned sat
[2026-05-24 08:47:31] [INFO ] [Real]Absence check using state equation in 1762 ms returned sat
[2026-05-24 08:47:31] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 236 ms.
[2026-05-24 08:47:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:47:42] [INFO ] [Nat]Absence check using 101 positive place invariants in 95 ms returned sat
[2026-05-24 08:47:42] [INFO ] [Nat]Absence check using 101 positive and 261 generalized place invariants in 114 ms returned sat
[2026-05-24 08:47:44] [INFO ] [Nat]Absence check using state equation in 1869 ms returned sat
[2026-05-24 08:47:45] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 316 ms.
[2026-05-24 08:48:05] [INFO ] Added : 285 causal constraints over 57 iterations in 20202 ms.(timeout) Result :sat
Minimization took 3276 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:48:09] [INFO ] [Real]Absence check using 101 positive place invariants in 93 ms returned sat
[2026-05-24 08:48:09] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 143 ms returned sat
[2026-05-24 08:48:10] [INFO ] [Real]Absence check using state equation in 1662 ms returned sat
[2026-05-24 08:48:11] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 246 ms.
[2026-05-24 08:48:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:48:22] [INFO ] [Nat]Absence check using 101 positive place invariants in 90 ms returned sat
[2026-05-24 08:48:22] [INFO ] [Nat]Absence check using 101 positive and 261 generalized place invariants in 115 ms returned sat
[2026-05-24 08:48:24] [INFO ] [Nat]Absence check using state equation in 1885 ms returned sat
[2026-05-24 08:48:24] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 245 ms.
[2026-05-24 08:48:44] [INFO ] Added : 335 causal constraints over 67 iterations in 20106 ms.(timeout) Result :sat
Minimization took 4463 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:48:49] [INFO ] [Real]Absence check using 101 positive place invariants in 91 ms returned sat
[2026-05-24 08:48:49] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 191 ms returned sat
[2026-05-24 08:48:51] [INFO ] [Real]Absence check using state equation in 1881 ms returned sat
[2026-05-24 08:48:52] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 211 ms.
[2026-05-24 08:48:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:48:59] [INFO ] [Nat]Absence check using 101 positive place invariants in 131 ms returned sat
[2026-05-24 08:48:59] [INFO ] [Nat]Absence check using 101 positive and 261 generalized place invariants in 187 ms returned sat
[2026-05-24 08:49:01] [INFO ] [Nat]Absence check using state equation in 1880 ms returned sat
[2026-05-24 08:49:01] [INFO ] Computed and/alt/rep : 2397/3060/2397 causal constraints (skipped 510 transitions) in 240 ms.
[2026-05-24 08:49:10] [INFO ] Added : 147 causal constraints over 30 iterations in 8740 ms. Result :sat
Minimization took 3743 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:49:14] [INFO ] [Real]Absence check using 101 positive place invariants in 84 ms returned sat
[2026-05-24 08:49:14] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 98 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21, 51, 2, 19, 15, 32, 51] Max Struct:[51, 51, 2, 102, 51, 51, 51]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14 51 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 51] Max Struct:[51, 102]
Support contains 357 out of 2713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2713/2713 places, 2958/2958 transitions.
Graph (complete) has 5204 edges and 2713 vertex of which 2098 are kept as prefixes of interest. Removing 615 places using SCC suffix rule.2 ms
Discarding 615 places :
Also discarding 408 output transitions
Drop transitions (Output transitions of discarded places.) removed 408 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 765 transitions
Trivial Post-agglo rules discarded 765 transitions
Performed 765 trivial Post agglomeration. Transition count delta: 765
Iterating post reduction 0 with 765 rules applied. Total rules applied 766 place count 2098 transition count 1785
Reduce places removed 765 places and 0 transitions.
Iterating post reduction 1 with 765 rules applied. Total rules applied 1531 place count 1333 transition count 1785
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 1531 place count 1333 transition count 1683
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 1735 place count 1231 transition count 1683
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 1837 place count 1129 transition count 1581
Iterating global reduction 2 with 102 rules applied. Total rules applied 1939 place count 1129 transition count 1581
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 2 with 204 rules applied. Total rules applied 2143 place count 1078 transition count 1428
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 2194 place count 1027 transition count 1428
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 2296 place count 976 transition count 1377
Applied a total of 2296 rules in 177 ms. Remains 976 /2713 variables (removed 1737) and now considering 1377/2958 (removed 1581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 976/2713 places, 1377/2958 transitions.
// Phase 1: matrix 1377 rows 976 cols
[2026-05-24 08:49:18] [INFO ] Computed 104 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[51, 51] Max Struct:[51, 102]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2793 resets) in 11254 ms. (88 steps per ms)
BEST_FIRST walk for 1000001 steps (35 resets) in 3211 ms. (311 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[102]
[2026-05-24 08:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 08:49:32] [INFO ] [Real]Absence check using 0 positive and 104 generalized place invariants in 40 ms returned sat
[2026-05-24 08:49:33] [INFO ] [Real]Absence check using state equation in 545 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[51]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-24 08:49:33] [INFO ] Flatten gal took : 234 ms
[2026-05-24 08:49:34] [INFO ] Flatten gal took : 146 ms
[2026-05-24 08:49:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18219154518382465363.gal : 57 ms
[2026-05-24 08:49:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1196980488830684162.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18219154518382465363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1196980488830684162.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 295899 ms.

BK_STOP 1779612574262

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5973"
echo " Executing tool gold2025"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-smll-177955812400003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;