About the Execution of ITS-Tools for GPPP-PT-C1000N0000001000
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007800373.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-C1000N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007800373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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-C1000N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000001000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748954404467
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-C1000N0000001000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-03 12:40:06] [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-03 12:40:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:40:07] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-03 12:40:07] [INFO ] Transformed 33 places.
[2025-06-03 12:40:07] [INFO ] Transformed 22 transitions.
[2025-06-03 12:40:07] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1000, 0, 0, 3000, 2000, 0, 2000, 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, 1000, 0, 0, 3000, 2000, 0, 2000, 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-03 12:40:07] [INFO ] Invariants computation overflowed in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1000, 0, 0, 3000, 2000, 0, 2000, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 12008 steps (2 resets) in 22 ms. (522 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 392 ms. (407 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[104, 11000, 3000, 7, 4000, 3, 7, 1000, 7000, 3, 3000, 2000, 4000, 2000, 7, 404] 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-03 12:40:07] [INFO ] Invariants computation overflowed in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:08] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-03 12:40:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:08] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-03 12:40:08] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-03 12:40:08] [INFO ] Added : 12 causal constraints over 4 iterations in 114 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:08] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:08] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:08] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-03 12:40:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:08] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-03 12:40:08] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-03 12:40:08] [INFO ] Added : 20 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 85 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 12:40:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 12:40:09] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 12:40:09] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 12:40:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-03 12:40:09] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 12:40:09] [INFO ] Added : 16 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 12:40:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:09] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-03 12:40:09] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 12:40:09] [INFO ] Added : 19 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 38 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 12:40:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 12:40:10] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 12:40:10] [INFO ] Added : 17 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 12:40:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 12:40:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 12:40:10] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 12:40:10] [INFO ] Added : 13 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[104, 11000, 3000, 7, 4000, 3, 7, 1000, 7000, 3, 3000, 2000, 4000, 2000, 7, 404] Max Struct:[+inf, 11000, 3000, +inf, 4000, +inf, +inf, 1000, 7000, +inf, 3000, 2000, 4000, 2000, +inf, +inf]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-12 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-10 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-08 7000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-02 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-01 11000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3998, 10, 4, 10, 4, 10, 2000] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 19
Applied a total of 3 rules in 44 ms. Remains 31 /33 variables (removed 2) and now considering 19/22 (removed 3) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 19 rows 31 cols
[2025-06-03 12:40:23] [INFO ] Invariants computation overflowed in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/49 variables, 30/30 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/50 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 31 constraints, problems are : Problem set: 1 solved, 17 unsolved in 331 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/48 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 12/41 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/50 variables, 2/43 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 5/48 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 48 constraints, problems are : Problem set: 1 solved, 17 unsolved in 1238 ms.
Refiners :[State Equation: 31/31 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1607ms problems are : Problem set: 1 solved, 17 unsolved
Search for dead transitions found 1 dead transitions in 1617ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/33 places, 18/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1685 ms. Remains : 31/33 places, 18/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
// Phase 1: matrix 18 rows 31 cols
[2025-06-03 12:40:25] [INFO ] Computed 13 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3998, 10, 4, 10, 4, 10, 2000] Max Struct:[-78583192, -31958, -90, -95866, -19635, -95866, 2000]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000717 steps (35 resets) in 697 ms. (1433 steps per ms)
BEST_FIRST walk for 6000004 steps (39 resets) in 3113 ms. (1926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3998, 10, 4, 10, 4, 10] Max Struct:[-78583192, -31958, -90, -95866, -19635, -95866]
[2025-06-03 12:40:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-03 12:40:29] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-03 12:40:29] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:29] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:40:29] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 6 ms returned sat
[2025-06-03 12:40:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 12:40:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-03 12:40:38] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:40:41] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 11607 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:41] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-03 12:40:41] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-03 12:40:41] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:41] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-03 12:40:41] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-03 12:40:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 12:40:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-03 12:40:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:40:54] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 13505 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:40:54] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-03 12:40:54] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 12:40:54] [INFO ] [Real]Absence check using 8 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-03 12:40:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 12:40:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:40:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-03 12:41:03] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:41:08] [INFO ] [Nat]Absence check using 8 positive and 5 generalized place invariants in 13507 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3998, 10, 4, 10, 4, 10] Max Struct:[3998, 10, 4, -95866, 4, -95866]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-00 3998 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 18/18 transitions.
Graph (complete) has 75 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 5 rules applied. Total rules applied 6 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 0 with 3 rules applied. Total rules applied 9 place count 25 transition count 15
Applied a total of 9 rules in 14 ms. Remains 25 /31 variables (removed 6) and now considering 15/18 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 25/31 places, 15/18 transitions.
// Phase 1: matrix 15 rows 25 cols
[2025-06-03 12:41:08] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
RANDOM walk for 1000172 steps (82 resets) in 404 ms. (2469 steps per ms)
BEST_FIRST walk for 2000001 steps (32 resets) in 1295 ms. (1543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
[2025-06-03 12:41:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:10] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-03 12:41:10] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 8 ms returned sat
[2025-06-03 12:41:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 12:41:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-03 12:41:10] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-03 12:41:19] [INFO ] [Nat]Absence check using state equation in 9008 ms returned unknown
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-03 12:41:19] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 12:41:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:41:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-03 12:41:19] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 12:41:28] [INFO ] [Nat]Absence check using state equation in 9007 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-03 12:41:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:41:28] [INFO ] Implicit Places using invariants in 69 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/25 places, 15/15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 14
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 4 place count 20 transition count 13
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 20 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19 transition count 12
Applied a total of 6 rules in 5 ms. Remains 19 /22 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 19 cols
[2025-06-03 12:41:28] [INFO ] Invariants computation overflowed in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:41:28] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 12 rows 19 cols
[2025-06-03 12:41:28] [INFO ] Invariants computation overflowed in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:41:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 82 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 18/25 places, 12/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 166 ms. Remains : 18/25 places, 12/15 transitions.
// Phase 1: matrix 12 rows 18 cols
[2025-06-03 12:41:28] [INFO ] Invariants computation overflowed in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
RANDOM walk for 1002675 steps (124 resets) in 432 ms. (2315 steps per ms)
BEST_FIRST walk for 2000002 steps (62 resets) in 770 ms. (2594 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[-95866, -95866]
// Phase 1: matrix 12 rows 18 cols
[2025-06-03 12:41:29] [INFO ] Invariants computation overflowed in 0 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:41:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:41:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 12:41:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[10, 10]
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000001000-UpperBounds-06 10 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-03 12:41:30] [INFO ] Flatten gal took : 32 ms
[2025-06-03 12:41:30] [INFO ] Flatten gal took : 7 ms
[2025-06-03 12:41:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8341793326154615126.gal : 7 ms
[2025-06-03 12:41:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12961883637901858735.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/ReachabilityCardinality8341793326154615126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12961883637901858735.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 83353 ms.
BK_STOP 1748954490340
--------------------
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-C1000N0000001000"
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-C1000N0000001000, 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-174867007800373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;