Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950700653.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-COL-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950700653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 23:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 23:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 23:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K Mar 5 18:23 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 PolyORBNT-COL-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679600498615

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 19:41:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 19:41:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 19:41:40] [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.
[2023-03-23 19:41:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 19:41:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2023-03-23 19:41:41] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 19:41:41] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-23 19:41:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 19:41:41] [INFO ] Computed 13 place invariants in 9 ms
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 19:41:41] [INFO ] Invariant cache hit.
[2023-03-23 19:41:41] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-23 19:41:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 19:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:41] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-23 19:41:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 19:41:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-23 19:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:41] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-23 19:41:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:41:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 19:41:42] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2023-03-23 19:41:42] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2023-03-23 19:41:42] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-23 19:41:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 202 ms
[2023-03-23 19:41:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-23 19:41:42] [INFO ] Added : 36 causal constraints over 8 iterations in 140 ms. Result :sat
Minimization took 55 ms.
[2023-03-23 19:41:42] [INFO ] [Real]Absence check using 6 positive place invariants in 38 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:42] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-23 19:41:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:42] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 19:41:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-23 19:41:42] [INFO ] Added : 4 causal constraints over 1 iterations in 43 ms. Result :sat
Minimization took 8 ms.
[2023-03-23 19:41:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:42] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-23 19:41:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:42] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 19:41:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 19:41:42] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2023-03-23 19:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-23 19:41:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 19:41:43] [INFO ] Added : 36 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 19:41:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 19:41:43] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 2 ms to minimize.
[2023-03-23 19:41:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-23 19:41:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 19:41:43] [INFO ] Added : 15 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-23 19:41:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 19:41:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 19:41:43] [INFO ] Added : 2 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 19:41:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-23 19:41:43] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2023-03-23 19:41:43] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-23 19:41:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2023-03-23 19:41:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 19:41:43] [INFO ] Added : 36 causal constraints over 8 iterations in 64 ms. Result :sat
Minimization took 13 ms.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 19:41:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-23 19:41:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-23 19:41:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 19:41:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-23 19:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-23 19:41:44] [INFO ] Added : 22 causal constraints over 5 iterations in 116 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 19:41:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 19:41:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 19:41:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 19:41:44] [INFO ] Added : 21 causal constraints over 5 iterations in 337 ms. Result :sat
Minimization took 121 ms.
[2023-03-23 19:41:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 19:41:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:44] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-23 19:41:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 19:41:44] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2023-03-23 19:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-23 19:41:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 19:41:45] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-23 19:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-23 19:41:45] [INFO ] Added : 36 causal constraints over 8 iterations in 204 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 19:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 19:41:45] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 19:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 19:41:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 19:41:45] [INFO ] Added : 36 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 19:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:45] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-23 19:41:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 19:41:45] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-23 19:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 19:41:45] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 19:41:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2023-03-23 19:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 19:41:45] [INFO ] Added : 36 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1, -1, 3, 5, -1, 3, -1, -1, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 19:41:45] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 52 ms.
[2023-03-23 19:41:45] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 671 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :16
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 246 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 161 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :12
[2023-03-23 19:41:46] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-23 19:41:46] [INFO ] Computed 102 place invariants in 81 ms
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using 95 positive place invariants in 503 ms returned sat
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned unsat
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using 95 positive place invariants in 32 ms returned sat
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned unsat
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 19:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:47] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2023-03-23 19:41:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:48] [INFO ] [Nat]Absence check using 95 positive place invariants in 26 ms returned sat
[2023-03-23 19:41:48] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned unsat
[2023-03-23 19:41:48] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2023-03-23 19:41:48] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-23 19:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:48] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2023-03-23 19:41:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:41:48] [INFO ] [Nat]Absence check using 95 positive place invariants in 28 ms returned sat
[2023-03-23 19:41:48] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-23 19:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:41:49] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-23 19:41:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 19:41:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-23 19:41:49] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 106 ms.
[2023-03-23 19:41:49] [INFO ] Added : 9 causal constraints over 2 iterations in 330 ms. Result :sat
Minimization took 167 ms.
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive place invariants in 192 ms returned sat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned unsat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive place invariants in 26 ms returned sat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 24 ms returned unsat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive place invariants in 24 ms returned sat
[2023-03-23 19:41:50] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 4, 1, 1, 1] Max seen :[1, 1, 1, 0, 1, 1, 4, 1, 1, 1]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 10173 ms.
ITS solved all properties within timeout

BK_STOP 1679600511683

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-COL-S05J40, 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 r297-tall-167873950700653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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