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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 12K Apr 11 17:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 11 17:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 17:22 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717114162847

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-S06J06T04
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 00:09:25] [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:09:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:09:25] [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:09:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 00:09:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 695 ms
[2024-05-31 00:09:26] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 50 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2024-05-31 00:09:26] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 18 ms.
[2024-05-31 00:09:26] [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:09:26] [INFO ] Computed 26 invariants in 7 ms
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 00:09:26] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-31 00:09:26] [INFO ] Computed 26 invariants in 8 ms
[2024-05-31 00:09:26] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:26] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 00:09:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:26] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-31 00:09:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 00:09:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-31 00:09:26] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-31 00:09:26] [INFO ] Added : 31 causal constraints over 7 iterations in 123 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 00:09:26] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 00:09:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:26] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 00:09:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-31 00:09:26] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 00:09:27] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 15 ms to minimize.
[2024-05-31 00:09:27] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2024-05-31 00:09:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2024-05-31 00:09:27] [INFO ] Added : 24 causal constraints over 6 iterations in 372 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 00:09:27] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:27] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 00:09:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:27] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-31 00:09:27] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 00:09:27] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-31 00:09:27] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 00:09:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-05-31 00:09:27] [INFO ] Added : 59 causal constraints over 13 iterations in 247 ms. Result :sat
Minimization took 45 ms.
[2024-05-31 00:09:27] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 00:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 25 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-31 00:09:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-31 00:09:28] [INFO ] Added : 9 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 34 ms.
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 00:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-31 00:09:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:09:28] [INFO ] Added : 10 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 46 ms.
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:28] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-31 00:09:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 26 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:28] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 00:09:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 00:09:28] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:09:28] [INFO ] Added : 56 causal constraints over 12 iterations in 84 ms. Result :sat
Minimization took 114 ms.
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 00:09:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 14 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2024-05-31 00:09:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:09:29] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-31 00:09:29] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2024-05-31 00:09:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2024-05-31 00:09:29] [INFO ] Added : 57 causal constraints over 12 iterations in 303 ms. Result :sat
Minimization took 22 ms.
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 00:09:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 65 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:29] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-31 00:09:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 00:09:29] [INFO ] Added : 12 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 00:09:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-31 00:09:30] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2024-05-31 00:09:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-05-31 00:09:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 00:09:30] [INFO ] Added : 61 causal constraints over 13 iterations in 199 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 00:09:30] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:30] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 00:09:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:30] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 34 ms returned sat
[2024-05-31 00:09:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 00:09:30] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-31 00:09:30] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-31 00:09:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2024-05-31 00:09:30] [INFO ] Added : 26 causal constraints over 6 iterations in 197 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 00:09:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 00:09:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-31 00:09:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:09:31] [INFO ] Added : 57 causal constraints over 12 iterations in 87 ms. Result :sat
Minimization took 22 ms.
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 00:09:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-31 00:09:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 00:09:31] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-31 00:09:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-31 00:09:31] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-31 00:09:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2024-05-31 00:09:31] [INFO ] Added : 59 causal constraints over 13 iterations in 371 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 00:09:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 30 ms returned sat
[2024-05-31 00:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:09:32] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 00:09:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2024-05-31 00:09:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:09:32] [INFO ] Added : 37 causal constraints over 9 iterations in 60 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 4, 36, 6, 4, 4, 6, 1, 1, 4, 4, 6]
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
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-31 00:09:32] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 188 ms.
[2024-05-31 00:09:32] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 13) seen :30
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :11
[2024-05-31 00:09:32] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2024-05-31 00:09:33] [INFO ] Computed 54 invariants in 124 ms
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 28 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 17 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 26 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 10 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 41 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 15 ms returned unsat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-31 00:09:33] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 4, 1, 1, 4] Max seen :[1, 1, 4, 1, 4, 1, 1, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8757 ms.

BK_STOP 1717114174197

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.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-S06J06T04"
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-S06J06T04, 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-171654460500121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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