About the Execution of 2024-gold for PGCD-COL-D03N050
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.r153-tall-174876824800084.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 PGCD-COL-D03N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 11K 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 PGCD-COL-D03N050-UpperBounds-00
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-01
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-02
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-03
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-04
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-05
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-06
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-07
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-08
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-09
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-10
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-11
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-12
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-13
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-14
FORMULA_NAME PGCD-COL-D03N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748841633156
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D03N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 05:20: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-02 05:20:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:20:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 05:20:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:20:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2025-06-02 05:20:35] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 3
[2025-06-02 05:20:35] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2025-06-02 05:20:35] [INFO ] Skeletonized 3 HLPN properties in 1 ms.
// Phase 1: matrix 3 rows 3 cols
[2025-06-02 05:20:35] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[4, 200, 4] Max Struct:[204, 204, 204]
[2025-06-02 05:20:35] [INFO ] Invariant cache hit.
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:20:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:20:35] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:20:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:20:35] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:20:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:20:35] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[4, 200, 4] Max Struct:[204, 204, 204]
Arc [1:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2025-06-02 05:20:35] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 11 ms.
[2025-06-02 05:20:35] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[4, 200, 4] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[4, 200, 4] Max Struct:[204, 204, 204]
Current structural bounds on expressions (Before main loop) : Max Seen:[4, 200, 4] Max Struct:[204, 204, 204]
// Phase 1: matrix 12 rows 12 cols
[2025-06-02 05:20:35] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 200, 4] Max Struct:[204, 204, 204]
RANDOM walk for 10032 steps (2 resets) in 11 ms. (836 steps per ms)
FORMULA PGCD-COL-D03N050-UpperBounds-03 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-06 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-07 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-09 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-10 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-13 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-14 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-02 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-08 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PGCD-COL-D03N050-UpperBounds-00 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 25 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[202] Max Struct:[204]
[2025-06-02 05:20:35] [INFO ] Invariant cache hit.
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:20:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:20:35] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:20:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:20:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:20:35] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:20:35] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[202] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[202] Max Struct:[204]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:20:35] [INFO ] Invariant cache hit.
[2025-06-02 05:20:35] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 12/12 places, 12/12 transitions.
[2025-06-02 05:20:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[202] Max Struct:[204]
RANDOM walk for 1000023 steps (2 resets) in 274 ms. (3636 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 309 ms. (3225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[202] Max Struct:[204]
[2025-06-02 05:20:36] [INFO ] Invariant cache hit.
[2025-06-02 05:20:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:20:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:20:36] [INFO ] [Real]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-02 05:20:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:20:36] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:20:36] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:20:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[202] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[202] Max Struct:[204]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:20:36] [INFO ] Invariant cache hit.
[2025-06-02 05:20:36] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36 ms. Remains : 8/12 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2025-06-02 05:20:36] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[202] Max Struct:[204]
RANDOM walk for 1000041 steps (2 resets) in 137 ms. (7246 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 230 ms. (4329 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[202] Max Struct:[204]
[2025-06-02 05:20:37] [INFO ] Invariant cache hit.
[2025-06-02 05:20:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:20:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:20:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:20:37] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:20:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:20:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:20:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:20:37] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:20:37] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 05:20:37] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[202] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[202] Max Struct:[204]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:20:37] [INFO ] Invariant cache hit.
[2025-06-02 05:20:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 05:20:37] [INFO ] Invariant cache hit.
[2025-06-02 05:20:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:20:37] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2025-06-02 05:20:37] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:20:37] [INFO ] Invariant cache hit.
[2025-06-02 05:20:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40053 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2025-06-02 05:20:37] [INFO ] Flatten gal took : 25 ms
[2025-06-02 05:20:37] [INFO ] Flatten gal took : 3 ms
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
[2025-06-02 05:20:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1462273887052666044.gal : 3 ms
[2025-06-02 05:20:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9479986309077801819.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/ReachabilityCardinality1462273887052666044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9479986309077801819.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
/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
Loading property file /tmp/ReachabilityCardinality9479986309077801819.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
Interrupted probabilistic random walk after 800020 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 800020 steps, saw 447219 distinct states, run finished after 3006 ms. (steps per millisecond=266 ) properties seen :0
[2025-06-02 05:20:40] [INFO ] Invariant cache hit.
[2025-06-02 05:20:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:20:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 1 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 20/20 variables, and 15 constraints, problems are : Problem set: 2 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 108ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PGCD-COL-D03N050-UpperBounds-04 202 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D03N050-UpperBounds-05 202 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D03N050-UpperBounds-11 202 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D03N050-UpperBounds-12 202 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D03N050-UpperBounds-15 202 TECHNIQUES REACHABILITY_MIN
FORMULA PGCD-COL-D03N050-UpperBounds-01 202 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 6156 ms.
BK_STOP 1748841640607
--------------------
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="PGCD-COL-D03N050"
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 PGCD-COL-D03N050, 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 r153-tall-174876824800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D03N050.tgz
mv PGCD-COL-D03N050 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 ;