fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r307-tajo-171654460500116
Last Updated
July 7, 2024

About the Execution of 2023-gold for PolyORBLF-COL-S06J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
599.012 23986.00 35816.00 63.10 1 1 1 1 1 1 8 1 8 4 1 1 3 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K Apr 11 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-S06J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717113942738

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-S06J04T08
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 00:05:44] [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:05:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:05:44] [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:05:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 00:05:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2024-05-31 00:05:44] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 810 PT places and 14100.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-31 00:05:44] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-31 00:05:44] [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:05:44] [INFO ] Computed 26 invariants in 12 ms
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 00:05:44] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-31 00:05:44] [INFO ] Computed 26 invariants in 5 ms
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 00:05:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 00:05:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 00:05:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-31 00:05:45] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2024-05-31 00:05:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-31 00:05:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2024-05-31 00:05:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 00:05:45] [INFO ] Added : 54 causal constraints over 11 iterations in 124 ms. Result :sat
Minimization took 20 ms.
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 00:05:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2024-05-31 00:05:45] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-31 00:05:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-31 00:05:45] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-31 00:05:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 116 ms
[2024-05-31 00:05:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:05:45] [INFO ] Added : 58 causal constraints over 12 iterations in 72 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 00:05:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:45] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 00:05:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-31 00:05:46] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-31 00:05:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2024-05-31 00:05:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:05:46] [INFO ] Added : 60 causal constraints over 13 iterations in 99 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-05-31 00:05:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:05:46] [INFO ] Added : 7 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-31 00:05:46] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-31 00:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 00:05:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:05:46] [INFO ] Added : 43 causal constraints over 10 iterations in 65 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:46] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-31 00:05:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 00:05:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 00:05:46] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-31 00:05:46] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-31 00:05:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-05-31 00:05:46] [INFO ] Added : 49 causal constraints over 10 iterations in 137 ms. Result :sat
Minimization took 17 ms.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 00:05:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-31 00:05:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:05:47] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-31 00:05:47] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-31 00:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-05-31 00:05:47] [INFO ] Added : 43 causal constraints over 9 iterations in 179 ms. Result :sat
Minimization took 60 ms.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 00:05:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-31 00:05:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:05:47] [INFO ] Added : 61 causal constraints over 13 iterations in 69 ms. Result :sat
Minimization took 93 ms.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 00:05:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-31 00:05:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 00:05:47] [INFO ] Added : 54 causal constraints over 11 iterations in 119 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 00:05:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 00:05:48] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
[2024-05-31 00:05:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 00:05:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 00:05:48] [INFO ] Added : 51 causal constraints over 11 iterations in 67 ms. Result :sat
Minimization took 49 ms.
[2024-05-31 00:05:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 00:05:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-31 00:05:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:05:48] [INFO ] Added : 60 causal constraints over 12 iterations in 107 ms. Result :sat
Minimization took 36 ms.
[2024-05-31 00:05:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:48] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 00:05:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:48] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-31 00:05:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-31 00:05:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 00:05:48] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 00:05:48] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-31 00:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2024-05-31 00:05:48] [INFO ] Added : 37 causal constraints over 8 iterations in 136 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 00:05:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 00:05:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:49] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2024-05-31 00:05:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 00:05:49] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 00:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-31 00:05:49] [INFO ] Added : 58 causal constraints over 12 iterations in 140 ms. Result :sat
Minimization took 19 ms.
[2024-05-31 00:05:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:49] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 00:05:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:49] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 00:05:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-31 00:05:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-31 00:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-31 00:05:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 00:05:49] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-31 00:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 00:05:49] [INFO ] Added : 59 causal constraints over 12 iterations in 135 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [8, 6, 5, 1, 8, 1, 8, 4, 8, 1, 3, 1, 1, 5]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-05-31 00:05:49] [INFO ] Unfolded HLPN to a Petri net with 810 places and 14014 transitions 118428 arcs in 183 ms.
[2024-05-31 00:05:49] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :24
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :14
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :6
[2024-05-31 00:05:50] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2024-05-31 00:05:50] [INFO ] Computed 58 invariants in 263 ms
[2024-05-31 00:05:50] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:05:50] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 36 ms returned unsat
[2024-05-31 00:05:50] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:05:50] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 33 ms returned unsat
[2024-05-31 00:05:50] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:05:50] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 24 ms returned unsat
[2024-05-31 00:05:51] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:05:51] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 32 ms returned sat
[2024-05-31 00:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:52] [INFO ] [Real]Absence check using state equation in 1092 ms returned sat
[2024-05-31 00:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:05:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:05:52] [INFO ] [Nat]Absence check using 19 positive and 39 generalized place invariants in 29 ms returned sat
[2024-05-31 00:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:05:57] [INFO ] [Nat]Absence check using state equation in 4589 ms returned sat
[2024-05-31 00:05:57] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 00:05:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 00:05:57] [INFO ] [Nat]Added 224 Read/Feed constraints in 250 ms returned unknown
[2024-05-31 00:05:57] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 00:05:57] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 25 ms returned unsat
[2024-05-31 00:05:57] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 00:05:57] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 8, 1, 1] Max seen :[1, 1, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 804 transition count 3190
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 134 place count 740 transition count 3190
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 134 place count 740 transition count 3094
Deduced a syphon composed of 96 places in 7 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 326 place count 644 transition count 3094
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 502 place count 556 transition count 3006
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 518 place count 556 transition count 2990
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 534 place count 540 transition count 2990
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 542 place count 540 transition count 2990
Applied a total of 542 rules in 692 ms. Remains 540 /810 variables (removed 270) and now considering 2990/3254 (removed 264) transitions.
[2024-05-31 00:05:58] [INFO ] Flow matrix only has 2942 transitions (discarded 48 similar events)
// Phase 1: matrix 2942 rows 540 cols
[2024-05-31 00:05:58] [INFO ] Computed 52 invariants in 105 ms
[2024-05-31 00:05:59] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 1224 transitions.
Found 1224 dead transitions using SMT.
Drop transitions removed 1224 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 540/810 places, 1766/3254 transitions.
Applied a total of 0 rules in 36 ms. Remains 540 /540 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2096 ms. Remains : 540/810 places, 1766/3254 transitions.
Normalized transition count is 1718 out of 1766 initially.
// Phase 1: matrix 1718 rows 540 cols
[2024-05-31 00:05:59] [INFO ] Computed 52 invariants in 28 ms
Incomplete random walk after 1000000 steps, including 10465 resets, run finished after 5455 ms. (steps per millisecond=183 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2268 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties (out of 1) seen :8
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 22225 ms.

BK_STOP 1717113966724

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

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