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

About the Execution of 2024-gold for Kanban-PT-05000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15689.890 15372.00 19354.00 79.00 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 5000 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.r125-tall-174876435800071.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 Kanban-PT-05000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-05000-UpperBounds-00
FORMULA_NAME Kanban-PT-05000-UpperBounds-01
FORMULA_NAME Kanban-PT-05000-UpperBounds-02
FORMULA_NAME Kanban-PT-05000-UpperBounds-03
FORMULA_NAME Kanban-PT-05000-UpperBounds-04
FORMULA_NAME Kanban-PT-05000-UpperBounds-05
FORMULA_NAME Kanban-PT-05000-UpperBounds-06
FORMULA_NAME Kanban-PT-05000-UpperBounds-07
FORMULA_NAME Kanban-PT-05000-UpperBounds-08
FORMULA_NAME Kanban-PT-05000-UpperBounds-09
FORMULA_NAME Kanban-PT-05000-UpperBounds-10
FORMULA_NAME Kanban-PT-05000-UpperBounds-11
FORMULA_NAME Kanban-PT-05000-UpperBounds-12
FORMULA_NAME Kanban-PT-05000-UpperBounds-13
FORMULA_NAME Kanban-PT-05000-UpperBounds-14
FORMULA_NAME Kanban-PT-05000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748775706133

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-05000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 11:01:47] [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-01 11:01:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:01:47] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2025-06-01 11:01:47] [INFO ] Transformed 16 places.
[2025-06-01 11:01:47] [INFO ] Transformed 16 transitions.
[2025-06-01 11:01:47] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 5000, 0, 5000, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 5000, 0, 5000, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 16 rows 16 cols
[2025-06-01 11:01:47] [INFO ] Computed 5 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 5000, 0, 5000, 0, 0, 0, 0, 0, 0] Max Struct:[5000, 15000, 5000, 5000, 5000, 5000, 5000, 5000, 5000, 5000, 5000, 15000]
FORMULA Kanban-PT-05000-UpperBounds-06 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-UpperBounds-04 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10003 steps (1 resets) in 8 ms. (1111 steps per ms)
FORMULA Kanban-PT-05000-UpperBounds-10 5000 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (18 resets) in 84 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[417, 51, 48, 48, 24, 20, 417, 47, 51] Max Struct:[5000, 15000, 5000, 5000, 5000, 5000, 5000, 5000, 15000]
[2025-06-01 11:01:47] [INFO ] Invariant cache hit.
[2025-06-01 11:01:47] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2025-06-01 11:01:47] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:01:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 11:01:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 11:01:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 11:01:47] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:47] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 11:01:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:01:47] [INFO ] Added : 3 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:01:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 11:01:47] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:01:47] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 11:01:48] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:01:48] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 11:01:48] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:01:48] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Added : 14 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:01:48] [INFO ] Added : 3 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:01:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 11:01:48] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 11:01:48] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[417, 51, 48, 48, 24, 20, 417, 47, 51] Max Struct:[5000, 15000, 5000, 5000, 5000, 5000, 5000, 5000, 15000]
FORMULA Kanban-PT-05000-UpperBounds-09 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-05 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-15 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-11 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-13 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-08 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-07 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-05000-UpperBounds-02 5000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000, 5000, 5000] Max Struct:[5000, 15000, 15000]
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Ensure Unique test removed 1 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 2 rules applied. Total rules applied 3 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 8 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 7 transition count 7
Applied a total of 13 rules in 252 ms. Remains 7 /16 variables (removed 9) and now considering 7/16 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 7/16 places, 7/16 transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-01 11:02:01] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000, 5000, 5000] Max Struct:[5000, 5000, 5000]
FORMULA Kanban-PT-05000-UpperBounds-12 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-UpperBounds-01 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-UpperBounds-03 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-UpperBounds-14 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-UpperBounds-00 5000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000202 steps (2 resets) in 190 ms. (5236 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
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-01 11:02:01] [INFO ] Flatten gal took : 15 ms
[2025-06-01 11:02:01] [INFO ] Flatten gal took : 2 ms
[2025-06-01 11:02:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7440195919338869903.gal : 3 ms
[2025-06-01 11:02:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11580683173576934126.prop : 1 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/ReachabilityCardinality7440195919338869903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11580683173576934126.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 14040 ms.

BK_STOP 1748775721505

--------------------
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="Kanban-PT-05000"
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 Kanban-PT-05000, 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 r125-tall-174876435800071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-05000.tgz
mv Kanban-PT-05000 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 ;