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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679597824172

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 18:57:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 18:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:57: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 18:57:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 18:57:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 680 ms
[2023-03-23 18:57:06] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 18:57:06] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-23 18:57:06] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 18:57:06] [INFO ] Computed 13 place invariants in 9 ms
FORMULA PolyORBNT-COL-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 18:57:06] [INFO ] Invariant cache hit.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 18:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-23 18:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
[2023-03-23 18:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-23 18:57:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 18:57:07] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-23 18:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-23 18:57:07] [INFO ] Added : 36 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 18:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:07] [INFO ] Added : 33 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 18:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-23 18:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-23 18:57:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:07] [INFO ] Added : 21 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 48 ms.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 18:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2023-03-23 18:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-23 18:57:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2023-03-23 18:57:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2023-03-23 18:57:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-23 18:57:08] [INFO ] Added : 36 causal constraints over 8 iterations in 185 ms. Result :sat
Minimization took 210 ms.
[2023-03-23 18:57:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 18:57:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-23 18:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 18:57:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 18:57:08] [INFO ] Added : 21 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 185 ms.
[2023-03-23 18:57:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 18:57:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:08] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 18:57:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-23 18:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-23 18:57:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-23 18:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-23 18:57:09] [INFO ] Added : 36 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 18:57:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 18:57:09] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2023-03-23 18:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-23 18:57:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:09] [INFO ] Added : 20 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 20 ms.
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 18:57:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 18:57:09] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-23 18:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-23 18:57:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:09] [INFO ] Added : 18 causal constraints over 4 iterations in 285 ms. Result :sat
Minimization took 62 ms.
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 18:57:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:09] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 18:57:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 18:57:10] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 18:57:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-23 18:57:10] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2023-03-23 18:57:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2023-03-23 18:57:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2023-03-23 18:57:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:10] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 22 ms.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 18:57:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2023-03-23 18:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 18:57:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 18:57:10] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2023-03-23 18:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 18:57:10] [INFO ] Added : 33 causal constraints over 7 iterations in 155 ms. Result :sat
Minimization took 30 ms.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 18:57:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 18:57:10] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 18:57:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 18:57:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 18:57:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2023-03-23 18:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-23 18:57:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 18:57:10] [INFO ] Added : 15 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [1, 5, 3, 10, 10, -1, 2, 10, -1, -1, 1, 5, 1]
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 18:57:10] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 54 ms.
[2023-03-23 18:57:10] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 679 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :31
FORMULA PolyORBNT-COL-S05J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 190 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :15
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 170 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :16
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :18
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :18
[2023-03-23 18:57:11] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-23 18:57:11] [INFO ] Computed 82 place invariants in 44 ms
[2023-03-23 18:57:11] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-23 18:57:11] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 18:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:11] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-23 18:57:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 29 ms returned sat
[2023-03-23 18:57:11] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 18:57:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:12] [INFO ] [Nat]Absence check using state equation in 667 ms returned unsat
[2023-03-23 18:57:12] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 18:57:12] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:12] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-23 18:57:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 18:57:12] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:17] [INFO ] [Nat]Absence check using state equation in 4910 ms returned unknown
[2023-03-23 18:57:17] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2023-03-23 18:57:17] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:18] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-23 18:57:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:18] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 18:57:18] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:18] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-23 18:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-23 18:57:18] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 72 ms.
[2023-03-23 18:57:18] [INFO ] Added : 14 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 117 ms.
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 13 ms returned unsat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2023-03-23 18:57:19] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 10, 10, 1, 4, 1, 1] Max seen :[4, 4, 3, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 146 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2023-03-23 18:57:19] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2023-03-23 18:57:19] [INFO ] Computed 77 place invariants in 18 ms
[2023-03-23 18:57:20] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 37 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:57:20] [INFO ] Computed 77 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 47225 resets, run finished after 3994 ms. (steps per millisecond=250 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4134 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 5454 resets, run finished after 976 ms. (steps per millisecond=1024 ) properties (out of 2) seen :7
[2023-03-23 18:57:25] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:57:25] [INFO ] Computed 77 place invariants in 11 ms
[2023-03-23 18:57:26] [INFO ] [Real]Absence check using 70 positive place invariants in 15 ms returned sat
[2023-03-23 18:57:26] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:57:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:26] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-23 18:57:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:26] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-23 18:57:26] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:26] [INFO ] [Nat]Absence check using state equation in 404 ms returned unsat
[2023-03-23 18:57:26] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-23 18:57:26] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:57:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:27] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-23 18:57:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:27] [INFO ] [Nat]Absence check using 70 positive place invariants in 15 ms returned sat
[2023-03-23 18:57:27] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 18:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:27] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2023-03-23 18:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2023-03-23 18:57:27] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 0 ms to minimize.
[2023-03-23 18:57:27] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 1 ms to minimize.
[2023-03-23 18:57:27] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 1 ms to minimize.
[2023-03-23 18:57:28] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 1 ms to minimize.
[2023-03-23 18:57:28] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 1 ms to minimize.
[2023-03-23 18:57:28] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 1 ms to minimize.
[2023-03-23 18:57:28] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 1 ms to minimize.
[2023-03-23 18:57:28] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 1 ms to minimize.
[2023-03-23 18:57:29] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-23 18:57:29] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:57:29] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 0 ms to minimize.
[2023-03-23 18:57:29] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-23 18:57:30] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 1 ms to minimize.
[2023-03-23 18:57:30] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 0 ms to minimize.
[2023-03-23 18:57:30] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 0 ms to minimize.
[2023-03-23 18:57:30] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:57:30] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:57:31] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 1 ms to minimize.
[2023-03-23 18:57:31] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 1 ms to minimize.
[2023-03-23 18:57:31] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 0 ms to minimize.
[2023-03-23 18:57:31] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 1 ms to minimize.
[2023-03-23 18:57:31] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2023-03-23 18:57:31] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 0 ms to minimize.
[2023-03-23 18:57:32] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2023-03-23 18:57:32] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 0 ms to minimize.
[2023-03-23 18:57:32] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 1 ms to minimize.
[2023-03-23 18:57:32] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 1 ms to minimize.
[2023-03-23 18:57:32] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 1 ms to minimize.
[2023-03-23 18:57:33] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 1 ms to minimize.
[2023-03-23 18:57:33] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 0 ms to minimize.
[2023-03-23 18:57:33] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 0 ms to minimize.
[2023-03-23 18:57:33] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:57:34] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 0 ms to minimize.
[2023-03-23 18:57:34] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 2 ms to minimize.
[2023-03-23 18:57:35] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:57:35] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 0 ms to minimize.
[2023-03-23 18:57:35] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 0 ms to minimize.
[2023-03-23 18:57:35] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 1 ms to minimize.
[2023-03-23 18:57:35] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:57:36] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 1 ms to minimize.
[2023-03-23 18:57:36] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 1 ms to minimize.
[2023-03-23 18:57:36] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 1 ms to minimize.
[2023-03-23 18:57:36] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:57:37] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:57:37] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 1 ms to minimize.
[2023-03-23 18:57:38] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:57:38] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:57:38] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2023-03-23 18:57:38] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 2 ms to minimize.
[2023-03-23 18:57:38] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:57:41] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 14476 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[4, 3]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 19 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:57:41] [INFO ] Computed 77 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 47364 resets, run finished after 4169 ms. (steps per millisecond=239 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5494 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 1) seen :3
[2023-03-23 18:57:47] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:57:47] [INFO ] Computed 77 place invariants in 16 ms
[2023-03-23 18:57:47] [INFO ] [Real]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-23 18:57:47] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 18:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:47] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-23 18:57:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:57:47] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-23 18:57:47] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:57:47] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-23 18:57:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:57:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
[2023-03-23 18:57:47] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 2 ms to minimize.
[2023-03-23 18:57:48] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 4 ms to minimize.
[2023-03-23 18:57:48] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 1 ms to minimize.
[2023-03-23 18:57:48] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2023-03-23 18:57:48] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:57:48] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 1 ms to minimize.
[2023-03-23 18:57:49] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:57:49] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:57:49] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2023-03-23 18:57:49] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 1 ms to minimize.
[2023-03-23 18:57:49] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:57:50] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:57:50] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 0 ms to minimize.
[2023-03-23 18:57:50] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:57:50] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:57:50] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 0 ms to minimize.
[2023-03-23 18:57:50] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 0 ms to minimize.
[2023-03-23 18:57:51] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2023-03-23 18:57:51] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:57:51] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 0 ms to minimize.
[2023-03-23 18:57:51] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-23 18:57:51] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2023-03-23 18:57:51] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 1 ms to minimize.
[2023-03-23 18:57:52] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:57:52] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:57:52] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 0 ms to minimize.
[2023-03-23 18:57:52] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:57:52] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 1 ms to minimize.
[2023-03-23 18:57:53] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 1 ms to minimize.
[2023-03-23 18:57:53] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 1 ms to minimize.
[2023-03-23 18:57:53] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:57:53] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 1 ms to minimize.
[2023-03-23 18:57:54] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 1 ms to minimize.
[2023-03-23 18:57:54] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 1 ms to minimize.
[2023-03-23 18:57:55] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 0 ms to minimize.
[2023-03-23 18:57:55] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2023-03-23 18:57:55] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2023-03-23 18:57:55] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:57:55] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 1 ms to minimize.
[2023-03-23 18:57:56] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 1 ms to minimize.
[2023-03-23 18:57:56] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2023-03-23 18:57:56] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-23 18:57:56] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 0 ms to minimize.
[2023-03-23 18:57:57] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:57:57] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 1 ms to minimize.
[2023-03-23 18:57:58] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 0 ms to minimize.
[2023-03-23 18:57:58] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 1 ms to minimize.
[2023-03-23 18:57:58] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 1 ms to minimize.
[2023-03-23 18:57:58] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:57:58] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2023-03-23 18:58:01] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 14066 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-23 18:58:01] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:01] [INFO ] Invariant cache hit.
[2023-03-23 18:58:02] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-23 18:58:02] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:02] [INFO ] Invariant cache hit.
[2023-03-23 18:58:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:58:04] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2023-03-23 18:58:04] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 18:58:04] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:04] [INFO ] Invariant cache hit.
[2023-03-23 18:58:04] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2511 ms. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-05
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:58:04] [INFO ] Computed 77 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 459 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :3
[2023-03-23 18:58:04] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:58:04] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-23 18:58:04] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-23 18:58:04] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 18:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:04] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-23 18:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:58:04] [INFO ] [Nat]Absence check using 70 positive place invariants in 15 ms returned sat
[2023-03-23 18:58:04] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:05] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2023-03-23 18:58:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:58:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 60 ms returned sat
[2023-03-23 18:58:05] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 0 ms to minimize.
[2023-03-23 18:58:05] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:58:05] [INFO ] Deduced a trap composed of 143 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:58:05] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:58:05] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 1 ms to minimize.
[2023-03-23 18:58:06] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 1 ms to minimize.
[2023-03-23 18:58:06] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:58:06] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 1 ms to minimize.
[2023-03-23 18:58:06] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:58:07] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:58:07] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 1 ms to minimize.
[2023-03-23 18:58:07] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2023-03-23 18:58:07] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 0 ms to minimize.
[2023-03-23 18:58:07] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2023-03-23 18:58:07] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 0 ms to minimize.
[2023-03-23 18:58:08] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2023-03-23 18:58:08] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 1 ms to minimize.
[2023-03-23 18:58:08] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 1 ms to minimize.
[2023-03-23 18:58:08] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2023-03-23 18:58:08] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 1 ms to minimize.
[2023-03-23 18:58:08] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:58:09] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2023-03-23 18:58:09] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:58:09] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:58:09] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2023-03-23 18:58:09] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-23 18:58:09] [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) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 22 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-23 18:58:09] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:09] [INFO ] Invariant cache hit.
[2023-03-23 18:58:10] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:58:10] [INFO ] Computed 77 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47386 resets, run finished after 4056 ms. (steps per millisecond=246 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5475 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 1) seen :3
[2023-03-23 18:58:15] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 18:58:15] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-23 18:58:15] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-23 18:58:15] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:15] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-23 18:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 18:58:15] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2023-03-23 18:58:15] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 18:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 18:58:16] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-23 18:58:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:58:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
[2023-03-23 18:58:16] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 0 ms to minimize.
[2023-03-23 18:58:16] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 0 ms to minimize.
[2023-03-23 18:58:16] [INFO ] Deduced a trap composed of 143 places in 172 ms of which 1 ms to minimize.
[2023-03-23 18:58:16] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 1 ms to minimize.
[2023-03-23 18:58:17] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 0 ms to minimize.
[2023-03-23 18:58:17] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 1 ms to minimize.
[2023-03-23 18:58:17] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 0 ms to minimize.
[2023-03-23 18:58:17] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 1 ms to minimize.
[2023-03-23 18:58:18] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:58:18] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 0 ms to minimize.
[2023-03-23 18:58:18] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 1 ms to minimize.
[2023-03-23 18:58:18] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2023-03-23 18:58:18] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 1 ms to minimize.
[2023-03-23 18:58:18] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-23 18:58:19] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:58:19] [INFO ] Deduced a trap composed of 122 places in 118 ms of which 1 ms to minimize.
[2023-03-23 18:58:19] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 1 ms to minimize.
[2023-03-23 18:58:19] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:58:19] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:58:20] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 0 ms to minimize.
[2023-03-23 18:58:20] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 1 ms to minimize.
[2023-03-23 18:58:20] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:58:20] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:58:20] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 1 ms to minimize.
[2023-03-23 18:58:21] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:58:21] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 0 ms to minimize.
[2023-03-23 18:58:21] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:58:21] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 1 ms to minimize.
[2023-03-23 18:58:21] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 0 ms to minimize.
[2023-03-23 18:58:22] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:58:22] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 0 ms to minimize.
[2023-03-23 18:58:22] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 0 ms to minimize.
[2023-03-23 18:58:22] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 1 ms to minimize.
[2023-03-23 18:58:23] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 1 ms to minimize.
[2023-03-23 18:58:23] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 0 ms to minimize.
[2023-03-23 18:58:24] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 1 ms to minimize.
[2023-03-23 18:58:24] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2023-03-23 18:58:24] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 0 ms to minimize.
[2023-03-23 18:58:24] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 0 ms to minimize.
[2023-03-23 18:58:24] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 1 ms to minimize.
[2023-03-23 18:58:25] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 0 ms to minimize.
[2023-03-23 18:58:25] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2023-03-23 18:58:25] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 0 ms to minimize.
[2023-03-23 18:58:26] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 1 ms to minimize.
[2023-03-23 18:58:26] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 0 ms to minimize.
[2023-03-23 18:58:27] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2023-03-23 18:58:27] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 0 ms to minimize.
[2023-03-23 18:58:27] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 0 ms to minimize.
[2023-03-23 18:58:27] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2023-03-23 18:58:27] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 0 ms to minimize.
[2023-03-23 18:58:30] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 14734 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 14 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-23 18:58:30] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:30] [INFO ] Invariant cache hit.
[2023-03-23 18:58:31] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-23 18:58:31] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:31] [INFO ] Invariant cache hit.
[2023-03-23 18:58:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 18:58:32] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2023-03-23 18:58:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-23 18:58:32] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 18:58:32] [INFO ] Invariant cache hit.
[2023-03-23 18:58:32] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2046 ms. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-05 in 28517 ms.
[2023-03-23 18:58:33] [INFO ] Flatten gal took : 93 ms
[2023-03-23 18:58:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-23 18:58:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 411 places, 577 transitions and 2961 arcs took 5 ms.
Total runtime 86992 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/1218/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14849708 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16096428 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="PolyORBNT-COL-S05J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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