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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 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-S06J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679529784523

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-S06J04T06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 00:03:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 00:03:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:03:06] [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 00:03:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 00:03:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 622 ms
[2023-03-23 00:03:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 00:03:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-23 00:03:07] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-23 00:03:07] [INFO ] Computed 26 place invariants in 11 ms
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 00:03:07] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-23 00:03:07] [INFO ] Computed 26 place invariants in 7 ms
[2023-03-23 00:03:07] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-23 00:03:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-23 00:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:07] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-23 00:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-23 00:03:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-23 00:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-23 00:03:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-23 00:03:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-23 00:03:07] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-23 00:03:07] [INFO ] Added : 32 causal constraints over 7 iterations in 83 ms. Result :sat
Minimization took 39 ms.
[2023-03-23 00:03:07] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-23 00:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 00:03:08] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 4 ms to minimize.
[2023-03-23 00:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-23 00:03:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-23 00:03:08] [INFO ] Added : 37 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-23 00:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-23 00:03:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-23 00:03:08] [INFO ] Added : 59 causal constraints over 13 iterations in 133 ms. Result :sat
Minimization took 24 ms.
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:08] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 00:03:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:08] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-23 00:03:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 00:03:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 00:03:08] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 23 ms.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-23 00:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 26 ms returned sat
[2023-03-23 00:03:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-23 00:03:09] [INFO ] Added : 50 causal constraints over 10 iterations in 92 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 00:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:03:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 00:03:09] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 00:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2023-03-23 00:03:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-23 00:03:09] [INFO ] Added : 22 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 00:03:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 00:03:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-23 00:03:09] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2023-03-23 00:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-23 00:03:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 00:03:10] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 2 ms to minimize.
[2023-03-23 00:03:10] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2023-03-23 00:03:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-23 00:03:10] [INFO ] Added : 53 causal constraints over 11 iterations in 186 ms. Result :sat
Minimization took 23 ms.
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-23 00:03:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:10] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:03:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:03:10] [INFO ] Added : 55 causal constraints over 11 iterations in 109 ms. Result :sat
Minimization took 30 ms.
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 00:03:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:10] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 00:03:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:03:10] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2023-03-23 00:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-23 00:03:10] [INFO ] Added : 54 causal constraints over 11 iterations in 145 ms. Result :sat
Minimization took 19 ms.
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:10] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 00:03:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:03:11] [INFO ] Added : 31 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-23 00:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 00:03:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 00:03:11] [INFO ] Added : 30 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 95 ms.
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 00:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2023-03-23 00:03:11] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2023-03-23 00:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-23 00:03:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:03:11] [INFO ] Added : 22 causal constraints over 5 iterations in 39 ms. Result :sat
Minimization took 32 ms.
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 00:03:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:11] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-23 00:03:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-23 00:03:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:03:12] [INFO ] Added : 52 causal constraints over 11 iterations in 101 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [41, 1, 1, 2, 1, 1, 1, 1, 10, 3, 6, 1, 3, 6, 6]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2023-03-23 00:03:12] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 179 ms.
[2023-03-23 00:03:12] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 14) seen :28
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :13
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :11
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :11
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-23 00:03:12] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2023-03-23 00:03:12] [INFO ] Computed 54 place invariants in 122 ms
[2023-03-23 00:03:12] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-23 00:03:12] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 35 ms returned unsat
[2023-03-23 00:03:13] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-23 00:03:13] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 51 ms returned unsat
[2023-03-23 00:03:13] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-23 00:03:13] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 48 ms returned sat
[2023-03-23 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:14] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2023-03-23 00:03:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-23 00:03:14] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 46 ms returned sat
[2023-03-23 00:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:15] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2023-03-23 00:03:15] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:03:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 00:03:19] [INFO ] [Nat]Added 168 Read/Feed constraints in 3644 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 1, 6] Max seen :[4, 1, 4]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 36 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 114 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 258 place count 500 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 402 place count 428 transition count 2232
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 428 transition count 2220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 426 place count 416 transition count 2220
Applied a total of 426 rules in 364 ms. Remains 416 /632 variables (removed 216) and now considering 2220/2430 (removed 210) transitions.
[2023-03-23 00:03:19] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
// Phase 1: matrix 2184 rows 416 cols
[2023-03-23 00:03:19] [INFO ] Computed 48 place invariants in 78 ms
[2023-03-23 00:03:20] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 416/632 places, 1302/2430 transitions.
Applied a total of 0 rules in 37 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1519 ms. Remains : 416/632 places, 1302/2430 transitions.
Normalized transition count is 1266 out of 1302 initially.
// Phase 1: matrix 1266 rows 416 cols
[2023-03-23 00:03:20] [INFO ] Computed 48 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 11545 resets, run finished after 6722 ms. (steps per millisecond=148 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2097 resets, run finished after 2858 ms. (steps per millisecond=349 ) properties (out of 1) seen :4
[2023-03-23 00:03:30] [INFO ] Flow matrix only has 1266 transitions (discarded 36 similar events)
// Phase 1: matrix 1266 rows 416 cols
[2023-03-23 00:03:30] [INFO ] Computed 48 place invariants in 26 ms
[2023-03-23 00:03:30] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-23 00:03:30] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-23 00:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:30] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-23 00:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-23 00:03:30] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-23 00:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:31] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2023-03-23 00:03:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:03:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 00:03:37] [INFO ] [Nat]Added 168 Read/Feed constraints in 6017 ms returned unknown
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1302/1302 transitions.
Applied a total of 0 rules in 23 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 416/416 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1302/1302 transitions.
Applied a total of 0 rules in 22 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-23 00:03:37] [INFO ] Flow matrix only has 1266 transitions (discarded 36 similar events)
[2023-03-23 00:03:37] [INFO ] Invariant cache hit.
[2023-03-23 00:03:37] [INFO ] Implicit Places using invariants in 412 ms returned [352, 353, 354, 355, 356, 357]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 422 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/416 places, 1302/1302 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 1296
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 1296
Applied a total of 12 rules in 45 ms. Remains 404 /410 variables (removed 6) and now considering 1296/1302 (removed 6) transitions.
[2023-03-23 00:03:37] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:03:37] [INFO ] Computed 42 place invariants in 25 ms
[2023-03-23 00:03:38] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-23 00:03:38] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:03:38] [INFO ] Invariant cache hit.
[2023-03-23 00:03:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:03:46] [INFO ] Implicit Places using invariants and state equation in 8381 ms returned []
Implicit Place search using SMT with State Equation took 8827 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 404/416 places, 1296/1302 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9317 ms. Remains : 404/416 places, 1296/1302 transitions.
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:03:46] [INFO ] Computed 42 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 11630 resets, run finished after 6282 ms. (steps per millisecond=159 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2078 resets, run finished after 2783 ms. (steps per millisecond=359 ) properties (out of 1) seen :4
[2023-03-23 00:03:55] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:03:55] [INFO ] Computed 42 place invariants in 25 ms
[2023-03-23 00:03:55] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 00:03:55] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-23 00:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:56] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-23 00:03:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:03:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 00:03:56] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-23 00:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:03:56] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-23 00:03:56] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:03:58] [INFO ] [Nat]Added 168 Read/Feed constraints in 1655 ms returned sat
[2023-03-23 00:03:59] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2023-03-23 00:04:00] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 0 ms to minimize.
[2023-03-23 00:04:00] [INFO ] Deduced a trap composed of 50 places in 326 ms of which 1 ms to minimize.
[2023-03-23 00:04:01] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 0 ms to minimize.
[2023-03-23 00:04:01] [INFO ] Deduced a trap composed of 182 places in 325 ms of which 1 ms to minimize.
[2023-03-23 00:04:03] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 0 ms to minimize.
[2023-03-23 00:04:04] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2023-03-23 00:04:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5754 ms
[2023-03-23 00:04:04] [INFO ] Computed and/alt/rep : 750/4031/745 causal constraints (skipped 509 transitions) in 130 ms.
[2023-03-23 00:04:06] [INFO ] Added : 119 causal constraints over 24 iterations in 2345 ms. Result :sat
Minimization took 1829 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 23 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 21 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-23 00:04:11] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:04:11] [INFO ] Invariant cache hit.
[2023-03-23 00:04:11] [INFO ] Implicit Places using invariants in 638 ms returned []
[2023-03-23 00:04:11] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:04:11] [INFO ] Invariant cache hit.
[2023-03-23 00:04:12] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:04:19] [INFO ] Implicit Places using invariants and state equation in 7965 ms returned []
Implicit Place search using SMT with State Equation took 8609 ms to find 0 implicit places.
[2023-03-23 00:04:20] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-23 00:04:20] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:04:20] [INFO ] Invariant cache hit.
[2023-03-23 00:04:20] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9393 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J04T06-UpperBounds-14
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:04:20] [INFO ] Computed 42 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 115 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :4
[2023-03-23 00:04:20] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:04:20] [INFO ] Computed 42 place invariants in 24 ms
[2023-03-23 00:04:20] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-23 00:04:20] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-23 00:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:21] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-23 00:04:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 00:04:21] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-23 00:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:21] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-23 00:04:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:04:23] [INFO ] [Nat]Added 168 Read/Feed constraints in 1692 ms returned sat
[2023-03-23 00:04:24] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 1 ms to minimize.
[2023-03-23 00:04:25] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 0 ms to minimize.
[2023-03-23 00:04:25] [INFO ] Deduced a trap composed of 50 places in 301 ms of which 0 ms to minimize.
[2023-03-23 00:04:26] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 1 ms to minimize.
[2023-03-23 00:04:26] [INFO ] Deduced a trap composed of 182 places in 324 ms of which 1 ms to minimize.
[2023-03-23 00:04:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 24 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-23 00:04:26] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:04:26] [INFO ] Invariant cache hit.
[2023-03-23 00:04:27] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719 ms. Remains : 404/404 places, 1296/1296 transitions.
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:04:27] [INFO ] Computed 42 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 11659 resets, run finished after 6682 ms. (steps per millisecond=149 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2019 resets, run finished after 2888 ms. (steps per millisecond=346 ) properties (out of 1) seen :4
[2023-03-23 00:04:36] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-23 00:04:36] [INFO ] Computed 42 place invariants in 28 ms
[2023-03-23 00:04:37] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 00:04:37] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-23 00:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:37] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-23 00:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:04:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-23 00:04:37] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-23 00:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:04:38] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-23 00:04:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:04:39] [INFO ] [Nat]Added 168 Read/Feed constraints in 1685 ms returned sat
[2023-03-23 00:04:40] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 0 ms to minimize.
[2023-03-23 00:04:41] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 1 ms to minimize.
[2023-03-23 00:04:41] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 0 ms to minimize.
[2023-03-23 00:04:42] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 1 ms to minimize.
[2023-03-23 00:04:42] [INFO ] Deduced a trap composed of 182 places in 318 ms of which 1 ms to minimize.
[2023-03-23 00:04:44] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2023-03-23 00:04:45] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2023-03-23 00:04:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5750 ms
[2023-03-23 00:04:45] [INFO ] Computed and/alt/rep : 750/4031/745 causal constraints (skipped 509 transitions) in 130 ms.
[2023-03-23 00:04:47] [INFO ] Added : 119 causal constraints over 24 iterations in 2264 ms. Result :sat
Minimization took 1857 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 25 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 21 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-23 00:04:52] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:04:52] [INFO ] Invariant cache hit.
[2023-03-23 00:04:53] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-23 00:04:53] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:04:53] [INFO ] Invariant cache hit.
[2023-03-23 00:04:53] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-23 00:05:00] [INFO ] Implicit Places using invariants and state equation in 7457 ms returned []
Implicit Place search using SMT with State Equation took 8108 ms to find 0 implicit places.
[2023-03-23 00:05:00] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 00:05:00] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-23 00:05:00] [INFO ] Invariant cache hit.
[2023-03-23 00:05:01] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8862 ms. Remains : 404/404 places, 1296/1296 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T06-UpperBounds-14 in 40545 ms.
[2023-03-23 00:05:01] [INFO ] Flatten gal took : 185 ms
[2023-03-23 00:05:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-23 00:05:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 404 places, 1296 transitions and 7986 arcs took 9 ms.
Total runtime 114961 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/716/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15171304 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092712 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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