Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007600245.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 GPPP-PT-C0001N0000000001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007600245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K 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 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000001-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748908536212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 23:55:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 23:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:55:39] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-02 23:55:39] [INFO ] Transformed 33 places.
[2025-06-02 23:55:39] [INFO ] Transformed 22 transitions.
[2025-06-02 23:55:39] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 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, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 22 rows 33 cols
[2025-06-02 23:55:39] [INFO ] Computed 13 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[2, +inf, 10, +inf, 2, 2, +inf, +inf, +inf, +inf, 2, 2, +inf, 2, +inf, +inf]
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 47 ms. (208 steps per ms)
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (20 resets) in 203 ms. (490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 2, 1, 2, 2, 1, 7, 1, 1, 4] Max Struct:[+inf, 10, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 23:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:39] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-06-02 23:55:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:39] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 23:55:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-02 23:55:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 29 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 23:55:40] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 23:55:40] [INFO ] Added : 21 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 23 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-02 23:55:40] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 23:55:40] [INFO ] Added : 5 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 26 ms.
[2025-06-02 23:55:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-02 23:55:40] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 23:55:40] [INFO ] Added : 5 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 21 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 23:55:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:41] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 23:55:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:41] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-02 23:55:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 23:55:41] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-02 23:55:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[5, 2, 1, 2, 2, 1, 7, 1, 1, 4] Max Struct:[5, 2, +inf, 2, +inf, 1, 7, 1, 1, 4]
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 20 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
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 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
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 13 place count 25 transition count 15
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 15 place count 24 transition count 14
Applied a total of 15 rules in 91 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 24 cols
[2025-06-02 23:55:41] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 48 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1983ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 1998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2118 ms. Remains : 24/33 places, 14/22 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
[2025-06-02 23:55:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2] Max Struct:[3, 5]
RANDOM walk for 1000000 steps (2 resets) in 1563 ms. (639 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1456 ms. (1372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3] Max Struct:[3, 5]
[2025-06-02 23:55:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:46] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-02 23:55:46] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-02 23:55:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 23:55:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 23:55:46] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 8 ms returned sat
[2025-06-02 23:55:46] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 23:55:46] [INFO ] Computed and/alt/rep : 13/28/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 23:55:46] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:46] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 23:55:46] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3] Max Struct:[3, 3]
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 14/14 transitions.
[2025-06-02 23:55:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 859 ms. (1162 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 715 ms. (1396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2025-06-02 23:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-02 23:55:48] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-02 23:55:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 23:55:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-06-02 23:55:48] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 23:55:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 23:55:48] [INFO ] Computed and/alt/rep : 13/28/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 23:55:48] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2025-06-02 23:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:48] [INFO ] Implicit Places using invariants in 102 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 105 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 21/24 places, 14/14 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 17 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 16 transition count 10
Applied a total of 9 rules in 7 ms. Remains 16 /21 variables (removed 5) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 16 cols
[2025-06-02 23:55:48] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 23:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:48] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 16/24 places, 10/14 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 245 ms. Remains : 16/24 places, 10/14 transitions.
[2025-06-02 23:55:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000000 steps (2 resets) in 990 ms. (1009 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 759 ms. (1315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2025-06-02 23:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 23:55:50] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 5 ms returned sat
[2025-06-02 23:55:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 23:55:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 23:55:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-02 23:55:50] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-02 23:55:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 23:55:50] [INFO ] Computed and/alt/rep : 9/21/9 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 23:55:50] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 16/16 places, 10/10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2025-06-02 23:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 23:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:50] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:55:50] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-02 23:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/26 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/26 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 32 constraints, problems are : Problem set: 0 solved, 9 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 783ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 16/16 places, 10/10 transitions.
RANDOM walk for 40001 steps (8 resets) in 1302 ms. (30 steps per ms) remains 2/2 properties
[2025-06-02 23:55:52] [INFO ] Flatten gal took : 51 ms
[2025-06-02 23:55:52] [INFO ] Flatten gal took : 18 ms
BEST_FIRST walk for 40002 steps (8 resets) in 969 ms. (41 steps per ms) remains 2/2 properties
[2025-06-02 23:55:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17252728115507203692.gal : 13 ms
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
[2025-06-02 23:55:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13660948275171833577.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17252728115507203692.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13660948275171833577.prop' '--nowitness' '--gen-order' 'FOLLOW'
Probably explored full state space saw : 59 states, properties seen :0
Probabilistic random walk after 157 steps, saw 59 distinct states, run finished after 30 ms. (steps per millisecond=5 ) properties seen :0

Explored full state space saw : 59 states, properties seen :0
Exhaustive walk after 157 steps, saw 59 distinct states, run finished after 21 ms. (steps per millisecond=7 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-03 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 13808 ms.

BK_STOP 1748908552761

--------------------
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="GPPP-PT-C0001N0000000001"
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 GPPP-PT-C0001N0000000001, 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 r100-smll-174867007600245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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