About the Execution of 2024-gold for GPPP-PT-C0100N0000010000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r111-smll-174867015800043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is GPPP-PT-C0100N0000010000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800043
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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-C0100N0000010000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000010000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748784692061
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000010000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:31:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 13:31:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:31:35] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-01 13:31:35] [INFO ] Transformed 33 places.
[2025-06-01 13:31:35] [INFO ] Transformed 22 transitions.
[2025-06-01 13:31:35] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 20000, 20000, 40000, 0, 0, 0, 200, 0, 0, 0, 0, 0, 0, 0, 300] 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, 20000, 20000, 40000, 0, 0, 0, 200, 0, 0, 0, 0, 0, 0, 0, 300] 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-01 13:31:35] [INFO ] Computed 12 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 20000, 20000, 40000, 0, 0, 0, 200, 0, 0, 0, 0, 0, 0, 0, 300] Max Struct:[900, 20000, 20000, 41400, 600, 450, 700, 200, 700, 8, 8, 960600, 3500, 20000, 700, 1832862]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-02 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-01 20000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10149 steps (3 resets) in 50 ms. (199 steps per ms)
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-14 700 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (24 resets) in 269 ms. (444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 40005, 1, 3, 10, 10, 2, 2, 300, 10, 796, 300] Max Struct:[900, 41400, 600, 450, 700, 700, 8, 8, 960600, 3500, 20000, 1832862]
[2025-06-01 13:31:35] [INFO ] Invariant cache hit.
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 14 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 13:31:36] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 13:31:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 13:31:36] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 13:31:36] [INFO ] Added : 13 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 48 ms.
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-01 13:31:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-01 13:31:36] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 13:31:36] [INFO ] Added : 17 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 13 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-01 13:31:37] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 13:31:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-01 13:31:37] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 13:31:37] [INFO ] Added : 12 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-01 13:31:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using state equation in 64 ms returned unsat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-01 13:31:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned unsat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-01 13:31:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Nat]Absence check using state equation in 25 ms returned unsat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:31:37] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 13:31:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:38] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:38] [INFO ] [Nat]Absence check using state equation in 140 ms returned unsat
[2025-06-01 13:31:38] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:31:38] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[8, 40005, 1, 3, 10, 10, 2, 2, 300, 10, 796, 300] Max Struct:[900, 41400, 1, 450, 10, 10, 2, 2, 300, 10, 796, 300]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-15 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-13 796 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-11 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 40007, 4] Max Struct:[900, 41400, 450]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 31 transition count 20
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 7 place count 29 transition count 19
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 10 place count 27 transition count 18
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 12 place count 26 transition count 17
Applied a total of 12 rules in 58 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
// Phase 1: matrix 17 rows 26 cols
[2025-06-01 13:31:38] [INFO ] Computed 10 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD16 is UNSAT
At refinement iteration 5 (OVERLAPS) 17/43 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 36 constraints, problems are : Problem set: 1 solved, 15 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 17/43 variables, 26/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 15/51 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 51 constraints, problems are : Problem set: 1 solved, 15 unsolved in 7384 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 7808ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 7823ms
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 : 26/33 places, 16/22 transitions.
Graph (complete) has 66 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 25 /26 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7909 ms. Remains : 25/33 places, 16/22 transitions.
// Phase 1: matrix 16 rows 25 cols
[2025-06-01 13:31:46] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 40007, 4] Max Struct:[900, 40700, 450]
RANDOM walk for 1000048 steps (760 resets) in 681 ms. (1466 steps per ms)
BEST_FIRST walk for 3000001 steps (302 resets) in 1756 ms. (1707 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 40007, 4] Max Struct:[900, 40700, 450]
[2025-06-01 13:31:49] [INFO ] Invariant cache hit.
[2025-06-01 13:31:49] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:31:49] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-01 13:31:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-01 13:31:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 13:31:53] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 13:31:58] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 9003 ms returned unknown
[2025-06-01 13:31:58] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:58] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned unsat
[2025-06-01 13:31:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:31:58] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-01 13:31:58] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 40007, 4] Max Struct:[900, 40007, 4]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-03 40007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[900]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/25 places, 16/16 transitions.
[2025-06-01 13:31:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[900]
RANDOM walk for 1000221 steps (762 resets) in 548 ms. (1821 steps per ms)
BEST_FIRST walk for 1000001 steps (137 resets) in 718 ms. (1390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[900]
[2025-06-01 13:31:59] [INFO ] Invariant cache hit.
[2025-06-01 13:31:59] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:31:59] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 5 ms returned sat
[2025-06-01 13:31:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 13:31:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:31:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:32:04] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 13:32:08] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 9003 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[900]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[900]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/25 places, 16/16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2025-06-01 13:32:08] [INFO ] Invariant cache hit.
[2025-06-01 13:32:08] [INFO ] Implicit Places using invariants in 88 ms returned [0, 3, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/25 places, 16/16 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 18 transition count 13
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 11 place count 16 transition count 11
Applied a total of 11 rules in 6 ms. Remains 16 /22 variables (removed 6) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 16 cols
[2025-06-01 13:32:08] [INFO ] Computed 6 invariants in 2 ms
[2025-06-01 13:32:08] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-01 13:32:08] [INFO ] Invariant cache hit.
[2025-06-01 13:32:08] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 15/25 places, 11/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 236 ms. Remains : 15/25 places, 11/16 transitions.
// Phase 1: matrix 11 rows 15 cols
[2025-06-01 13:32:08] [INFO ] Computed 5 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[900]
RANDOM walk for 1000297 steps (1143 resets) in 426 ms. (2342 steps per ms)
BEST_FIRST walk for 1000001 steps (244 resets) in 561 ms. (1779 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[900]
[2025-06-01 13:32:10] [INFO ] Invariant cache hit.
[2025-06-01 13:32:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 13:32:10] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 13:32:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 13:32:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:32:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 13:32:10] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 13:32:10] [INFO ] [Nat]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[10]
FORMULA GPPP-PT-C0100N0000010000-UpperBounds-00 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 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 13:32:10] [INFO ] Flatten gal took : 52 ms
[2025-06-01 13:32:10] [INFO ] Flatten gal took : 9 ms
[2025-06-01 13:32:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2470145061573749645.gal : 8 ms
[2025-06-01 13:32:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2109000149217727684.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2470145061573749645.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2109000149217727684.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 35852 ms.
BK_STOP 1748784730741
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000010000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is GPPP-PT-C0100N0000010000, 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 r111-smll-174867015800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000010000.tgz
mv GPPP-PT-C0100N0000010000 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 ;