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.r516-tajo-171654446400125.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 ltsminxred
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 r516-tajo-171654446400125
=====================================================================

--------------------
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 1717249727937

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:48:49] [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-06-01 13:48:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:48:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1207 ms
[2024-06-01 13:48:50] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 53 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2024-06-01 13:48:51] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:48:51] [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-06-01 13:48:51] [INFO ] Computed 26 invariants in 21 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-06-01 13:48:51] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:48:51] [INFO ] Computed 26 invariants in 23 ms
[2024-06-01 13:48:51] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 13:48:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2024-06-01 13:48:51] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 13:48:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 13:48:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:48:51] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-01 13:48:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 13:48:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:48:51] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 9 ms to minimize.
[2024-06-01 13:48:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-06-01 13:48:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 13:48:52] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 27 ms to minimize.
[2024-06-01 13:48:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-06-01 13:48:52] [INFO ] Added : 59 causal constraints over 12 iterations in 288 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using 11 positive place invariants in 82 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 86 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-01 13:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:48:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:48:52] [INFO ] Added : 30 causal constraints over 7 iterations in 120 ms. Result :sat
Minimization took 53 ms.
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 13:48:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:48:53] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 13:48:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 89 ms
[2024-06-01 13:48:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:48:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 18 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:48:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 13:48:54] [INFO ] Added : 31 causal constraints over 7 iterations in 58 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 13:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 13:48:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:48:54] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:48:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-01 13:48:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 31 places in 1366 ms of which 28 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:48:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1472 ms
[2024-06-01 13:48:56] [INFO ] Added : 57 causal constraints over 12 iterations in 1601 ms. Result :sat
Minimization took 96 ms.
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 13:48:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 30 ms returned sat
[2024-06-01 13:48:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:48:56] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 32 ms.
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 13:48:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:48:56] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 13:48:56] [INFO ] Added : 3 causal constraints over 1 iterations in 49 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-01 13:48:56] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 13:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:48:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:48:57] [INFO ] Added : 3 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 13:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-06-01 13:48:57] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:48:57] [INFO ] Added : 35 causal constraints over 7 iterations in 184 ms. Result :sat
Minimization took 59 ms.
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 13:48:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 13:48:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:48:57] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-06-01 13:48:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:48:58] [INFO ] Added : 29 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-06-01 13:48:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:48:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2024-06-01 13:48:58] [INFO ] Added : 59 causal constraints over 13 iterations in 332 ms. Result :sat
Minimization took 27 ms.
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 16 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 13:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-06-01 13:48:58] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 13:48:58] [INFO ] Added : 3 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-06-01 13:48:58] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 13:48:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:48:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:48:59] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-06-01 13:48:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 13:48:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-06-01 13:48:59] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 13:48:59] [INFO ] Added : 58 causal constraints over 12 iterations in 92 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 13:48:59] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 13:48:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 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-06-01 13:48:59] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 111 ms.
[2024-06-01 13:48:59] [INFO ] Unfolded 12 HLPN properties in 0 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-06-01 13:48:59] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2024-06-01 13:48:59] [INFO ] Computed 50 invariants in 63 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 123 ms. (80 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 30003 steps (6 resets) in 151 ms. (197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 1] Max Struct:[4, 6, 4]
[2024-06-01 13:48:59] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:48:59] [INFO ] Invariant cache hit.
[2024-06-01 13:48:59] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 13:48:59] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2024-06-01 13:49:00] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2024-06-01 13:49:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:49:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 13:49:00] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2024-06-01 13:49:01] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-06-01 13:49:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:49:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:49:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 1021 ms returned unknown
[2024-06-01 13:49:02] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 13:49:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned unsat
[2024-06-01 13:49:02] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 13:49:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 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 2 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 5 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 313 ms. Remains 364 /554 variables (removed 190) and now considering 1186/1372 (removed 186) transitions.
Running 1182 sub problems to find dead transitions.
[2024-06-01 13:49:02] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
// Phase 1: matrix 1162 rows 364 cols
[2024-06-01 13:49:03] [INFO ] Computed 46 invariants in 37 ms
[2024-06-01 13:49:03] [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-06-01 13:49:15] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:49:15] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 6 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 149 places in 309 ms of which 3 ms to minimize.
[2024-06-01 13:49:16] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 3 ms to minimize.
[2024-06-01 13:49:17] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:49:18] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 2 ms to minimize.
[2024-06-01 13:49:22] [INFO ] Deduced a trap composed of 134 places in 241 ms of which 2 ms to minimize.
[2024-06-01 13:49:22] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 15 ms to minimize.
[2024-06-01 13:49:22] [INFO ] Deduced a trap composed of 101 places in 290 ms of which 3 ms to minimize.
[2024-06-01 13:49:24] [INFO ] Deduced a trap composed of 3 places in 433 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-06-01 13:49:29] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 2 ms to minimize.
SMT process timed out in 26730ms, After SMT, problems are : Problem set: 0 solved, 1182 unsolved
Search for dead transitions found 0 dead transitions in 26779ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27124 ms. Remains : 364/554 places, 1186/1372 transitions.
[2024-06-01 13:49:29] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
[2024-06-01 13:49:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (152 resets) in 5522 ms. (181 steps per ms)
BEST_FIRST walk for 1000000 steps (1045 resets) in 2502 ms. (399 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-06-01 13:49:37] [INFO ] Flow matrix only has 1162 transitions (discarded 24 similar events)
[2024-06-01 13:49:37] [INFO ] Invariant cache hit.
[2024-06-01 13:49:37] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 13:49:37] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned sat
[2024-06-01 13:49:38] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2024-06-01 13:49:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:49:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-01 13:49:38] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 28 ms returned sat
[2024-06-01 13:49:38] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2024-06-01 13:49:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:49:39] [INFO ] [Nat]Added 120 Read/Feed constraints in 569 ms returned sat
[2024-06-01 13:49:39] [INFO ] Deduced a trap composed of 105 places in 381 ms of which 3 ms to minimize.
[2024-06-01 13:49:40] [INFO ] Deduced a trap composed of 139 places in 465 ms of which 3 ms to minimize.
[2024-06-01 13:49:41] [INFO ] Deduced a trap composed of 120 places in 310 ms of which 16 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Deduced a trap composed of 77 places in 467 ms of which 3 ms to minimize.
[2024-06-01 13:49:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 2583 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 4 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 52648 ms.
ITS solved all properties within timeout

BK_STOP 1717249782366

--------------------
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="ltsminxred"
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 ltsminxred"
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 r516-tajo-171654446400125"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;