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-167873950300365.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 PolyORBLF-COL-S02J04T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950300365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.2K Feb 26 13:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 14:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 14:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T10-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679505969268

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=PolyORBLF-COL-S02J04T10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 17:26:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 17:26:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:26:11] [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-22 17:26:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 17:26:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 840 ms
[2023-03-22 17:26:12] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 17:26:12] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-22 17:26:12] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 17:26:12] [INFO ] Computed 26 place invariants in 15 ms
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 17:26:12] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 17:26:12] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-22 17:26:12] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-22 17:26:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-22 17:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:12] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 17:26:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 17:26:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:12] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-22 17:26:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 17:26:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-22 17:26:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 17:26:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 4 ms to minimize.
[2023-03-22 17:26:12] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2023-03-22 17:26:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-22 17:26:12] [INFO ] Added : 61 causal constraints over 15 iterations in 273 ms. Result :sat
Minimization took 100 ms.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-22 17:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 17:26:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 17:26:13] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 17:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2023-03-22 17:26:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 17:26:13] [INFO ] Added : 26 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 17:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2023-03-22 17:26:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 17:26:13] [INFO ] Added : 25 causal constraints over 6 iterations in 55 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:26:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:13] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2023-03-22 17:26:13] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 17:26:13] [INFO ] Added : 10 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2023-03-22 17:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 17:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2023-03-22 17:26:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 17:26:14] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 13 ms.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 17:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:26:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 17:26:14] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-22 17:26:14] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2023-03-22 17:26:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-22 17:26:14] [INFO ] Added : 58 causal constraints over 12 iterations in 217 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:26:14] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-22 17:26:14] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 17:26:14] [INFO ] Added : 30 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:14] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 17:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 17:26:15] [INFO ] Added : 14 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 17:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-22 17:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 17:26:15] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:26:15] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2023-03-22 17:26:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-22 17:26:15] [INFO ] Added : 22 causal constraints over 6 iterations in 137 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 17:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2023-03-22 17:26:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-22 17:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 17:26:15] [INFO ] Added : 27 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 17:26:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:15] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-22 17:26:15] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 17:26:15] [INFO ] Added : 39 causal constraints over 9 iterations in 82 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [10, 3, 1, 1, 10, 3, 20, 1, 10, 1, 2, 2]
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
[2023-03-22 17:26:16] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 39 ms.
[2023-03-22 17:26:16] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :23
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :26
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :11
[2023-03-22 17:26:16] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2023-03-22 17:26:16] [INFO ] Computed 54 place invariants in 64 ms
[2023-03-22 17:26:16] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-22 17:26:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned unsat
[2023-03-22 17:26:16] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2023-03-22 17:26:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 15 ms returned unsat
[2023-03-22 17:26:16] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-22 17:26:16] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned sat
[2023-03-22 17:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:17] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2023-03-22 17:26:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-22 17:26:17] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-22 17:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:18] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2023-03-22 17:26:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 17:26:19] [INFO ] [Nat]Added 120 Read/Feed constraints in 960 ms returned sat
[2023-03-22 17:26:19] [INFO ] Deduced a trap composed of 222 places in 341 ms of which 1 ms to minimize.
[2023-03-22 17:26:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 426 ms
[2023-03-22 17:26:20] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-22 17:26:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 14 ms returned unsat
[2023-03-22 17:26:20] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-22 17:26:20] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 24 ms returned sat
[2023-03-22 17:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:20] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-22 17:26:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-03-22 17:26:21] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 74 ms returned sat
[2023-03-22 17:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:25] [INFO ] [Nat]Absence check using state equation in 4824 ms returned unknown
[2023-03-22 17:26:25] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-22 17:26:26] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 31 ms returned unsat
[2023-03-22 17:26:26] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-22 17:26:26] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 23 ms returned sat
[2023-03-22 17:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:26:26] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-22 17:26:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:26:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-03-22 17:26:26] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 22 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 9, 1, 20, 1, 1] Max seen :[1, 1, 9, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-04 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 162 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 162 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 322 place count 590 transition count 1252
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 482 place count 510 transition count 1172
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 492 place count 510 transition count 1162
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 502 place count 500 transition count 1162
Applied a total of 502 rules in 226 ms. Remains 500 /752 variables (removed 252) and now considering 1162/1412 (removed 250) transitions.
[2023-03-22 17:26:26] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 500 cols
[2023-03-22 17:26:27] [INFO ] Computed 52 place invariants in 31 ms
[2023-03-22 17:26:27] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/752 places, 1052/1412 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 498 transition count 1032
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 478 transition count 1012
Applied a total of 22 rules in 34 ms. Remains 478 /500 variables (removed 22) and now considering 1012/1052 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 912 ms. Remains : 478/752 places, 1012/1412 transitions.
Normalized transition count is 992 out of 1012 initially.
// Phase 1: matrix 992 rows 478 cols
[2023-03-22 17:26:27] [INFO ] Computed 52 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 308 resets, run finished after 4594 ms. (steps per millisecond=217 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 129 resets, run finished after 2189 ms. (steps per millisecond=456 ) properties (out of 1) seen :2
[2023-03-22 17:26:34] [INFO ] Flow matrix only has 992 transitions (discarded 20 similar events)
// Phase 1: matrix 992 rows 478 cols
[2023-03-22 17:26:34] [INFO ] Computed 52 place invariants in 25 ms
[2023-03-22 17:26:34] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-22 17:26:34] [INFO ] [Real]Absence check using 10 positive and 42 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [2] Max seen :[2]
FORMULA PolyORBLF-COL-S02J04T10-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23436 ms.
ITS solved all properties within timeout

BK_STOP 1679505995490

--------------------
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="PolyORBLF-COL-S02J04T10"
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 PolyORBLF-COL-S02J04T10, 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-167873950300365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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