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.r290-tajo-171654446500157.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 itstools
Input is PolyORBLF-COL-S04J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716910032222

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 15:27:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:27:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:27:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 15:27:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:27:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1002 ms
[2024-05-28 15:27:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 792 PT places and 4336.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-28 15:27:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:27:15] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:27:15] [INFO ] Computed 26 invariants in 19 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 0, 7, 0, 0, 1, 0, 0, 0] Max Struct:[4, 8, 1, 22, 38, 30, 5, 1, 4, 7, 4, 8, 8, 30, 150, 1]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 15:27:15] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:27:15] [INFO ] Computed 26 invariants in 15 ms
[2024-05-28 15:27:15] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-28 15:27:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 15:27:15] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-28 15:27:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-28 15:27:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 15:27:15] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-28 15:27:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 15:27:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 15:27:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-28 15:27:16] [INFO ] Added : 54 causal constraints over 11 iterations in 286 ms. Result :sat
Minimization took 50 ms.
[2024-05-28 15:27:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:16] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 11 ms returned sat
[2024-05-28 15:27:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-28 15:27:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:16] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:16] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 15:27:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 15:27:16] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 22 ms to minimize.
[2024-05-28 15:27:18] [INFO ] Deduced a trap composed of 27 places in 1580 ms of which 27 ms to minimize.
[2024-05-28 15:27:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1720 ms
[2024-05-28 15:27:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 15:27:18] [INFO ] Added : 58 causal constraints over 13 iterations in 83 ms. Result :sat
Minimization took 27 ms.
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 15:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-28 15:27:18] [INFO ] Added : 54 causal constraints over 11 iterations in 77 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 15:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 15:27:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 15:27:18] [INFO ] Added : 28 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 49 ms.
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-28 15:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-28 15:27:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 15:27:18] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-28 15:27:18] [INFO ] Added : 54 causal constraints over 11 iterations in 100 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Added 8 Read/Feed constraints in 15 ms returned sat
[2024-05-28 15:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 15:27:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:19] [INFO ] Added : 7 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 22 ms.
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 15:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 15:27:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:19] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-28 15:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 15:27:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:19] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 15:27:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 15:27:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 15:27:19] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 15:27:19] [INFO ] Added : 27 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 37 ms.
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 15:27:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:20] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 2 ms to minimize.
[2024-05-28 15:27:20] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:27:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-28 15:27:20] [INFO ] Added : 59 causal constraints over 13 iterations in 225 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 15:27:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 15:27:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-28 15:27:20] [INFO ] Added : 41 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 97 ms.
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 15:27:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 15:27:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 15:27:20] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:21] [INFO ] Added : 45 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 36 ms.
[2024-05-28 15:27:21] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 15:27:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-28 15:27:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-28 15:27:21] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 20 ms.
[2024-05-28 15:27:21] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 15:27:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:27:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 15:27:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 15:27:21] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 15:27:21] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[4, 8, 1, 10, 38, 30, 5, 1, 4, 4, 8, 8, 30, 150, 1]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-28 15:27:21] [INFO ] Unfolded HLPN to a Petri net with 792 places and 4268 transitions 28832 arcs in 136 ms.
[2024-05-28 15:27:21] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[4, 8, 1, 38, 30, 5, 1, 4, 4, 8, 8, 30, 150, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[4, 8, 1, 38, 30, 5, 1, 4, 4, 8, 8, 30, 150, 1]
[2024-05-28 15:27:21] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-05-28 15:27:21] [INFO ] Computed 58 invariants in 122 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[4, 8, 1, 38, 30, 5, 1, 4, 4, 8, 8, 30, 10, 1]
RANDOM walk for 10000 steps (4 resets) in 163 ms. (60 steps per ms)
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (14 resets) in 359 ms. (194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 4, 1, 1, 4, 4] Max Struct:[8, 38, 30, 5, 8, 30, 10]
[2024-05-28 15:27:22] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-28 15:27:22] [INFO ] Invariant cache hit.
[2024-05-28 15:27:22] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2024-05-28 15:27:22] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 54 ms returned unsat
[2024-05-28 15:27:22] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 15:27:22] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 30 ms returned unsat
[2024-05-28 15:27:22] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 15:27:22] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 15 ms returned unsat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 38 ms returned unsat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 49 ms returned unsat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 13 ms returned unsat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 15:27:23] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 35 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 4, 1, 1, 4, 4] Max Struct:[1, 4, 4, 1, 1, 4, 4]
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J06T08-UpperBounds-01 1 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 8 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 )
[2024-05-28 15:27:24] [INFO ] Flatten gal took : 513 ms
[2024-05-28 15:27:24] [INFO ] Flatten gal took : 246 ms
[2024-05-28 15:27:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18066252805639078843.gal : 87 ms
[2024-05-28 15:27:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3769122783211304168.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18066252805639078843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3769122783211304168.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10952 ms.

BK_STOP 1716910044815

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S04J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-COL-S04J06T08, 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 r290-tajo-171654446500157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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