Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460400071.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-COL-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460400071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 11K Apr 11 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 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

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717109263359

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-30 22:47:45] [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]
[2024-05-30 22:47:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:47:45] [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.
[2024-05-30 22:47:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 22:47:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 738 ms
[2024-05-30 22:47:46] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2024-05-30 22:47:46] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-30 22:47:46] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-30 22:47:46] [INFO ] Computed 26 invariants in 8 ms
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 22:47:46] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-30 22:47:46] [INFO ] Computed 26 invariants in 5 ms
[2024-05-30 22:47:46] [INFO ] [Real]Absence check using 11 positive place invariants in 86 ms returned sat
[2024-05-30 22:47:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 111 ms returned sat
[2024-05-30 22:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:46] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-30 22:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:47] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-30 22:47:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 22:47:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-30 22:47:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-30 22:47:47] [INFO ] Added : 3 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 20 ms.
[2024-05-30 22:47:47] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:47] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-30 22:47:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:47] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-30 22:47:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 37 ms returned sat
[2024-05-30 22:47:47] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 12 ms to minimize.
[2024-05-30 22:47:47] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2024-05-30 22:47:47] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 22:47:47] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 22:47:47] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-30 22:47:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 413 ms
[2024-05-30 22:47:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 22:47:48] [INFO ] Added : 57 causal constraints over 12 iterations in 173 ms. Result :sat
Minimization took 25 ms.
[2024-05-30 22:47:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:48] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-30 22:47:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-05-30 22:47:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-30 22:47:48] [INFO ] Added : 59 causal constraints over 12 iterations in 196 ms. Result :sat
Minimization took 18 ms.
[2024-05-30 22:47:48] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-30 22:47:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:48] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-30 22:47:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-30 22:47:48] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 22:47:48] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 22:47:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2024-05-30 22:47:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 22:47:49] [INFO ] Added : 57 causal constraints over 12 iterations in 85 ms. Result :sat
Minimization took 37 ms.
[2024-05-30 22:47:49] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-30 22:47:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:49] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-30 22:47:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-30 22:47:49] [INFO ] Added : 58 causal constraints over 12 iterations in 120 ms. Result :sat
Minimization took 31 ms.
[2024-05-30 22:47:49] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-30 22:47:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:49] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-30 22:47:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-30 22:47:49] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-30 22:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-30 22:47:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-30 22:47:50] [INFO ] Added : 30 causal constraints over 6 iterations in 93 ms. Result :sat
Minimization took 19 ms.
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-30 22:47:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:50] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-30 22:47:50] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 22:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-30 22:47:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 22:47:50] [INFO ] Added : 22 causal constraints over 5 iterations in 201 ms. Result :sat
Minimization took 27 ms.
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-30 22:47:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:51] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-30 22:47:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2024-05-30 22:47:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 22:47:51] [INFO ] Added : 63 causal constraints over 16 iterations in 529 ms. Result :sat
Minimization took 52 ms.
[2024-05-30 22:47:51] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2024-05-30 22:47:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:51] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-30 22:47:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:51] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-30 22:47:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-30 22:47:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-30 22:47:51] [INFO ] Added : 34 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 27 ms.
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-30 22:47:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 33 ms returned sat
[2024-05-30 22:47:52] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 22:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-30 22:47:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-30 22:47:52] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2024-05-30 22:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-30 22:47:52] [INFO ] Added : 47 causal constraints over 10 iterations in 277 ms. Result :sat
Minimization took 38 ms.
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-30 22:47:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-30 22:47:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 22:47:52] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Minimization took 22 ms.
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-30 22:47:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-30 22:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:53] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-30 22:47:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 15 ms returned sat
[2024-05-30 22:47:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 22:47:53] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-30 22:47:53] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2024-05-30 22:47:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-30 22:47:53] [INFO ] Added : 61 causal constraints over 15 iterations in 365 ms. Result :sat
Minimization took 41 ms.
[2024-05-30 22:47:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-30 22:47:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-30 22:47:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-30 22:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:53] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-30 22:47:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2024-05-30 22:47:53] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
[2024-05-30 22:47:53] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-30 22:47:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2024-05-30 22:47:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 22:47:54] [INFO ] Added : 62 causal constraints over 16 iterations in 204 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [2, 10, 2, 2, 3, 1, 1, 10, 4, 2, 10, 2, 10, 10]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-30 22:47:54] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 91 ms.
[2024-05-30 22:47:54] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 13) seen :14
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :6
[2024-05-30 22:47:54] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-30 22:47:54] [INFO ] Computed 58 invariants in 86 ms
[2024-05-30 22:47:55] [INFO ] [Real]Absence check using 14 positive place invariants in 107 ms returned sat
[2024-05-30 22:47:55] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 271 ms returned unsat
[2024-05-30 22:47:55] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-30 22:47:55] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned sat
[2024-05-30 22:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:56] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2024-05-30 22:47:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:47:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2024-05-30 22:47:56] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 39 ms returned sat
[2024-05-30 22:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:47:57] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2024-05-30 22:47:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-30 22:47:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 1597 ms returned sat
[2024-05-30 22:47:59] [INFO ] Deduced a trap composed of 99 places in 466 ms of which 2 ms to minimize.
[2024-05-30 22:47:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 557 ms
[2024-05-30 22:47:59] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-30 22:47:59] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 40 ms returned sat
[2024-05-30 22:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:48:00] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-05-30 22:48:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:48:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-30 22:48:00] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 31 ms returned sat
[2024-05-30 22:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:48:01] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2024-05-30 22:48:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 22:48:05] [INFO ] [Nat]Added 120 Read/Feed constraints in 3455 ms returned sat
[2024-05-30 22:48:05] [INFO ] Deduced a trap composed of 442 places in 403 ms of which 1 ms to minimize.
[2024-05-30 22:48:05] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 536 ms
[2024-05-30 22:48:05] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2024-05-30 22:48:05] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 56 ms returned sat
[2024-05-30 22:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:48:06] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2024-05-30 22:48:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:48:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-30 22:48:07] [INFO ] [Nat]Absence check using 14 positive and 44 generalized place invariants in 38 ms returned sat
[2024-05-30 22:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:48:09] [INFO ] [Nat]Absence check using state equation in 2574 ms returned sat
[2024-05-30 22:48:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-30 22:48:11] [INFO ] [Nat]Added 120 Read/Feed constraints in 2261 ms returned unknown
[2024-05-30 22:48:11] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 28 ms returned unsat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 37 ms returned unsat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 32 ms returned unsat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-30 22:48:12] [INFO ] [Real]Absence check using 14 positive and 44 generalized place invariants in 33 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 3, 4, 1, 1, 1, 1] Max seen :[1, 1, 0, 0, 1, 1, 1, 1]
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 20 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 299 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
[2024-05-30 22:48:12] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-30 22:48:13] [INFO ] Computed 56 invariants in 47 ms
[2024-05-30 22:48:13] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 552/844 places, 1252/1652 transitions.
Reduce places removed 2 places and 20 transitions.
Graph (complete) has 3610 edges and 550 vertex of which 20 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.2 ms
Discarding 530 places :
Also discarding 1212 output transitions
Drop transitions removed 1212 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 3 rules in 15 ms. Remains 20 /552 variables (removed 532) and now considering 0/1252 (removed 1252) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1070 ms. Remains : 20/844 places, 0/1652 transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 28224 ms.

BK_STOP 1717109293977

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBLF-COL-S02J06T10, 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 r307-tajo-171654460400071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;