About the Execution of 2024-gold for PolyORBLF-COL-S06J06T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 252252.00 | 0.00 | 0.00 | 1 4 1 2 1 1 1 6 ? 2 1 1 6 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PolyORBLF-COL-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100049
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME 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 1748892103116
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-02 19:21: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]
[2025-06-02 19:21:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:21: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.
[2025-06-02 19:21:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 19:21:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 618 ms
[2025-06-02 19:21:45] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 506 PT places and 7196.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-02 19:21:45] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 19:21:45] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:21:45] [INFO ] Computed 26 invariants in 20 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 6, 0, 0, 0] Max Struct:[1, 4, 4, 6, 4, 4, 4, 6, 4, 2, 1, 7, 6, 1, 4, 4]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-02 19:21:45] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 19:21:45] [INFO ] Computed 26 invariants in 10 ms
[2025-06-02 19:21:45] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-02 19:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 19:21:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 19:21:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 134 ms returned sat
[2025-06-02 19:21:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:21:45] [INFO ] Added : 28 causal constraints over 6 iterations in 76 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:21:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 19:21:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-06-02 19:21:45] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:21:45] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:21:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:21:46] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 15 ms to minimize.
[2025-06-02 19:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2025-06-02 19:21:46] [INFO ] Added : 57 causal constraints over 12 iterations in 165 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-02 19:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:21:46] [INFO ] Added : 9 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 21 ms.
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:21:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 19:21:46] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:21:46] [INFO ] Added : 58 causal constraints over 12 iterations in 95 ms. Result :sat
Minimization took 27 ms.
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-06-02 19:21:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2025-06-02 19:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-06-02 19:21:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:21:47] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2025-06-02 19:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-02 19:21:47] [INFO ] Added : 58 causal constraints over 12 iterations in 150 ms. Result :sat
Minimization took 32 ms.
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:21:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:21:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:21:47] [INFO ] Added : 58 causal constraints over 13 iterations in 97 ms. Result :sat
Minimization took 29 ms.
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 19:21:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:21:47] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 19:21:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:21:47] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2025-06-02 19:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-02 19:21:47] [INFO ] Added : 33 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 29 ms.
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:21:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2025-06-02 19:21:47] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 19:21:48] [INFO ] Added : 33 causal constraints over 7 iterations in 50 ms. Result :sat
Minimization took 28 ms.
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-02 19:21:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:21:48] [INFO ] Added : 54 causal constraints over 11 iterations in 97 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:21:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 19:21:48] [INFO ] Added : 9 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 19:21:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:21:48] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2025-06-02 19:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2025-06-02 19:21:48] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 19:21:48] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-06-02 19:21:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:21:48] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2025-06-02 19:21:48] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2025-06-02 19:21:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2025-06-02 19:21:48] [INFO ] Added : 58 causal constraints over 12 iterations in 286 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:21:49] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:21:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-02 19:21:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 19:21:49] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2025-06-02 19:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-06-02 19:21:49] [INFO ] Added : 46 causal constraints over 10 iterations in 135 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 19:21:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 19:21:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 19:21:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 19:21:49] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 19:21:49] [INFO ] Added : 57 causal constraints over 12 iterations in 90 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 4, 4, 6, 4, 4, 4, 4, 2, 1, 7, 1, 4, 4]
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
[2025-06-02 19:21:49] [INFO ] Unfolded HLPN to a Petri net with 506 places and 7154 transitions 59824 arcs in 152 ms.
[2025-06-02 19:21:49] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 4, 4, 6, 4, 4, 4, 4, 2, 1, 7, 1, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 4, 4, 6, 4, 4, 4, 4, 2, 1, 7, 1, 4, 4]
[2025-06-02 19:21:49] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2025-06-02 19:21:49] [INFO ] Computed 54 invariants in 96 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 4, 4, 6, 4, 4, 4, 4, 2, 1, 7, 1, 4, 4]
RANDOM walk for 10000 steps (41 resets) in 93 ms. (106 steps per ms)
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90005 steps (141 resets) in 320 ms. (280 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 1, 1, 2, 1, 1, 1] Max Struct:[4, 6, 4, 4, 4, 4, 7, 4, 4]
[2025-06-02 19:21:50] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2025-06-02 19:21:50] [INFO ] Invariant cache hit.
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 29 ms returned unsat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned unsat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 19:21:50] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned sat
[2025-06-02 19:21:51] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2025-06-02 19:21:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:21:51] [INFO ] [Real]Added 112 Read/Feed constraints in 153 ms returned sat
[2025-06-02 19:21:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:21:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 19:21:51] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 19 ms returned sat
[2025-06-02 19:21:52] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2025-06-02 19:21:52] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 19:21:53] [INFO ] [Nat]Added 112 Read/Feed constraints in 1028 ms returned unknown
[2025-06-02 19:21:53] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 19:21:53] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 11 ms returned unsat
[2025-06-02 19:21:53] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 19:21:53] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 20 ms returned unsat
[2025-06-02 19:21:53] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 19:21:53] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 22 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 1, 1, 2, 1, 1, 1] Max Struct:[1, 2, 1, 1, 1, 4, 1, 1, 1]
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 24 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 304 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
Running 1620 sub problems to find dead transitions.
[2025-06-02 19:21:53] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 352 cols
[2025-06-02 19:21:54] [INFO ] Computed 48 invariants in 50 ms
[2025-06-02 19:21:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
[2025-06-02 19:22:22] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2025-06-02 19:22:22] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:22:22] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2025-06-02 19:22:22] [INFO ] Deduced a trap composed of 139 places in 385 ms of which 3 ms to minimize.
[2025-06-02 19:22:22] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2025-06-02 19:22:24] [INFO ] Deduced a trap composed of 140 places in 349 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 346/1954 variables, and 48 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/352 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1620/1620 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1620 unsolved
[2025-06-02 19:22:35] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 2 ms to minimize.
[2025-06-02 19:22:35] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 2 ms to minimize.
[2025-06-02 19:22:37] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 2 ms to minimize.
[2025-06-02 19:22:38] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 2 ms to minimize.
[2025-06-02 19:22:41] [INFO ] Deduced a trap composed of 104 places in 268 ms of which 2 ms to minimize.
[2025-06-02 19:22:45] [INFO ] Deduced a trap composed of 94 places in 296 ms of which 2 ms to minimize.
[2025-06-02 19:22:46] [INFO ] Deduced a trap composed of 112 places in 296 ms of which 2 ms to minimize.
[2025-06-02 19:22:47] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/1954 variables, and 56 constraints, problems are : Problem set: 0 solved, 1620 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/352 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1620 constraints, Known Traps: 14/14 constraints]
After SMT, in 57990ms problems are : Problem set: 0 solved, 1620 unsolved
Search for dead transitions found 0 dead transitions in 58055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58391 ms. Remains : 352/506 places, 1626/1774 transitions.
[2025-06-02 19:22:51] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2025-06-02 19:22:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (10061 resets) in 7702 ms. (129 steps per ms)
BEST_FIRST walk for 1000000 steps (306 resets) in 3068 ms. (325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-02 19:23:02] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2025-06-02 19:23:02] [INFO ] Invariant cache hit.
[2025-06-02 19:23:02] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-02 19:23:02] [INFO ] [Real]Absence check using 18 positive and 30 generalized place invariants in 15 ms returned sat
[2025-06-02 19:23:03] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-06-02 19:23:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:23:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-06-02 19:23:03] [INFO ] [Nat]Absence check using 18 positive and 30 generalized place invariants in 12 ms returned sat
[2025-06-02 19:23:04] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2025-06-02 19:23:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:23:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 467 ms returned sat
[2025-06-02 19:23:05] [INFO ] Deduced a trap composed of 92 places in 357 ms of which 3 ms to minimize.
[2025-06-02 19:23:05] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2025-06-02 19:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 898 ms
[2025-06-02 19:23:05] [INFO ] Computed and/alt/rep : 1190/4818/1185 causal constraints (skipped 411 transitions) in 157 ms.
[2025-06-02 19:23:07] [INFO ] Added : 93 causal constraints over 19 iterations in 2362 ms. Result :sat
Minimization took 5863 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1626/1626 transitions.
Applied a total of 0 rules in 43 ms. Remains 352 /352 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 352/352 places, 1626/1626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1626/1626 transitions.
Applied a total of 0 rules in 34 ms. Remains 352 /352 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2025-06-02 19:23:13] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
[2025-06-02 19:23:13] [INFO ] Invariant cache hit.
[2025-06-02 19:23:14] [INFO ] Implicit Places using invariants in 474 ms returned [306, 307, 308, 309]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 490 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/352 places, 1626/1626 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1622
Applied a total of 8 rules in 44 ms. Remains 344 /348 variables (removed 4) and now considering 1622/1626 (removed 4) transitions.
[2025-06-02 19:23:14] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
// Phase 1: matrix 1598 rows 344 cols
[2025-06-02 19:23:14] [INFO ] Computed 44 invariants in 38 ms
[2025-06-02 19:23:14] [INFO ] Implicit Places using invariants in 483 ms returned []
[2025-06-02 19:23:14] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:23:14] [INFO ] Invariant cache hit.
[2025-06-02 19:23:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:23:19] [INFO ] Implicit Places using invariants and state equation in 4484 ms returned []
Implicit Place search using SMT with State Equation took 4971 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/352 places, 1622/1626 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5539 ms. Remains : 344/352 places, 1622/1626 transitions.
[2025-06-02 19:23:19] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:23:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (9783 resets) in 7653 ms. (130 steps per ms)
BEST_FIRST walk for 1000001 steps (336 resets) in 3150 ms. (317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-02 19:23:30] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:23:30] [INFO ] Invariant cache hit.
[2025-06-02 19:23:30] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-02 19:23:30] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 14 ms returned sat
[2025-06-02 19:23:30] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-02 19:23:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 19:23:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-06-02 19:23:30] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 13 ms returned sat
[2025-06-02 19:23:31] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2025-06-02 19:23:31] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:23:32] [INFO ] [Nat]Added 112 Read/Feed constraints in 562 ms returned sat
[2025-06-02 19:23:32] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 3 ms to minimize.
[2025-06-02 19:23:32] [INFO ] Deduced a trap composed of 56 places in 335 ms of which 2 ms to minimize.
[2025-06-02 19:23:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1225 ms
[2025-06-02 19:23:33] [INFO ] Computed and/alt/rep : 1186/4813/1181 causal constraints (skipped 411 transitions) in 210 ms.
[2025-06-02 19:23:38] [INFO ] Added : 158 causal constraints over 32 iterations in 5010 ms. Result :sat
Minimization took 5493 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 59 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 344/344 places, 1622/1622 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
Applied a total of 0 rules in 33 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2025-06-02 19:23:43] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:23:43] [INFO ] Invariant cache hit.
[2025-06-02 19:23:44] [INFO ] Implicit Places using invariants in 443 ms returned []
[2025-06-02 19:23:44] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:23:44] [INFO ] Invariant cache hit.
[2025-06-02 19:23:44] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 19:23:48] [INFO ] Implicit Places using invariants and state equation in 4434 ms returned []
Implicit Place search using SMT with State Equation took 4882 ms to find 0 implicit places.
[2025-06-02 19:23:48] [INFO ] Redundant transitions in 79 ms returned []
Running 1616 sub problems to find dead transitions.
[2025-06-02 19:23:48] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:23:48] [INFO ] Invariant cache hit.
[2025-06-02 19:23:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2025-06-02 19:24:17] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2025-06-02 19:24:17] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 0 ms to minimize.
[2025-06-02 19:24:17] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2025-06-02 19:24:17] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
[2025-06-02 19:24:17] [INFO ] Deduced a trap composed of 142 places in 384 ms of which 3 ms to minimize.
[2025-06-02 19:24:19] [INFO ] Deduced a trap composed of 140 places in 296 ms of which 2 ms to minimize.
[2025-06-02 19:24:26] [INFO ] Deduced a trap composed of 136 places in 287 ms of which 2 ms to minimize.
[2025-06-02 19:24:27] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 3 ms to minimize.
[2025-06-02 19:24:27] [INFO ] Deduced a trap composed of 94 places in 297 ms of which 2 ms to minimize.
[2025-06-02 19:24:27] [INFO ] Deduced a trap composed of 139 places in 282 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/1942 variables, and 48 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2025-06-02 19:24:40] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 1 ms to minimize.
[2025-06-02 19:24:42] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/1942 variables, and 50 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 12/12 constraints]
After SMT, in 78030ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 78051ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83068 ms. Remains : 344/344 places, 1622/1622 transitions.
RANDOM walk for 40000 steps (386 resets) in 1238 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (28 resets) in 422 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (29 resets) in 380 ms. (104 steps per ms) remains 2/2 properties
[2025-06-02 19:25:07] [INFO ] Flatten gal took : 497 ms
[2025-06-02 19:25:07] [INFO ] Flatten gal took : 182 ms
[2025-06-02 19:25:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7268278538508772451.gal : 82 ms
[2025-06-02 19:25:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15377239894183549875.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7268278538508772451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15377239894183549875.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15377239894183549875.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 31
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :31 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 67
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :67 after 329
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :329 after 1444
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1444 after 3832
Interrupted probabilistic random walk after 151785 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 151785 steps, saw 100368 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2025-06-02 19:25:10] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:25:10] [INFO ] Invariant cache hit.
[2025-06-02 19:25:10] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/130 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 200/330 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 19:25:11] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 2 ms to minimize.
[2025-06-02 19:25:11] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/334 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 10 (OVERLAPS) 8/342 variables, 6/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:25:11] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3832 after 28053
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1940/1942 variables, and 388 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 342/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/114 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/130 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 200/330 variables, 20/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:25:13] [INFO ] Deduced a trap composed of 144 places in 322 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/334 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/342 variables, 6/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 19:25:13] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1598/1940 variables, 342/390 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/1942 variables, and 502 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2000 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 342/344 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 4084ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1622/1622 transitions.
SDD proceeding with computation,2 properties remain. new max is 8192
Applied a total of 0 rules in 27 ms. Remains 344 /344 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
Running 1616 sub problems to find dead transitions.
SDD size :28053 after 108547
[2025-06-02 19:25:14] [INFO ] Flow matrix only has 1598 transitions (discarded 24 similar events)
[2025-06-02 19:25:14] [INFO ] Invariant cache hit.
[2025-06-02 19:25:14] [INFO ] State equation strengthened by 112 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :108547 after 390104
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :390104 after 2.35067e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/338 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
[2025-06-02 19:25:43] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 1 ms to minimize.
[2025-06-02 19:25:43] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2025-06-02 19:25:43] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2025-06-02 19:25:43] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2025-06-02 19:25:44] [INFO ] Deduced a trap composed of 142 places in 370 ms of which 3 ms to minimize.
[2025-06-02 19:25:45] [INFO ] Deduced a trap composed of 140 places in 299 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/1942 variables, and 44 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 20119 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/344 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
BK_STOP 1748892355368
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J06T04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is 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 r167-tall-174881266100049"
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.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 '
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 ;