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

About the Execution of 2024-gold for QuasiCertifProtocol-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15688.470 57618.00 68636.00 269.40 1 1 19 361 1 19 1 1 1 1 1 1 1 1 10 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266200101.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 gold2024
Input is QuasiCertifProtocol-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 226K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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 24K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 556K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 219K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 360K 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-PT-18-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900359185

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:39:20] [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-02 21:39:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:39:20] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-02 21:39:20] [INFO ] Transformed 1398 places.
[2025-06-02 21:39:20] [INFO ] Transformed 296 transitions.
[2025-06-02 21:39:20] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1, 19, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 1, 19, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 296 rows 1398 cols
[2025-06-02 21:39:20] [INFO ] Computed 1103 invariants in 73 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 19, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 361, +inf, 1, +inf, 1, 1, 19, +inf, 1, +inf, 10, +inf]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (442 resets) in 110 ms. (90 steps per ms)
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (377 resets) in 240 ms. (497 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 361, +inf, +inf, 1, 19, +inf, 1, +inf, 10, +inf]
[2025-06-02 21:39:21] [INFO ] Invariant cache hit.
[2025-06-02 21:39:21] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2025-06-02 21:39:22] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 427 ms returned sat
[2025-06-02 21:39:22] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2025-06-02 21:39:22] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 52 ms.
[2025-06-02 21:39:23] [INFO ] Added : 24 causal constraints over 5 iterations in 359 ms. Result :sat
Minimization took 689 ms.
[2025-06-02 21:39:24] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:39:24] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 190 ms returned sat
[2025-06-02 21:39:24] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-06-02 21:39:24] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 24 ms.
[2025-06-02 21:39:25] [INFO ] Added : 19 causal constraints over 4 iterations in 241 ms. Result :sat
Minimization took 645 ms.
[2025-06-02 21:39:25] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2025-06-02 21:39:26] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 167 ms returned sat
[2025-06-02 21:39:26] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2025-06-02 21:39:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2025-06-02 21:39:26] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 178 ms returned sat
[2025-06-02 21:39:27] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2025-06-02 21:39:27] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2025-06-02 21:39:28] [INFO ] Added : 59 causal constraints over 12 iterations in 541 ms. Result :sat
Minimization took 602 ms.
[2025-06-02 21:39:29] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 21:39:29] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 179 ms returned sat
[2025-06-02 21:39:30] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2025-06-02 21:39:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 21:39:31] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 197 ms returned sat
[2025-06-02 21:39:31] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2025-06-02 21:39:31] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:39:32] [INFO ] Added : 64 causal constraints over 13 iterations in 535 ms. Result :sat
Minimization took 606 ms.
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 197 ms returned unsat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 183 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2025-06-02 21:39:33] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 24 ms.
[2025-06-02 21:39:34] [INFO ] Added : 39 causal constraints over 8 iterations in 419 ms. Result :sat
Minimization took 698 ms.
[2025-06-02 21:39:35] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 21:39:35] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 187 ms returned sat
[2025-06-02 21:39:35] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-06-02 21:39:35] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 30 ms.
[2025-06-02 21:39:36] [INFO ] Added : 97 causal constraints over 20 iterations in 898 ms. Result :sat
Minimization took 805 ms.
[2025-06-02 21:39:37] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 21:39:38] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 190 ms returned sat
[2025-06-02 21:39:38] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-06-02 21:39:38] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 21 ms.
[2025-06-02 21:39:38] [INFO ] Added : 32 causal constraints over 7 iterations in 346 ms. Result :sat
Minimization took 613 ms.
[2025-06-02 21:39:39] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 21:39:39] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 175 ms returned sat
[2025-06-02 21:39:40] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2025-06-02 21:39:40] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 29 ms.
[2025-06-02 21:39:40] [INFO ] Added : 70 causal constraints over 14 iterations in 641 ms. Result :sat
Minimization took 681 ms.
[2025-06-02 21:39:41] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 21:39:42] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 164 ms returned sat
[2025-06-02 21:39:42] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2025-06-02 21:39:42] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:39:43] [INFO ] Added : 45 causal constraints over 9 iterations in 449 ms. Result :sat
Minimization took 612 ms.
[2025-06-02 21:39:43] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2025-06-02 21:39:43] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 165 ms returned sat
[2025-06-02 21:39:44] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2025-06-02 21:39:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 21:39:44] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 172 ms returned sat
[2025-06-02 21:39:45] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2025-06-02 21:39:45] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:39:46] [INFO ] Added : 88 causal constraints over 18 iterations in 742 ms. Result :sat
Minimization took 603 ms.
[2025-06-02 21:39:47] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 21:39:47] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 187 ms returned sat
[2025-06-02 21:39:47] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2025-06-02 21:39:47] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2025-06-02 21:39:48] [INFO ] Added : 36 causal constraints over 8 iterations in 373 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 19, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 361, +inf, 19, 1, 19, +inf, 1, +inf, 10, +inf]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-05 19 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] Max Struct:[1, 1, 361, +inf, 1, 19, +inf, 1, +inf, 10, +inf]
Support contains 389 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 620 are kept as prefixes of interest. Removing 778 places using SCC suffix rule.5 ms
Discarding 778 places :
Also discarding 36 output transitions
Drop transitions (Output transitions of discarded places.) removed 36 transitions
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 582 transition count 144
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 155 place count 582 transition count 107
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 53 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 1 with 127 rules applied. Total rules applied 282 place count 492 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 282 place count 492 transition count 106
Deduced a syphon composed of 1 places in 0 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 285 place count 490 transition count 106
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 303 place count 472 transition count 88
Iterating global reduction 1 with 18 rules applied. Total rules applied 321 place count 472 transition count 88
Applied a total of 321 rules in 67 ms. Remains 472 /1398 variables (removed 926) and now considering 88/296 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 472/1398 places, 88/296 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 88 rows 472 cols
[2025-06-02 21:39:49] [INFO ] Computed 385 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 361, +inf, 1, 1, +inf, 1, +inf, 10, +inf]
RANDOM walk for 1000000 steps (161478 resets) in 8247 ms. (121 steps per ms)
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4401238 steps (176984 resets) in 15331 ms. (287 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 361, 1, 1, 1] Max Struct:[361, +inf, +inf, +inf, +inf]
[2025-06-02 21:40:12] [INFO ] Invariant cache hit.
[2025-06-02 21:40:12] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-02 21:40:12] [INFO ] [Real]Absence check using 19 positive and 366 generalized place invariants in 48 ms returned sat
[2025-06-02 21:40:12] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-02 21:40:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:40:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Nat]Absence check using 19 positive and 366 generalized place invariants in 48 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-02 21:40:13] [INFO ] Computed and/alt/rep : 65/68/65 causal constraints (skipped 22 transitions) in 7 ms.
[2025-06-02 21:40:13] [INFO ] Added : 24 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 114 ms.
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using 19 positive and 366 generalized place invariants in 52 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using state equation in 147 ms returned unsat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using 19 positive and 366 generalized place invariants in 46 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using state equation in 74 ms returned unsat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2025-06-02 21:40:13] [INFO ] [Real]Absence check using 19 positive and 366 generalized place invariants in 56 ms returned sat
[2025-06-02 21:40:14] [INFO ] [Real]Absence check using state equation in 80 ms returned unsat
[2025-06-02 21:40:14] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2025-06-02 21:40:14] [INFO ] [Real]Absence check using 19 positive and 366 generalized place invariants in 50 ms returned sat
[2025-06-02 21:40:14] [INFO ] [Real]Absence check using state equation in 79 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[15, 361, 1, 1, 1] Max Struct:[361, 361, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-03 361 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[361]
Support contains 19 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 88/88 transitions.
Graph (complete) has 1233 edges and 472 vertex of which 48 are kept as prefixes of interest. Removing 424 places using SCC suffix rule.0 ms
Discarding 424 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 48 transition count 61
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 45 transition count 61
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 45 transition count 59
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 41 transition count 59
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 17 place count 41 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 40 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 39 transition count 57
Applied a total of 19 rules in 7 ms. Remains 39 /472 variables (removed 433) and now considering 57/88 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 39/472 places, 57/88 transitions.
// Phase 1: matrix 57 rows 39 cols
[2025-06-02 21:40:14] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[361]
RANDOM walk for 1000000 steps (25641 resets) in 1499 ms. (666 steps per ms)
BEST_FIRST walk for 1000001 steps (1055 resets) in 621 ms. (1607 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[361]
[2025-06-02 21:40:16] [INFO ] Invariant cache hit.
[2025-06-02 21:40:16] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[19]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 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-02 21:40:16] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:40:16] [INFO ] Flatten gal took : 6 ms
[2025-06-02 21:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11020321861515112750.gal : 5 ms
[2025-06-02 21:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8247288986898807607.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11020321861515112750.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8247288986898807607.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 56333 ms.

BK_STOP 1748900416803

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-PT-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is QuasiCertifProtocol-PT-18, 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 r167-tall-174881266200101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;