About the Execution of 2024-gold for GPPP-PT-C0100N0000000100
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-174867015800041.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-C0100N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800041
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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 7.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 17 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1 May 29 14:32 large_marking
-rw-r--r-- 1 mcc users 21K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748784606895
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-C0100N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:30:09] [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:30:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:30:09] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-01 13:30:09] [INFO ] Transformed 33 places.
[2025-06-01 13:30:09] [INFO ] Transformed 22 transitions.
[2025-06-01 13:30:09] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Current structural bounds on expressions (Initially) : Max Seen:[700, 200, 200, 0, 0, 0, 1, 300, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[700, 200, 200, 0, 0, 0, 1, 300, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 22 rows 33 cols
[2025-06-01 13:30:09] [INFO ] Computed 12 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[700, 200, 200, 0, 0, 0, 1, 300, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[700, 200, 200, 600, 900, 200, 1, 1832862, 200, 200, 200, 200, 960600, 700, 450, 700]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-00 700 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10025 steps (3 resets) in 41 ms. (238 steps per ms)
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-15 700 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100009 steps (20 resets) in 205 ms. (485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6, 7, 300, 7, 7, 7, 300, 10, 400] Max Struct:[600, 900, 200, 1832862, 200, 200, 200, 960600, 700, 450]
[2025-06-01 13:30:10] [INFO ] Invariant cache hit.
[2025-06-01 13:30:10] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2025-06-01 13:30:10] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 35 ms returned sat
[2025-06-01 13:30:10] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2025-06-01 13:30:10] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-01 13:30:10] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-01 13:30:10] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-01 13:30:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:30:11] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 558 ms returned sat
[2025-06-01 13:30:11] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-01 13:30:11] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 18 ms.
[2025-06-01 13:30:11] [INFO ] Added : 14 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 151 ms.
[2025-06-01 13:30:11] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:30:11] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-01 13:30:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-01 13:30:12] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-01 13:30:12] [INFO ] Added : 15 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 77 ms.
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-01 13:30:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-01 13:30:12] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 13:30:12] [INFO ] Added : 18 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 54 ms.
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 13:30:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-01 13:30:12] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 13:30:12] [INFO ] Added : 16 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 96 ms.
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:30:12] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-01 13:30:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-01 13:30:13] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 13:30:13] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 98 ms.
[2025-06-01 13:30:13] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2025-06-01 13:30:13] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 13:30:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:30:13] [INFO ] [Nat]Absence check using state equation in 59 ms returned unsat
[2025-06-01 13:30:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 13:30:13] [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:[1, 6, 7, 300, 7, 7, 7, 300, 10, 400] Max Struct:[1, 900, 200, 300, 200, 200, 200, 300, 10, 400]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-14 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-12 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-07 300 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10, 10, 10, 10] Max Struct:[900, 200, 200, 200, 200]
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 21
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 6 place count 29 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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 19
Applied a total of 8 rules in 36 ms. Remains 28 /33 variables (removed 5) and now considering 19/22 (removed 3) transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 19 rows 28 cols
[2025-06-01 13:30:14] [INFO ] Computed 10 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem TDEAD18 is UNSAT
At refinement iteration 5 (OVERLAPS) 19/47 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 38 constraints, problems are : Problem set: 1 solved, 17 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28/47 variables, and 10 constraints, problems are : Problem set: 1 solved, 17 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/28 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 20373ms problems are : Problem set: 1 solved, 17 unsolved
Search for dead transitions found 1 dead transitions in 20386ms
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 : 28/33 places, 18/22 transitions.
Graph (complete) has 68 edges and 28 vertex of which 27 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 6 ms. Remains 27 /28 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20449 ms. Remains : 27/33 places, 18/22 transitions.
// Phase 1: matrix 18 rows 27 cols
[2025-06-01 13:30:35] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10, 10, 10, 10] Max Struct:[900, 200, 200, 200, 200]
RANDOM walk for 1000250 steps (752 resets) in 669 ms. (1492 steps per ms)
BEST_FIRST walk for 5000002 steps (624 resets) in 2535 ms. (1971 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10, 10, 10, 10] Max Struct:[900, 200, 200, 200, 200]
[2025-06-01 13:30:38] [INFO ] Invariant cache hit.
[2025-06-01 13:30:38] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:38] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 9 ms returned sat
[2025-06-01 13:30:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 13:30:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-01 13:30:46] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 7989 ms returned sat
[2025-06-01 13:30:48] [INFO ] [Nat]Absence check using state equation in 2235 ms returned unsat
[2025-06-01 13:30:48] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 13:30:48] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-01 13:30:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 13:30:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 13:30:48] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 127 ms returned sat
[2025-06-01 13:30:49] [INFO ] [Nat]Absence check using state equation in 231 ms returned unsat
[2025-06-01 13:30:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 13:30:49] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-01 13:30:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 13:30:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-01 13:30:50] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 807 ms returned sat
[2025-06-01 13:30:50] [INFO ] [Nat]Absence check using state equation in 891 ms returned unsat
[2025-06-01 13:30:51] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:30:51] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 5 ms returned sat
[2025-06-01 13:30:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 13:30:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-01 13:30:51] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 886 ms returned sat
[2025-06-01 13:30:52] [INFO ] [Nat]Absence check using state equation in 879 ms returned unsat
[2025-06-01 13:30:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-01 13:30:52] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-01 13:30:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-01 13:30:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:30:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 13:30:53] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 766 ms returned sat
[2025-06-01 13:30:54] [INFO ] [Nat]Absence check using state equation in 1125 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10, 10, 10, 10] Max Struct:[10, 10, 10, 10, 10]
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000100-UpperBounds-04 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:30:55] [INFO ] Flatten gal took : 35 ms
[2025-06-01 13:30:55] [INFO ] Flatten gal took : 12 ms
[2025-06-01 13:30:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17300610388193445851.gal : 6 ms
[2025-06-01 13:30:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3273242157958356030.prop : 0 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/ReachabilityCardinality17300610388193445851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3273242157958356030.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 45754 ms.
BK_STOP 1748784655319
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000000100"
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-C0100N0000000100, 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-174867015800041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000100.tgz
mv GPPP-PT-C0100N0000000100 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 ;