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.r265-tall-174931349600028.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 CopsAndRobbers-PT-HRL020X006, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349600028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 9.5K Jun 6 08:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 08:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Jun 6 11:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 11:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 17K Jun 6 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Jun 6 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 08:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 6 08:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 195K Jun 5 20:08 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 CopsAndRobbers-PT-HRL020X006-UpperBounds-00
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-01
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-02
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-03
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-04
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-05
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-06
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-07
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-08
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-09
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-10
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-11
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-12
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-13
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-14
FORMULA_NAME CopsAndRobbers-PT-HRL020X006-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318829128

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL020X006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:53:50] [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-07 17:53:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:50] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-07 17:53:50] [INFO ] Transformed 110 places.
[2025-06-07 17:53:50] [INFO ] Transformed 224 transitions.
[2025-06-07 17:53:50] [INFO ] Parsed PT model containing 110 places and 224 transitions and 1149 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 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:[0, 0, 1, 0, 0, 0, 0, 0, 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 224 rows 110 cols
[2025-06-07 17:53:50] [INFO ] Computed 24 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 6, 20, 6, 1, 6, 1, 6, 6, 6, 6, 6, 6, 6, 6, 1]
RANDOM walk for 10002 steps (8 resets) in 35 ms. (277 steps per ms)
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (110 resets) in 71 ms. (694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 2, 3] Max Struct:[6, 20, 6, 6, 6]
[2025-06-07 17:53:50] [INFO ] Invariant cache hit.
[2025-06-07 17:53:50] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2025-06-07 17:53:50] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:50] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-07 17:53:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-07 17:53:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-07 17:53:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2025-06-07 17:53:51] [INFO ] Computed and/alt/rep : 180/1000/180 causal constraints (skipped 4 transitions) in 26 ms.
[2025-06-07 17:53:51] [INFO ] Added : 2 causal constraints over 1 iterations in 76 ms. Result :sat
Minimization took 93 ms.
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned unsat
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-07 17:53:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:53:51] [INFO ] Computed and/alt/rep : 180/1000/180 causal constraints (skipped 4 transitions) in 18 ms.
[2025-06-07 17:53:51] [INFO ] Added : 4 causal constraints over 1 iterations in 48 ms. Result :sat
Minimization took 75 ms.
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-07 17:53:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-07 17:53:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 8 ms returned sat
[2025-06-07 17:53:51] [INFO ] Computed and/alt/rep : 180/1000/180 causal constraints (skipped 4 transitions) in 18 ms.
[2025-06-07 17:53:51] [INFO ] Added : 3 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 81 ms.
[2025-06-07 17:53:52] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:52] [INFO ] [Real]Absence check using 23 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 17:53:52] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-07 17:53:52] [INFO ] [Real]Added 60 Read/Feed constraints in 8 ms returned sat
[2025-06-07 17:53:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2025-06-07 17:53:52] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:52] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-07 17:53:52] [INFO ] [Nat]Added 60 Read/Feed constraints in 13 ms returned sat
[2025-06-07 17:53:52] [INFO ] Computed and/alt/rep : 180/1000/180 causal constraints (skipped 4 transitions) in 20 ms.
[2025-06-07 17:53:52] [INFO ] Added : 17 causal constraints over 4 iterations in 178 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 2, 3] Max Struct:[6, 1, 6, 6, 6]
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 1, 2, 3] Max Struct:[6, 6, 6, 6]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 224/224 transitions.
Graph (complete) has 650 edges and 110 vertex of which 94 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 93 transition count 223
Applied a total of 3 rules in 57 ms. Remains 93 /110 variables (removed 17) and now considering 223/224 (removed 1) transitions.
Running 183 sub problems to find dead transitions.
// Phase 1: matrix 223 rows 93 cols
[2025-06-07 17:53:53] [INFO ] Computed 23 invariants in 5 ms
[2025-06-07 17:53:53] [INFO ] State equation strengthened by 60 read => feed constraints.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 20/20 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/89 variables, 2/23 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 223/312 variables, 89/112 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 60/172 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/172 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 4/316 variables, 4/176 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/176 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/176 constraints. Problems are: Problem set: 40 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 176 constraints, problems are : Problem set: 40 solved, 143 unsolved in 4561 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 20/20 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/21 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/89 variables, 2/23 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 223/312 variables, 89/112 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 60/172 constraints. Problems are: Problem set: 40 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 123/295 constraints. Problems are: Problem set: 40 solved, 143 unsolved
[2025-06-07 17:54:09] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/296 constraints. Problems are: Problem set: 40 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/316 variables, and 296 constraints, problems are : Problem set: 40 solved, 143 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/93 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 123/183 constraints, Known Traps: 1/1 constraints]
After SMT, in 25006ms problems are : Problem set: 40 solved, 143 unsolved
Search for dead transitions found 40 dead transitions in 25032ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/110 places, 183/224 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 93 transition count 182
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 2 place count 92 transition count 182
Applied a total of 2 rules in 16 ms. Remains 92 /93 variables (removed 1) and now considering 182/183 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25137 ms. Remains : 92/110 places, 182/224 transitions.
// Phase 1: matrix 182 rows 92 cols
[2025-06-07 17:54:18] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 1, 2, 3] Max Struct:[6, 6, 6, 6]
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (1898 resets) in 857 ms. (1165 steps per ms)
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-HRL020X006-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2267 resets) in 689 ms. (1449 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-07 17:54:19] [INFO ] Flatten gal took : 46 ms
[2025-06-07 17:54:19] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:54:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3529994136097062790.gal : 10 ms
[2025-06-07 17:54:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2385381168478056922.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/ReachabilityCardinality3529994136097062790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2385381168478056922.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 29704 ms.

BK_STOP 1749318860139

--------------------
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="CopsAndRobbers-PT-HRL020X006"
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 CopsAndRobbers-PT-HRL020X006, 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 r265-tall-174931349600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL020X006.tgz
mv CopsAndRobbers-PT-HRL020X006 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;