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-171654460500131.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-S06J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460500131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 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-S06J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717114746843

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-S06J06T08
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 00:19:08] [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-31 00:19:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:19:08] [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-31 00:19:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 00:19:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 695 ms
[2024-05-31 00:19:09] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 894 PT places and 14420.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-31 00:19:09] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-31 00:19:09] [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-31 00:19:09] [INFO ] Computed 26 invariants in 11 ms
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 00:19:09] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-31 00:19:09] [INFO ] Computed 26 invariants in 3 ms
[2024-05-31 00:19:09] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 00:19:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:09] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-31 00:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:10] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-31 00:19:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 00:19:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-31 00:19:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 00:19:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
[2024-05-31 00:19:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-31 00:19:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2024-05-31 00:19:10] [INFO ] Added : 37 causal constraints over 8 iterations in 199 ms. Result :sat
Minimization took 21 ms.
[2024-05-31 00:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 00:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:10] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-31 00:19:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-31 00:19:10] [INFO ] Added : 58 causal constraints over 12 iterations in 123 ms. Result :sat
Minimization took 135 ms.
[2024-05-31 00:19:10] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-31 00:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 28 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:11] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-05-31 00:19:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 00:19:11] [INFO ] Added : 54 causal constraints over 11 iterations in 165 ms. Result :sat
Minimization took 72 ms.
[2024-05-31 00:19:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 20 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 00:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:11] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-31 00:19:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-31 00:19:11] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-31 00:19:11] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-31 00:19:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-05-31 00:19:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-31 00:19:12] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-05-31 00:19:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-31 00:19:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-31 00:19:12] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-31 00:19:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 350 ms
[2024-05-31 00:19:12] [INFO ] Added : 54 causal constraints over 13 iterations in 546 ms. Result :sat
Minimization took 53 ms.
[2024-05-31 00:19:12] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-31 00:19:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:12] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-31 00:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:12] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2024-05-31 00:19:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 00:19:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 00:19:12] [INFO ] Added : 3 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 16 ms.
[2024-05-31 00:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:13] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-31 00:19:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:13] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-31 00:19:13] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-31 00:19:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-31 00:19:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-31 00:19:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 00:19:13] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-31 00:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-31 00:19:13] [INFO ] Added : 54 causal constraints over 11 iterations in 260 ms. Result :sat
Minimization took 45 ms.
[2024-05-31 00:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 00:19:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 00:19:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 27 ms returned sat
[2024-05-31 00:19:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-31 00:19:14] [INFO ] Added : 58 causal constraints over 12 iterations in 165 ms. Result :sat
Minimization took 53 ms.
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 00:19:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2024-05-31 00:19:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-31 00:19:14] [INFO ] Added : 57 causal constraints over 12 iterations in 185 ms. Result :sat
Minimization took 22 ms.
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 16 ms returned unsat
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:14] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 00:19:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:14] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 00:19:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 34 ms returned sat
[2024-05-31 00:19:15] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2024-05-31 00:19:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-31 00:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 00:19:15] [INFO ] Added : 59 causal constraints over 13 iterations in 126 ms. Result :sat
Minimization took 24 ms.
[2024-05-31 00:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 00:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:15] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-05-31 00:19:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 00:19:15] [INFO ] Added : 57 causal constraints over 12 iterations in 154 ms. Result :sat
Minimization took 122 ms.
[2024-05-31 00:19:15] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:15] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-31 00:19:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:15] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-31 00:19:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-31 00:19:15] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-31 00:19:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-31 00:19:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 00:19:16] [INFO ] Added : 29 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 57 ms.
[2024-05-31 00:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:16] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 00:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:16] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 00:19:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-31 00:19:16] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-31 00:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-31 00:19:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:19:16] [INFO ] Added : 58 causal constraints over 12 iterations in 136 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 00:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:16] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 00:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:19:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:19:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 00:19:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-31 00:19:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:19:16] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-31 00:19:17] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-31 00:19:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-31 00:19:17] [INFO ] Added : 43 causal constraints over 9 iterations in 205 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1, 2, 1, 7, 4, 8, 6, 1, 1, 8, 40, 8, 6, 8]
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-09 1 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-31 00:19:17] [INFO ] Unfolded HLPN to a Petri net with 894 places and 14334 transitions 119772 arcs in 342 ms.
[2024-05-31 00:19:17] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :32
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :16
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 00:19:18] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2024-05-31 00:19:18] [INFO ] Computed 62 invariants in 202 ms
[2024-05-31 00:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2024-05-31 00:19:18] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 20 ms returned unsat
[2024-05-31 00:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2024-05-31 00:19:18] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 29 ms returned unsat
[2024-05-31 00:19:18] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2024-05-31 00:19:18] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 27 ms returned unsat
[2024-05-31 00:19:19] [INFO ] [Real]Absence check using 23 positive place invariants in 47 ms returned sat
[2024-05-31 00:19:19] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 43 ms returned unsat
[2024-05-31 00:19:19] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned unsat
[2024-05-31 00:19:19] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2024-05-31 00:19:19] [INFO ] [Real]Absence check using 23 positive and 39 generalized place invariants in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 4, 1] Max seen :[1, 1, 1, 1, 4, 1]
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10621 ms.

BK_STOP 1717114759670

--------------------
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-S06J06T08"
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-S06J06T08, 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-171654460500131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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