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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 13K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S04J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J06T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716852108956

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-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 23:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:21:50] [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 23:21:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:21:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 635 ms
[2024-05-27 23:21:50] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-27 23:21:50] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-27 23:21:50] [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 23:21:50] [INFO ] Computed 26 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[4, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0] Max Struct:[4, 30, 4, 4, 1, 6, 6, 4, 6, 4, 1, 30, 4, 1, 1, 4]
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 23:21:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:21:51] [INFO ] Computed 26 invariants in 4 ms
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-27 23:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-27 23:21:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-27 23:21:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 23:21:51] [INFO ] Added : 54 causal constraints over 11 iterations in 91 ms. Result :sat
Minimization took 27 ms.
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 23:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 23:21:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 23:21:51] [INFO ] Added : 27 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 28 ms.
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 23:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-27 23:21:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2024-05-27 23:21:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 23:21:51] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 9 ms to minimize.
[2024-05-27 23:21:51] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-27 23:21:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-27 23:21:52] [INFO ] Added : 22 causal constraints over 6 iterations in 155 ms. Result :sat
Minimization took 18 ms.
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 23:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 23:21:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 23:21:52] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-27 23:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-27 23:21:52] [INFO ] Added : 57 causal constraints over 12 iterations in 126 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 23:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 23:21:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 23:21:52] [INFO ] Added : 56 causal constraints over 12 iterations in 88 ms. Result :sat
Minimization took 36 ms.
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 23:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-27 23:21:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 23:21:52] [INFO ] Added : 5 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 20 ms.
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 23:21:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 23:21:52] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 29 ms.
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:52] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-27 23:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 27 ms returned sat
[2024-05-27 23:21:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 23:21:53] [INFO ] Added : 13 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 23:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-27 23:21:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 23:21:53] [INFO ] Added : 40 causal constraints over 10 iterations in 72 ms. Result :sat
Minimization took 32 ms.
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 23:21:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 23:21:53] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 17 ms.
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-27 23:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-27 23:21:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 23:21:53] [INFO ] Added : 54 causal constraints over 11 iterations in 81 ms. Result :sat
Minimization took 27 ms.
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 23:21:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 23:21:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-27 23:21:54] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-27 23:21:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-27 23:21:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-27 23:21:54] [INFO ] Added : 31 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 4, 1, 6, 6, 4, 6, 4, 30, 4, 1, 4]
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
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
[2024-05-27 23:21:54] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 82 ms.
[2024-05-27 23:21:54] [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:[30, 4, 1, 6, 6, 4, 6, 4, 30, 4, 1, 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:[30, 4, 1, 6, 6, 4, 6, 4, 30, 4, 1, 4]
[2024-05-27 23:21:54] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2024-05-27 23:21:54] [INFO ] Computed 54 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[30, 4, 1, 6, 6, 4, 6, 4, 30, 4, 1, 4]
RANDOM walk for 10000 steps (2 resets) in 92 ms. (107 steps per ms)
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (12 resets) in 243 ms. (245 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 5, 4, 2, 1] Max Struct:[30, 6, 6, 30, 4, 4]
[2024-05-27 23:21:54] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-27 23:21:54] [INFO ] Invariant cache hit.
[2024-05-27 23:21:54] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 23:21:54] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 20 ms returned unsat
[2024-05-27 23:21:54] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 23:21:54] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 20 ms returned unsat
[2024-05-27 23:21:54] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 23:21:54] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 30 ms returned sat
[2024-05-27 23:21:55] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2024-05-27 23:21:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:21:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 23:21:56] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 36 ms returned sat
[2024-05-27 23:21:57] [INFO ] [Nat]Absence check using state equation in 1237 ms returned sat
[2024-05-27 23:21:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:21:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 23:21:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 1015 ms returned unknown
[2024-05-27 23:21:58] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 23:21:58] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 20 ms returned unsat
[2024-05-27 23:21:58] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 23:21:58] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 21 ms returned unsat
[2024-05-27 23:21:58] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-27 23:21:58] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 5, 4, 2, 1] Max Struct:[4, 1, 6, 4, 2, 1]
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-01 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 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 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 614 transition count 1510
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 560 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 112 place count 560 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 256 place count 488 transition count 1438
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 376 place count 428 transition count 1378
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 388 place count 428 transition count 1366
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 400 place count 416 transition count 1366
Applied a total of 400 rules in 301 ms. Remains 416 /618 variables (removed 202) and now considering 1366/1564 (removed 198) transitions.
Running 1362 sub problems to find dead transitions.
[2024-05-27 23:21:59] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 416 cols
[2024-05-27 23:21:59] [INFO ] Computed 50 invariants in 46 ms
[2024-05-27 23:21:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-05-27 23:22:16] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 2 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 175 places in 258 ms of which 3 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 168 places in 257 ms of which 3 ms to minimize.
[2024-05-27 23:22:18] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-05-27 23:22:20] [INFO ] Deduced a trap composed of 204 places in 330 ms of which 4 ms to minimize.
[2024-05-27 23:22:26] [INFO ] Deduced a trap composed of 156 places in 265 ms of which 3 ms to minimize.
SMT process timed out in 27970ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 28011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28342 ms. Remains : 416/618 places, 1366/1564 transitions.
[2024-05-27 23:22:27] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-27 23:22:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (163 resets) in 5696 ms. (175 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 2099 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-27 23:22:34] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-05-27 23:22:34] [INFO ] Invariant cache hit.
[2024-05-27 23:22:34] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 23:22:34] [INFO ] [Real]Absence check using 18 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-27 23:22:35] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2024-05-27 23:22:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 23:22:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-27 23:22:35] [INFO ] [Nat]Absence check using 18 positive and 32 generalized place invariants in 18 ms returned sat
[2024-05-27 23:22:36] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-27 23:22:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:22:36] [INFO ] [Nat]Added 120 Read/Feed constraints in 506 ms returned sat
[2024-05-27 23:22:37] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 3 ms to minimize.
[2024-05-27 23:22:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 306 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[5]
FORMULA PolyORBLF-COL-S04J06T06-UpperBounds-08 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 6 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 47094 ms.
ITS solved all properties within timeout

BK_STOP 1716852157281

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

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