About the Execution of GreatSPN+red for PolyORBLF-COL-S04J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2886.396 | 68072.00 | 94900.00 | 54.80 | 1 1 3 5 1 1 3 4 3 2 1 1 1 4 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445200125.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-S04J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 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-S04J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716849266493
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-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 22:34:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 22:34:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:34:27] [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-27 22:34:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:34:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 637 ms
[2024-05-27 22:34:28] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 22:34:28] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 22:34:28] [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-27 22:34:28] [INFO ] Computed 26 invariants in 18 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 3, 6, 1, 5, 4, 4, 3, 2, 1, 1, 6, 4, 4, 19]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 22:34:28] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 22:34:28] [INFO ] Computed 26 invariants in 6 ms
[2024-05-27 22:34:28] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-27 22:34:28] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-05-27 22:34:28] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-27 22:34:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:34:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 22:34:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 9 ms to minimize.
[2024-05-27 22:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-27 22:34:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 2 ms to minimize.
[2024-05-27 22:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-27 22:34:29] [INFO ] Added : 59 causal constraints over 12 iterations in 160 ms. Result :sat
Minimization took 27 ms.
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:34:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:34:29] [INFO ] Added : 30 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 27 ms.
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:34:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-27 22:34:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-27 22:34:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:34:29] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 22:34:29] [INFO ] Added : 31 causal constraints over 7 iterations in 45 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:34:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:29] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-27 22:34:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-27 22:34:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-05-27 22:34:30] [INFO ] Added : 57 causal constraints over 12 iterations in 216 ms. Result :sat
Minimization took 56 ms.
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:34:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 40 ms returned sat
[2024-05-27 22:34:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 22:34:30] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 33 ms.
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-27 22:34:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:34:30] [INFO ] Added : 3 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 22:34:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:34:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 22:34:30] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:34:30] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 22 ms.
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-27 22:34:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:34:31] [INFO ] Added : 35 causal constraints over 7 iterations in 58 ms. Result :sat
Minimization took 25 ms.
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 22:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-05-27 22:34:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:34:31] [INFO ] Added : 29 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 20 ms.
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 22:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:34:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-27 22:34:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 105 ms
[2024-05-27 22:34:31] [INFO ] Added : 59 causal constraints over 13 iterations in 188 ms. Result :sat
Minimization took 28 ms.
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:34:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:34:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 22:34:31] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 22:34:31] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 22:34:32] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:32] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-27 22:34:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:32] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 22:34:32] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 22:34:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 22:34:32] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 22:34:32] [INFO ] Added : 58 causal constraints over 12 iterations in 90 ms. Result :sat
Minimization took 29 ms.
[2024-05-27 22:34:32] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 22:34:32] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 5, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 3, 5, 1, 1, 4, 4, 3, 2, 1, 1, 6, 4, 4, 1]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 22:34:32] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 83 ms.
[2024-05-27 22:34:32] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[1, 3, 1, 4, 4, 3, 2, 1, 1, 6, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 3, 1, 4, 4, 3, 2, 1, 1, 6, 4, 4]
[2024-05-27 22:34:32] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-05-27 22:34:32] [INFO ] Computed 50 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 3, 1, 4, 4, 3, 2, 1, 1, 6, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30000 steps (6 resets) in 153 ms. (194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 1] Max Struct:[4, 6, 4]
[2024-05-27 22:34:32] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-05-27 22:34:32] [INFO ] Invariant cache hit.
[2024-05-27 22:34:33] [INFO ] [Real]Absence check using 19 positive place invariants in 136 ms returned sat
[2024-05-27 22:34:33] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2024-05-27 22:34:33] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-05-27 22:34:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:34:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-27 22:34:33] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned sat
[2024-05-27 22:34:34] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-05-27 22:34:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:34:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 22:34:35] [INFO ] [Nat]Added 120 Read/Feed constraints in 1019 ms returned unknown
[2024-05-27 22:34:35] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-27 22:34:35] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2024-05-27 22:34:35] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-27 22:34:35] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 1] Max Struct:[4, 1, 1]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 24 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 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 58 rules applied. Total rules applied 58 place count 550 transition count 1318
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 496 transition count 1318
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 112 place count 496 transition count 1258
Deduced a syphon composed of 60 places in 5 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 232 place count 436 transition count 1258
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 352 place count 376 transition count 1198
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 364 place count 376 transition count 1186
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 376 place count 364 transition count 1186
Applied a total of 376 rules in 278 ms. Remains 364 /554 variables (removed 190) and now considering 1186/1372 (removed 186) transitions.
Running 1182 sub problems to find dead transitions.
[2024-05-27 22:34:35] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
// Phase 1: matrix 1162 rows 364 cols
[2024-05-27 22:34:35] [INFO ] Computed 46 invariants in 29 ms
[2024-05-27 22:34:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-27 22:34:48] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-05-27 22:34:48] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 3 ms to minimize.
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 149 places in 303 ms of which 3 ms to minimize.
[2024-05-27 22:34:49] [INFO ] Deduced a trap composed of 158 places in 325 ms of which 3 ms to minimize.
[2024-05-27 22:34:50] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-27 22:34:51] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 3 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 134 places in 242 ms of which 2 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 3 ms to minimize.
[2024-05-27 22:34:55] [INFO ] Deduced a trap composed of 101 places in 233 ms of which 3 ms to minimize.
[2024-05-27 22:34:57] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-27 22:35:02] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/1526 variables, and 56 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1182/1182 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
[2024-05-27 22:35:10] [INFO ] Deduced a trap composed of 114 places in 234 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1182 unsolved
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 360/1526 variables, and 57 constraints, problems are : Problem set: 0 solved, 1182 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/364 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1182 constraints, Known Traps: 15/15 constraints]
After SMT, in 46805ms problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 46843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47152 ms. Remains : 364/554 places, 1186/1372 transitions.
[2024-05-27 22:35:22] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
[2024-05-27 22:35:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (165 resets) in 5469 ms. (182 steps per ms)
BEST_FIRST walk for 1000001 steps (1040 resets) in 2874 ms. (347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-27 22:35:30] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
[2024-05-27 22:35:30] [INFO ] Invariant cache hit.
[2024-05-27 22:35:31] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-27 22:35:31] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned sat
[2024-05-27 22:35:31] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2024-05-27 22:35:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:35:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2024-05-27 22:35:31] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 36 ms returned sat
[2024-05-27 22:35:32] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-27 22:35:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 22:35:32] [INFO ] [Nat]Added 120 Read/Feed constraints in 502 ms returned sat
[2024-05-27 22:35:32] [INFO ] Deduced a trap composed of 105 places in 206 ms of which 2 ms to minimize.
[2024-05-27 22:35:33] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 3 ms to minimize.
[2024-05-27 22:35:33] [INFO ] Deduced a trap composed of 120 places in 255 ms of which 2 ms to minimize.
[2024-05-27 22:35:34] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 2 ms to minimize.
[2024-05-27 22:35:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 1696 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[3]
FORMULA PolyORBLF-COL-S04J04T06-UpperBounds-06 3 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 5 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 66644 ms.
ITS solved all properties within timeout
BK_STOP 1716849334565
--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-S04J04T06"
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-S04J04T06, 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-171654445200125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 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 ;