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.r027-smll-174853774200024.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 BridgeAndVehicles-COL-V20P10N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774200024
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 222K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 40K 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 BridgeAndVehicles-COL-V20P10N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748544577096

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-05-29 18:49:39] [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-05-29 18:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:49:39] [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-05-29 18:49:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-29 18:49:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1174 ms
[2025-05-29 18:49:40] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 13
[2025-05-29 18:49:40] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2025-05-29 18:49:40] [INFO ] Skeletonized 13 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2025-05-29 18:49:40] [INFO ] Computed 4 invariants in 14 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 1, 1, 0, 0, 10, 1, 0, 20, 0, 0] Max Struct:[1, 1, 20, 1, 1, 10, 20, 10, 1, 10, 20, 20, 20]
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-05-29 18:49:40] [INFO ] Invariant cache hit.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-29 18:49:41] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 170 ms.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-29 18:49:41] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-29 18:49:41] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:49:41] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:49:41] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:49:41] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 18:49:41] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-29 18:49:41] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-29 18:49:41] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 10, 20, 10, 20, 20]
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-05-29 18:49:41] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 116 ms.
[2025-05-29 18:49:41] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 10, 20, 10, 20, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 10, 20, 10, 20, 20]
[2025-05-29 18:49:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2025-05-29 18:49:42] [INFO ] Computed 7 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 20, 10, 20, 10, 20, 20]
RANDOM walk for 10000 steps (57 resets) in 166 ms. (59 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (41 resets) in 231 ms. (86 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[10]
[2025-05-29 18:49:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
[2025-05-29 18:49:42] [INFO ] Invariant cache hit.
[2025-05-29 18:49:42] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 18:49:42] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-29 18:49:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:49:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 18:49:42] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-05-29 18:49:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 18:49:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 21 ms returned sat
[2025-05-29 18:49:42] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 132 ms.
[2025-05-29 18:49:43] [INFO ] Added : 21 causal constraints over 5 iterations in 282 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[10]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 967
Applied a total of 3 rules in 204 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
Running 964 sub problems to find dead transitions.
[2025-05-29 18:49:43] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2025-05-29 18:49:43] [INFO ] Computed 5 invariants in 6 ms
[2025-05-29 18:49:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 964 unsolved
[2025-05-29 18:49:54] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 22 ms to minimize.
[2025-05-29 18:49:58] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 6 ms to minimize.
Problem TDEAD507 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 75/244 variables, and 7 constraints, problems are : Problem set: 20 solved, 944 unsolved in 20088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/75 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 964/964 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 20 solved, 944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 944 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 944 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 169/244 variables, 75/82 constraints. Problems are: Problem set: 22 solved, 942 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 42/124 constraints. Problems are: Problem set: 22 solved, 942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/244 variables, and 1066 constraints, problems are : Problem set: 22 solved, 942 unsolved in 20705 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 942/964 constraints, Known Traps: 2/2 constraints]
After SMT, in 45757ms problems are : Problem set: 22 solved, 942 unsolved
Search for dead transitions found 22 dead transitions in 45829ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/78 places, 945/968 transitions.
Applied a total of 0 rules in 107 ms. Remains 75 /75 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46172 ms. Remains : 75/78 places, 945/968 transitions.
[2025-05-29 18:50:29] [INFO ] Flow matrix only has 166 transitions (discarded 779 similar events)
// Phase 1: matrix 166 rows 75 cols
[2025-05-29 18:50:29] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[10]
RANDOM walk for 1000000 steps (6657 resets) in 6292 ms. (158 steps per ms)
BEST_FIRST walk for 1000001 steps (2570 resets) in 2396 ms. (417 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P10N20-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-05-29 18:50:38] [INFO ] Flatten gal took : 218 ms
[2025-05-29 18:50:38] [INFO ] Flatten gal took : 163 ms
[2025-05-29 18:50:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13122151974351991467.gal : 81 ms
[2025-05-29 18:50:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3607680545531194077.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/ReachabilityCardinality13122151974351991467.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3607680545531194077.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

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 59860 ms.

BK_STOP 1748544639238

--------------------
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="BridgeAndVehicles-COL-V20P10N20"
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 BridgeAndVehicles-COL-V20P10N20, 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 r027-smll-174853774200024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N20.tgz
mv BridgeAndVehicles-COL-V20P10N20 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 ;