About the Execution of GreatSPN+red for PolyORBLF-COL-S06J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3463.352 | 92274.00 | 122846.00 | 80.50 | 4 10 6 1 1 1 5 1 1 1 4 4 1 1 6 2 | 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.r289-tajo-171654445400181.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 greatspnxred
Input is PolyORBLF-COL-S06J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400181
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:51 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 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:21 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-S06J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716855433914
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:17:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 00:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:17:15] [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-28 00:17:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:17:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 798 ms
[2024-05-28 00:17:16] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2024-05-28 00:17:16] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-28 00:17:16] [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-28 00:17:16] [INFO ] Computed 26 invariants in 19 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 10, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[5, 10, 6, 6, 6, 1, 6, 6, 6, 1, 41, 5, 1, 1, 6, 2]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 00:17:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:17:16] [INFO ] Computed 26 invariants in 6 ms
[2024-05-28 00:17:16] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2024-05-28 00:17:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 00:17:16] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-28 00:17:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 21 ms returned sat
[2024-05-28 00:17:16] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 00:17:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 00:17:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 00:17:16] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-28 00:17:17] [INFO ] Added : 54 causal constraints over 11 iterations in 254 ms. Result :sat
Minimization took 51 ms.
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 00:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-28 00:17:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 00:17:17] [INFO ] Added : 43 causal constraints over 10 iterations in 102 ms. Result :sat
Minimization took 41 ms.
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-28 00:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 00:17:17] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 00:17:17] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 12 ms to minimize.
[2024-05-28 00:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-28 00:17:17] [INFO ] Added : 62 causal constraints over 13 iterations in 177 ms. Result :sat
Minimization took 37 ms.
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 00:17:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 00:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 30 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:17:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-28 00:17:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-28 00:17:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 00:17:18] [INFO ] Added : 61 causal constraints over 13 iterations in 81 ms. Result :sat
Minimization took 22 ms.
[2024-05-28 00:17:18] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 00:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2024-05-28 00:17:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:17:18] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-05-28 00:17:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-28 00:17:18] [INFO ] Added : 38 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 20 ms.
[2024-05-28 00:17:18] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 14 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 00:17:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 00:17:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 00:17:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 00:17:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 00:17:18] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-05-28 00:17:18] [INFO ] Added : 36 causal constraints over 8 iterations in 215 ms. Result :sat
Minimization took 49 ms.
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 00:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:17:19] [INFO ] Added : 10 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 16 ms.
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 00:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 00:17:19] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 00:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-28 00:17:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 00:17:19] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-28 00:17:19] [INFO ] Added : 53 causal constraints over 11 iterations in 120 ms. Result :sat
Minimization took 22 ms.
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 00:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 00:17:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:17:19] [INFO ] Added : 26 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-28 00:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 00:17:19] [INFO ] Added : 54 causal constraints over 11 iterations in 72 ms. Result :sat
Minimization took 28 ms.
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 00:17:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 00:17:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:17:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:17:20] [INFO ] Added : 31 causal constraints over 7 iterations in 36 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 00:17:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 00:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 00:17:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 00:17:20] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 13 ms.
[2024-05-28 00:17:20] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 00:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 00:17:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:17:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:17:20] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 18 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] Max Struct:[5, 6, 6, 6, 1, 6, 6, 6, 41, 5, 1, 6, 2]
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-28 00:17:20] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 223 ms.
[2024-05-28 00:17:20] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[5, 6, 6, 6, 1, 6, 6, 6, 41, 5, 1, 6, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 6, 6, 6, 1, 6, 6, 6, 41, 5, 1, 6, 2]
[2024-05-28 00:17:20] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-05-28 00:17:20] [INFO ] Computed 54 invariants in 136 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 6, 6, 6, 1, 6, 6, 6, 41, 5, 1, 6, 2]
RANDOM walk for 10000 steps (59 resets) in 132 ms. (75 steps per ms)
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (269 resets) in 392 ms. (203 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 1, 5, 1, 1, 4, 4] Max Struct:[5, 6, 6, 6, 6, 6, 41, 5]
[2024-05-28 00:17:21] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-05-28 00:17:21] [INFO ] Invariant cache hit.
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 36 ms returned unsat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 42 ms returned unsat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 42 ms returned unsat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 00:17:21] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 43 ms returned sat
[2024-05-28 00:17:22] [INFO ] [Real]Absence check using state equation in 1141 ms returned sat
[2024-05-28 00:17:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:17:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 00:17:23] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 52 ms returned sat
[2024-05-28 00:17:24] [INFO ] [Nat]Absence check using state equation in 1600 ms returned sat
[2024-05-28 00:17:24] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:17:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 00:17:25] [INFO ] [Nat]Added 168 Read/Feed constraints in 1033 ms returned unknown
[2024-05-28 00:17:25] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 00:17:25] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 37 ms returned unsat
[2024-05-28 00:17:26] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 00:17:26] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 40 ms returned unsat
[2024-05-28 00:17:26] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 00:17:26] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 37 ms returned unsat
[2024-05-28 00:17:26] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 00:17:26] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 1, 5, 1, 1, 4, 4] Max Struct:[4, 1, 1, 6, 1, 1, 4, 4]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 114 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 258 place count 500 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 402 place count 428 transition count 2232
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 428 transition count 2220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 426 place count 416 transition count 2220
Applied a total of 426 rules in 430 ms. Remains 416 /632 variables (removed 216) and now considering 2220/2430 (removed 210) transitions.
Running 2214 sub problems to find dead transitions.
[2024-05-28 00:17:26] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
// Phase 1: matrix 2184 rows 416 cols
[2024-05-28 00:17:26] [INFO ] Computed 48 invariants in 53 ms
[2024-05-28 00:17:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 3 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 1 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-05-28 00:18:04] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-28 00:18:05] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-28 00:18:05] [INFO ] Deduced a trap composed of 177 places in 642 ms of which 4 ms to minimize.
[2024-05-28 00:18:06] [INFO ] Deduced a trap composed of 201 places in 579 ms of which 3 ms to minimize.
[2024-05-28 00:18:07] [INFO ] Deduced a trap composed of 182 places in 598 ms of which 3 ms to minimize.
[2024-05-28 00:18:08] [INFO ] Deduced a trap composed of 171 places in 337 ms of which 2 ms to minimize.
[2024-05-28 00:18:09] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2600 variables, and 53 constraints, problems are : Problem set: 0 solved, 2214 unsolved in 20087 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2214/870 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 2214 unsolved
[2024-05-28 00:18:25] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 2 ms to minimize.
[2024-05-28 00:18:26] [INFO ] Deduced a trap composed of 126 places in 470 ms of which 3 ms to minimize.
[2024-05-28 00:18:26] [INFO ] Deduced a trap composed of 133 places in 466 ms of which 3 ms to minimize.
[2024-05-28 00:18:27] [INFO ] Deduced a trap composed of 128 places in 425 ms of which 3 ms to minimize.
[2024-05-28 00:18:29] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2600 variables, and 58 constraints, problems are : Problem set: 0 solved, 2214 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1344/870 constraints, Known Traps: 16/16 constraints]
After SMT, in 63646ms problems are : Problem set: 0 solved, 2214 unsolved
Search for dead transitions found 0 dead transitions in 63706ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64198 ms. Remains : 416/632 places, 2220/2430 transitions.
[2024-05-28 00:18:30] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
[2024-05-28 00:18:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (11585 resets) in 9653 ms. (103 steps per ms)
BEST_FIRST walk for 1000001 steps (8442 resets) in 2527 ms. (395 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-28 00:18:42] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
[2024-05-28 00:18:42] [INFO ] Invariant cache hit.
[2024-05-28 00:18:42] [INFO ] [Real]Absence check using 16 positive place invariants in 56 ms returned sat
[2024-05-28 00:18:42] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 29 ms returned sat
[2024-05-28 00:18:43] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-28 00:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:18:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 00:18:43] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 19 ms returned sat
[2024-05-28 00:18:44] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-28 00:18:44] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 00:18:45] [INFO ] [Nat]Added 168 Read/Feed constraints in 1119 ms returned sat
[2024-05-28 00:18:45] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 2 ms to minimize.
[2024-05-28 00:18:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 446 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[5]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 90809 ms.
ITS solved all properties within timeout
BK_STOP 1716855526188
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-S06J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S06J04T06, 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 r289-tajo-171654445400181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 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 '
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 ;