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

About the Execution of 2024-gold for HouseConstruction-PT-02000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.450 25681.00 30342.00 199.00 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 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-174876435700028.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 HouseConstruction-PT-02000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 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 13K 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 HouseConstruction-PT-02000-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-02000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748773877203

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-02000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:31:18] [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 10:31:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:31:18] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2025-06-01 10:31:18] [INFO ] Transformed 26 places.
[2025-06-01 10:31:18] [INFO ] Transformed 18 transitions.
[2025-06-01 10:31:18] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 18 rows 26 cols
[2025-06-01 10:31:18] [INFO ] Computed 8 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10007 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 130 ms. (1221 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[159, 20, 17, 159, 33, 18, 17, 30, 30, 30, 165, 2000, 18, 23, 69, 17] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 10:31:18] [INFO ] Invariant cache hit.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:31:19] [INFO ] Added : 6 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:31:19] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:19] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:31:19] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:19] [INFO ] Added : 12 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 12 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:19] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:19] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:19] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:31:19] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:19] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:31:19] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:19] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 14 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 10:31:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:31:20] [INFO ] Added : 14 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 10:31:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:31:20] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:31:20] [INFO ] Added : 10 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[159, 20, 17, 159, 33, 18, 17, 30, 30, 30, 165, 2000, 18, 23, 69, 17] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 2000, +inf, +inf, +inf, +inf]
FORMULA HouseConstruction-PT-02000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 18/18 transitions.
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 1 rules applied. Total rules applied 1 place count 26 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 24 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 24 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 23 transition count 15
Applied a total of 6 rules in 38 ms. Remains 23 /26 variables (removed 3) and now considering 15/18 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 23/26 places, 15/18 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 15 rows 23 cols
[2025-06-01 10:31:36] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000533 steps (33 resets) in 164 ms. (6063 steps per ms)
BEST_FIRST walk for 15000014 steps (60 resets) in 4980 ms. (3011 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 10:31:42] [INFO ] Invariant cache hit.
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 2 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 10:31:42] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000] Max Struct:[2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000, 2000]
FORMULA HouseConstruction-PT-02000-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-02000-UpperBounds-00 2000 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-01 10:31:42] [INFO ] Flatten gal took : 19 ms
[2025-06-01 10:31:42] [INFO ] Flatten gal took : 10 ms
[2025-06-01 10:31:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14219981383855875312.gal : 3 ms
[2025-06-01 10:31:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18195251496264225658.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/ReachabilityCardinality14219981383855875312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18195251496264225658.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 24327 ms.

BK_STOP 1748773902884

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="HouseConstruction-PT-02000"
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 HouseConstruction-PT-02000, 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-174876435700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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