About the Execution of ITS-Tools for QuasiCertifProtocol-COL-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 409261.00 | 0.00 | 0.00 | 33 19 1 33 1 33 33 1089 33 33 1089 33 33 33 33 33 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254600773.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 QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254600773
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K 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 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 131K 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749138528734
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-05 15:48:49] [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]
[2025-06-05 15:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:48:50] [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-05 15:48:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 15:48:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 599 ms
[2025-06-05 15:48:50] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-05 15:48:50] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2025-06-05 15:48:50] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 15:48:50] [INFO ] Computed 5 invariants in 7 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[33, 19, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 19, 1, 33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 33 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 15:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:50] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2025-06-05 15:48:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-05 15:48:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-05 15:48:51] [INFO ] Added : 4 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:51] [INFO ] Added : 6 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:51] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:51] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 15:48:51] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:51] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 15:48:51] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:51] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 15:48:51] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-05 15:48:51] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:51] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-05 15:48:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-05 15:48:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-05 15:48:52] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-05 15:48:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 15:48:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:52] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 15:48:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-05 15:48:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 15:48:52] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 15:48:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-05 15:48:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-05 15:48:52] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 15:48:52] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 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] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2025-06-05 15:48:52] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 49 ms.
[2025-06-05 15:48:52] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
// Phase 1: matrix 506 rows 3806 cols
[2025-06-05 15:48:52] [INFO ] Computed 3301 invariants in 128 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
RANDOM walk for 10000 steps (266 resets) in 459 ms. (21 steps per ms)
BEST_FIRST walk for 130012 steps (138 resets) in 768 ms. (169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, +inf, 33, +inf, 33, 33]
[2025-06-05 15:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:54] [INFO ] [Real]Absence check using 37 positive place invariants in 121 ms returned sat
[2025-06-05 15:48:55] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 656 ms returned sat
[2025-06-05 15:48:57] [INFO ] [Real]Absence check using state equation in 2507 ms returned sat
[2025-06-05 15:48:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:48:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 114 ms returned sat
[2025-06-05 15:48:58] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 583 ms returned sat
[2025-06-05 15:49:00] [INFO ] [Nat]Absence check using state equation in 1993 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 15:49:03] [INFO ] Deduced a trap composed of 6 places in 2283 ms of which 106 ms to minimize.
[2025-06-05 15:49:03] [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: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
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
[2025-06-05 15:49:03] [INFO ] [Real]Absence check using 37 positive place invariants in 119 ms returned sat
[2025-06-05 15:49:04] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 640 ms returned sat
[2025-06-05 15:49:05] [INFO ] [Real]Absence check using state equation in 1662 ms returned sat
[2025-06-05 15:49:06] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 32 ms.
[2025-06-05 15:49:07] [INFO ] Added : 86 causal constraints over 18 iterations in 1766 ms. Result :sat
Minimization took 176 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:08] [INFO ] [Real]Absence check using 37 positive place invariants in 102 ms returned sat
[2025-06-05 15:49:09] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 651 ms returned sat
[2025-06-05 15:49:10] [INFO ] [Real]Absence check using state equation in 1610 ms returned sat
[2025-06-05 15:49:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 103 ms returned sat
[2025-06-05 15:49:12] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 665 ms returned sat
[2025-06-05 15:49:13] [INFO ] [Nat]Absence check using state equation in 1751 ms returned sat
[2025-06-05 15:49:13] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 34 ms.
[2025-06-05 15:49:15] [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 2
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.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
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
[2025-06-05 15:49:16] [INFO ] [Real]Absence check using 37 positive place invariants in 111 ms returned sat
[2025-06-05 15:49:17] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 622 ms returned sat
[2025-06-05 15:49:18] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2025-06-05 15:49:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 106 ms returned sat
[2025-06-05 15:49:19] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 631 ms returned sat
[2025-06-05 15:49:21] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2025-06-05 15:49:21] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 30 ms.
[2025-06-05 15:49:22] [INFO ] Added : 39 causal constraints over 8 iterations in 764 ms. Result :sat
Minimization took 668 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:23] [INFO ] [Real]Absence check using 37 positive place invariants in 101 ms returned sat
[2025-06-05 15:49:24] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 632 ms returned sat
[2025-06-05 15:49:26] [INFO ] [Real]Absence check using state equation in 2812 ms returned sat
[2025-06-05 15:49:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 103 ms returned sat
[2025-06-05 15:49:28] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 630 ms returned sat
[2025-06-05 15:49:30] [INFO ] [Nat]Absence check using state equation in 2794 ms returned sat
[2025-06-05 15:49:30] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 37 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:32] [INFO ] [Real]Absence check using 37 positive place invariants in 93 ms returned sat
[2025-06-05 15:49:33] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 610 ms returned sat
[2025-06-05 15:49:36] [INFO ] [Real]Absence check using state equation in 3946 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:37] [INFO ] [Real]Absence check using 37 positive place invariants in 96 ms returned sat
[2025-06-05 15:49:38] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 603 ms returned sat
[2025-06-05 15:49:39] [INFO ] [Real]Absence check using state equation in 1554 ms returned sat
[2025-06-05 15:49:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 96 ms returned sat
[2025-06-05 15:49:40] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 614 ms returned sat
[2025-06-05 15:49:42] [INFO ] [Nat]Absence check using state equation in 1915 ms returned sat
[2025-06-05 15:49:42] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 30 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:45] [INFO ] [Real]Absence check using 37 positive place invariants in 110 ms returned sat
[2025-06-05 15:49:45] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 622 ms returned sat
[2025-06-05 15:49:49] [INFO ] [Real]Absence check using state equation in 3208 ms returned sat
[2025-06-05 15:49:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 104 ms returned sat
[2025-06-05 15:49:50] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 612 ms returned sat
[2025-06-05 15:49:54] [INFO ] [Nat]Absence check using state equation in 4006 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:54] [INFO ] [Real]Absence check using 37 positive place invariants in 99 ms returned sat
[2025-06-05 15:49:55] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 624 ms returned sat
[2025-06-05 15:49:56] [INFO ] [Real]Absence check using state equation in 1548 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:49:57] [INFO ] [Real]Absence check using 37 positive place invariants in 102 ms returned sat
[2025-06-05 15:49:57] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 611 ms returned sat
[2025-06-05 15:49:59] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2025-06-05 15:49:59] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 32 ms.
[2025-06-05 15:50:01] [INFO ] Added : 135 causal constraints over 27 iterations in 2521 ms. Result :sat
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:50:02] [INFO ] [Real]Absence check using 37 positive place invariants in 101 ms returned sat
[2025-06-05 15:50:02] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 624 ms returned sat
[2025-06-05 15:50:04] [INFO ] [Real]Absence check using state equation in 1614 ms returned sat
[2025-06-05 15:50:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:50:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 105 ms returned sat
[2025-06-05 15:50:05] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 620 ms returned sat
[2025-06-05 15:50:08] [INFO ] [Nat]Absence check using state equation in 2602 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:50:08] [INFO ] [Real]Absence check using 37 positive place invariants in 100 ms returned sat
[2025-06-05 15:50:09] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 618 ms returned sat
[2025-06-05 15:50:10] [INFO ] [Real]Absence check using state equation in 1568 ms returned sat
[2025-06-05 15:50:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:50:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 106 ms returned sat
[2025-06-05 15:50:12] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 622 ms returned sat
[2025-06-05 15:50:13] [INFO ] [Nat]Absence check using state equation in 1616 ms returned sat
[2025-06-05 15:50:13] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 37 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:50:16] [INFO ] [Real]Absence check using 37 positive place invariants in 100 ms returned sat
[2025-06-05 15:50:17] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 612 ms returned sat
[2025-06-05 15:50:20] [INFO ] [Real]Absence check using state equation in 3927 ms returned sat
[2025-06-05 15:50:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 15:50:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 94 ms returned sat
[2025-06-05 15:50:22] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 605 ms returned sat
[2025-06-05 15:50:23] [INFO ] [Nat]Absence check using state equation in 1870 ms returned sat
[2025-06-05 15:50:24] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 57 ms.
[2025-06-05 15:50: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 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.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
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:[0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, 33, 33, +inf, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, 33, +inf, 33, 33]
Support contains 2476 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3769 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.19 ms
Discarding 37 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 3736 transition count 436
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 104 place count 3736 transition count 402
Deduced a syphon composed of 34 places in 1 ms
Ensure Unique test removed 65 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 1 with 133 rules applied. Total rules applied 237 place count 3637 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 237 place count 3637 transition count 401
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 3635 transition count 401
Applied a total of 240 rules in 263 ms. Remains 3635 /3806 variables (removed 171) and now considering 401/506 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 3635/3806 places, 401/506 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 401 rows 3635 cols
[2025-06-05 15:50:27] [INFO ] Computed 3235 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[33, 1, +inf, +inf, +inf, 33, 33, 1089, 33, +inf, 33, 33]
RANDOM walk for 627508 steps (8979 resets) in 30001 ms. (20 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8543911 steps (5550 resets) in 42115 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 33, 825, 0, 14, 0, 0, 33, 0, 14] Max Struct:[+inf, +inf, +inf, 33, 33, 1089, 33, +inf, 33, 33]
[2025-06-05 15:51:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:51:40] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 664 ms returned sat
[2025-06-05 15:51:41] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2025-06-05 15:51:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:51:42] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 670 ms returned sat
[2025-06-05 15:51:43] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2025-06-05 15:51:43] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 24 ms.
[2025-06-05 15:51:46] [INFO ] Added : 85 causal constraints over 17 iterations in 2593 ms. Result :sat
Minimization took 5128 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:51:52] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 657 ms returned sat
[2025-06-05 15:52:02] [INFO ] [Real]Absence check using state equation in 9698 ms returned sat
[2025-06-05 15:52:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:03] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 664 ms returned sat
[2025-06-05 15:52:14] [INFO ] [Nat]Absence check using state equation in 10785 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:15] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 659 ms returned sat
[2025-06-05 15:52:17] [INFO ] [Real]Absence check using state equation in 2632 ms returned sat
[2025-06-05 15:52:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:18] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 669 ms returned sat
[2025-06-05 15:52:22] [INFO ] [Nat]Absence check using state equation in 3217 ms returned sat
[2025-06-05 15:52:22] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 19 ms.
[2025-06-05 15:52:24] [INFO ] Added : 111 causal constraints over 23 iterations in 1868 ms. Result :sat
Minimization took 5178 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:30] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 653 ms returned sat
[2025-06-05 15:52:31] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2025-06-05 15:52:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:32] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 658 ms returned sat
[2025-06-05 15:52:33] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2025-06-05 15:52:34] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 18 ms.
[2025-06-05 15:52:36] [INFO ] Added : 119 causal constraints over 24 iterations in 1977 ms. Result :sat
Minimization took 5136 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:42] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 638 ms returned sat
[2025-06-05 15:52:43] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2025-06-05 15:52:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:44] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 673 ms returned sat
[2025-06-05 15:52:46] [INFO ] [Nat]Absence check using state equation in 2294 ms returned sat
[2025-06-05 15:52:46] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 14 ms.
[2025-06-05 15:52:47] [INFO ] Added : 66 causal constraints over 14 iterations in 1121 ms. Result :sat
Minimization took 5152 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:53] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 664 ms returned sat
[2025-06-05 15:52:55] [INFO ] [Real]Absence check using state equation in 1689 ms returned sat
[2025-06-05 15:52:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:52:56] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 654 ms returned sat
[2025-06-05 15:52:58] [INFO ] [Nat]Absence check using state equation in 1583 ms returned sat
[2025-06-05 15:52:58] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 21 ms.
[2025-06-05 15:53:00] [INFO ] Added : 134 causal constraints over 27 iterations in 2075 ms. Result :sat
Minimization took 5127 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:06] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 642 ms returned sat
[2025-06-05 15:53:08] [INFO ] [Real]Absence check using state equation in 1883 ms returned sat
[2025-06-05 15:53:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:09] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 643 ms returned sat
[2025-06-05 15:53:19] [INFO ] [Nat]Absence check using state equation in 10092 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:20] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 639 ms returned sat
[2025-06-05 15:53:23] [INFO ] [Real]Absence check using state equation in 3019 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:24] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 639 ms returned sat
[2025-06-05 15:53:25] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2025-06-05 15:53:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:26] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 645 ms returned sat
[2025-06-05 15:53:27] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2025-06-05 15:53:27] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 19 ms.
[2025-06-05 15:53:29] [INFO ] Added : 118 causal constraints over 24 iterations in 1896 ms. Result :sat
Minimization took 5182 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:35] [INFO ] [Real]Absence check using 0 positive and 3235 generalized place invariants in 634 ms returned sat
[2025-06-05 15:53:37] [INFO ] [Real]Absence check using state equation in 1282 ms returned sat
[2025-06-05 15:53:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:53:38] [INFO ] [Nat]Absence check using 0 positive and 3235 generalized place invariants in 667 ms returned sat
[2025-06-05 15:53:39] [INFO ] [Nat]Absence check using state equation in 1291 ms returned sat
[2025-06-05 15:53:39] [INFO ] Computed and/alt/rep : 299/332/299 causal constraints (skipped 101 transitions) in 18 ms.
[2025-06-05 15:53:41] [INFO ] Added : 98 causal constraints over 20 iterations in 1865 ms. Result :sat
Minimization took 5126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 33, 825, 0, 14, 0, 0, 33, 0, 14] Max Struct:[+inf, 33, +inf, 33, 33, 1089, 33, 33, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 825, 0, 14, 0, 0, 0, 14] Max Struct:[+inf, +inf, 33, 33, 1089, 33, 33, 33]
Support contains 2376 out of 3635 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3635/3635 places, 401/401 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 3602 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 3601 transition count 366
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 69 place count 3601 transition count 333
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 168 place count 3535 transition count 333
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 3535 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 3534 transition count 332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 3533 transition count 331
Applied a total of 171 rules in 264 ms. Remains 3533 /3635 variables (removed 102) and now considering 331/401 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 3533/3635 places, 331/401 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 331 rows 3533 cols
[2025-06-05 15:53:47] [INFO ] Computed 3202 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[30, 825, 0, 14, 0, 0, 0, 14] Max Struct:[+inf, +inf, 33, 33, 1089, 33, 33, 33]
RANDOM walk for 565698 steps (7541 resets) in 30001 ms. (18 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3180362 steps (1246 resets) in 29819 ms. (106 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 1089 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[33, 1089, 11] Max Struct:[+inf, +inf, 33]
[2025-06-05 15:54:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:54:48] [INFO ] [Real]Absence check using 0 positive and 3202 generalized place invariants in 628 ms returned sat
[2025-06-05 15:54:49] [INFO ] [Real]Absence check using state equation in 915 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:54:50] [INFO ] [Real]Absence check using 0 positive and 3202 generalized place invariants in 644 ms returned sat
[2025-06-05 15:55:14] [INFO ] [Real]Absence check using state equation in 23572 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:55:15] [INFO ] [Real]Absence check using 0 positive and 3202 generalized place invariants in 635 ms returned sat
[2025-06-05 15:55:20] [INFO ] [Real]Absence check using state equation in 5593 ms returned sat
[2025-06-05 15:55:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 15:55:21] [INFO ] [Nat]Absence check using 0 positive and 3202 generalized place invariants in 628 ms returned sat
[2025-06-05 15:55:27] [INFO ] [Nat]Absence check using state equation in 6206 ms returned sat
[2025-06-05 15:55:28] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 100 transitions) in 18 ms.
[2025-06-05 15:55:28] [INFO ] Added : 35 causal constraints over 7 iterations in 627 ms. Result :sat
Minimization took 5225 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[33, 1089, 11] Max Struct:[33, 1089, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 1089 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[33]
Support contains 33 out of 3533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3533/3533 places, 331/331 transitions.
Graph (complete) has 41580 edges and 3533 vertex of which 2344 are kept as prefixes of interest. Removing 1189 places using SCC suffix rule.8 ms
Discarding 1189 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 2344 transition count 165
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 166 place count 2311 transition count 165
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 199 place count 2278 transition count 132
Ensure Unique test removed 1089 places
Iterating post reduction 2 with 1089 rules applied. Total rules applied 1288 place count 1189 transition count 132
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 1321 place count 1156 transition count 99
Ensure Unique test removed 1089 places
Iterating post reduction 3 with 1089 rules applied. Total rules applied 2410 place count 67 transition count 99
Applied a total of 2410 rules in 532 ms. Remains 67 /3533 variables (removed 3466) and now considering 99/331 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 67/3533 places, 99/331 transitions.
// Phase 1: matrix 99 rows 67 cols
[2025-06-05 15:55:34] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[33]
RANDOM walk for 1000000 steps (14925 resets) in 2473 ms. (404 steps per ms)
BEST_FIRST walk for 1000001 steps (356 resets) in 945 ms. (1057 steps per ms)
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2025-06-05 15:55:37] [INFO ] Flatten gal took : 23 ms
[2025-06-05 15:55:37] [INFO ] Flatten gal took : 8 ms
[2025-06-05 15:55:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1668333040825477636.gal : 5 ms
[2025-06-05 15:55:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3251299474206619288.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/ReachabilityCardinality1668333040825477636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3251299474206619288.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 408024 ms.
BK_STOP 1749138937995
--------------------
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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-32, 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 r156-tall-174881254600773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 '
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 ;