About the Execution of ITS-Tools for PolyORBNT-COL-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.712 | 3600000.00 | 2422522.00 | 721877.10 | 4 ? 1 3 2 1 10 ? 1 1 5 2 4 3 1 1 | normal |
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.r293-tall-167873945700669.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 itstools
Input is PolyORBNT-COL-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945700669
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 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 94K 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-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678932314624
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J80
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-16 02:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 02:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:05:16] [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-16 02:05:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 02:05:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 710 ms
[2023-03-16 02:05:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-16 02:05:16] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-16 02:05:16] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 02:05:16] [INFO ] Computed 13 place invariants in 8 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 02:05:16] [INFO ] Invariant cache hit.
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-16 02:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-16 02:05:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:05:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 02:05:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2023-03-16 02:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-16 02:05:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 02:05:17] [INFO ] Added : 18 causal constraints over 4 iterations in 297 ms. Result :sat
Minimization took 113 ms.
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 02:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-16 02:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-16 02:05:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 02:05:17] [INFO ] Added : 22 causal constraints over 5 iterations in 193 ms. Result :sat
Minimization took 31 ms.
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 02:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 02:05:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-16 02:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-16 02:05:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 02:05:18] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
[2023-03-16 02:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-16 02:05:18] [INFO ] Added : 33 causal constraints over 7 iterations in 138 ms. Result :sat
Minimization took 24 ms.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 02:05:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 02:05:18] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-16 02:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-16 02:05:18] [INFO ] Added : 22 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 02:05:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-16 02:05:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2023-03-16 02:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-16 02:05:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 02:05:18] [INFO ] Added : 20 causal constraints over 5 iterations in 84 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 02:05:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 02:05:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:18] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-16 02:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-16 02:05:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 02:05:18] [INFO ] Added : 21 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 177 ms.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 02:05:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-16 02:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-16 02:05:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 02:05:19] [INFO ] Added : 36 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 02:05:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 02:05:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 02:05:19] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 02:05:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-03-16 02:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-16 02:05:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 02:05:19] [INFO ] Added : 20 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 14 ms.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 02:05:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 02:05:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 02:05:19] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-16 02:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-16 02:05:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 02:05:20] [INFO ] Added : 18 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 51 ms.
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 02:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-16 02:05:20] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2023-03-16 02:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-16 02:05:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 02:05:20] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2023-03-16 02:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-16 02:05:20] [INFO ] Added : 36 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 02:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 02:05:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 02:05:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-16 02:05:20] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2023-03-16 02:05:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-03-16 02:05:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 02:05:20] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [10, 4, 1, 3, 2, 10, -1, -1, 2, 10, 3, -1, -1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-16 02:05:20] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 60 ms.
[2023-03-16 02:05:20] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 80 places in 12 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :26
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :9
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :17
[2023-03-16 02:05:21] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-16 02:05:21] [INFO ] Computed 182 place invariants in 122 ms
[2023-03-16 02:05:21] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2023-03-16 02:05:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned unsat
[2023-03-16 02:05:21] [INFO ] [Real]Absence check using 175 positive place invariants in 47 ms returned sat
[2023-03-16 02:05:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-16 02:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:22] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2023-03-16 02:05:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:22] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-16 02:05:22] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 02:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:23] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2023-03-16 02:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:05:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1089 ms returned sat
[2023-03-16 02:05:24] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 153 ms.
[2023-03-16 02:05:25] [INFO ] Deduced a trap composed of 664 places in 499 ms of which 2 ms to minimize.
[2023-03-16 02:05:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 800 ms
[2023-03-16 02:05:26] [INFO ] Added : 19 causal constraints over 4 iterations in 1633 ms. Result :sat
Minimization took 702 ms.
[2023-03-16 02:05:26] [INFO ] [Real]Absence check using 175 positive place invariants in 61 ms returned sat
[2023-03-16 02:05:26] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 02:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:27] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2023-03-16 02:05:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:27] [INFO ] [Nat]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-16 02:05:27] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 02:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:28] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2023-03-16 02:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2023-03-16 02:05:28] [INFO ] Deduced a trap composed of 403 places in 483 ms of which 1 ms to minimize.
[2023-03-16 02:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 734 ms
[2023-03-16 02:05:29] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 108 ms.
[2023-03-16 02:05:29] [INFO ] Added : 17 causal constraints over 4 iterations in 778 ms. Result :sat
Minimization took 584 ms.
[2023-03-16 02:05:30] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2023-03-16 02:05:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned unsat
[2023-03-16 02:05:30] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-16 02:05:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 27 ms returned unsat
[2023-03-16 02:05:31] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-16 02:05:31] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 16 ms returned unsat
[2023-03-16 02:05:31] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-16 02:05:31] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned unsat
[2023-03-16 02:05:31] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-16 02:05:31] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 10, 1, 1, 4, 1, 1] Max seen :[4, 3, 3, 1, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
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 351 place count 1011 transition count 1522
Applied a total of 351 rules in 368 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-16 02:05:31] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-16 02:05:32] [INFO ] Computed 177 place invariants in 88 ms
[2023-03-16 02:05:33] [INFO ] Dead Transitions using invariants and state equation in 1315 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 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 58 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1749 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:05:33] [INFO ] Computed 177 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 47168 resets, run finished after 5727 ms. (steps per millisecond=174 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2674 resets, run finished after 1526 ms. (steps per millisecond=655 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2663 resets, run finished after 1526 ms. (steps per millisecond=655 ) properties (out of 2) seen :6
[2023-03-16 02:05:42] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:05:42] [INFO ] Computed 177 place invariants in 41 ms
[2023-03-16 02:05:42] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-16 02:05:42] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 02:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:42] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-16 02:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:05:42] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-16 02:05:42] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 02:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:05:43] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-16 02:05:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:05:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 578 ms returned sat
[2023-03-16 02:05:44] [INFO ] Deduced a trap composed of 320 places in 312 ms of which 0 ms to minimize.
[2023-03-16 02:05:44] [INFO ] Deduced a trap composed of 305 places in 322 ms of which 0 ms to minimize.
[2023-03-16 02:05:45] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-16 02:05:45] [INFO ] Deduced a trap composed of 314 places in 328 ms of which 0 ms to minimize.
[2023-03-16 02:05:45] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2023-03-16 02:05:46] [INFO ] Deduced a trap composed of 323 places in 315 ms of which 1 ms to minimize.
[2023-03-16 02:05:46] [INFO ] Deduced a trap composed of 317 places in 313 ms of which 1 ms to minimize.
[2023-03-16 02:05:47] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:05:47] [INFO ] Deduced a trap composed of 345 places in 343 ms of which 0 ms to minimize.
[2023-03-16 02:05:48] [INFO ] Deduced a trap composed of 324 places in 346 ms of which 1 ms to minimize.
[2023-03-16 02:05:48] [INFO ] Deduced a trap composed of 320 places in 347 ms of which 1 ms to minimize.
[2023-03-16 02:05:49] [INFO ] Deduced a trap composed of 338 places in 334 ms of which 0 ms to minimize.
[2023-03-16 02:05:49] [INFO ] Deduced a trap composed of 335 places in 339 ms of which 1 ms to minimize.
[2023-03-16 02:05:50] [INFO ] Deduced a trap composed of 329 places in 301 ms of which 1 ms to minimize.
[2023-03-16 02:05:50] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-16 02:05:50] [INFO ] Deduced a trap composed of 332 places in 329 ms of which 0 ms to minimize.
[2023-03-16 02:05:51] [INFO ] Deduced a trap composed of 317 places in 307 ms of which 1 ms to minimize.
[2023-03-16 02:05:51] [INFO ] Deduced a trap composed of 341 places in 301 ms of which 1 ms to minimize.
[2023-03-16 02:05:52] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 4 ms to minimize.
[2023-03-16 02:05:52] [INFO ] Deduced a trap composed of 353 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:05:52] [INFO ] Deduced a trap composed of 323 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:05:54] [INFO ] Deduced a trap composed of 311 places in 318 ms of which 1 ms to minimize.
[2023-03-16 02:05:54] [INFO ] Deduced a trap composed of 326 places in 316 ms of which 1 ms to minimize.
[2023-03-16 02:05:55] [INFO ] Deduced a trap composed of 317 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:05:56] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 1 ms to minimize.
[2023-03-16 02:05:56] [INFO ] Deduced a trap composed of 329 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:05:57] [INFO ] Deduced a trap composed of 317 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:05:57] [INFO ] Deduced a trap composed of 326 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:05:58] [INFO ] Deduced a trap composed of 329 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:05:59] [INFO ] Deduced a trap composed of 320 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:06:01] [INFO ] Deduced a trap composed of 317 places in 316 ms of which 1 ms to minimize.
[2023-03-16 02:06:04] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 20218 ms
[2023-03-16 02:06:04] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-16 02:06:04] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 02:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:06:04] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-16 02:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:06:04] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-16 02:06:05] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 02:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:06:05] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2023-03-16 02:06:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 123 ms returned sat
[2023-03-16 02:06:06] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-16 02:06:06] [INFO ] Deduced a trap composed of 317 places in 339 ms of which 1 ms to minimize.
[2023-03-16 02:06:06] [INFO ] Deduced a trap composed of 308 places in 327 ms of which 1 ms to minimize.
[2023-03-16 02:06:07] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 2 ms to minimize.
[2023-03-16 02:06:07] [INFO ] Deduced a trap composed of 326 places in 316 ms of which 1 ms to minimize.
[2023-03-16 02:06:08] [INFO ] Deduced a trap composed of 344 places in 322 ms of which 1 ms to minimize.
[2023-03-16 02:06:08] [INFO ] Deduced a trap composed of 320 places in 320 ms of which 0 ms to minimize.
[2023-03-16 02:06:08] [INFO ] Deduced a trap composed of 320 places in 312 ms of which 1 ms to minimize.
[2023-03-16 02:06:09] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:06:09] [INFO ] Deduced a trap composed of 329 places in 315 ms of which 0 ms to minimize.
[2023-03-16 02:06:10] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 1 ms to minimize.
[2023-03-16 02:06:10] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:06:11] [INFO ] Deduced a trap composed of 329 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:06:11] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 0 ms to minimize.
[2023-03-16 02:06:11] [INFO ] Deduced a trap composed of 308 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:06:12] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-16 02:06:12] [INFO ] Deduced a trap composed of 311 places in 310 ms of which 1 ms to minimize.
[2023-03-16 02:06:13] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 0 ms to minimize.
[2023-03-16 02:06:13] [INFO ] Deduced a trap composed of 320 places in 302 ms of which 3 ms to minimize.
[2023-03-16 02:06:14] [INFO ] Deduced a trap composed of 332 places in 318 ms of which 1 ms to minimize.
[2023-03-16 02:06:14] [INFO ] Deduced a trap composed of 332 places in 302 ms of which 1 ms to minimize.
[2023-03-16 02:06:15] [INFO ] Deduced a trap composed of 305 places in 321 ms of which 8 ms to minimize.
[2023-03-16 02:06:15] [INFO ] Deduced a trap composed of 320 places in 324 ms of which 2 ms to minimize.
[2023-03-16 02:06:15] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-16 02:06:16] [INFO ] Deduced a trap composed of 320 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:06:17] [INFO ] Deduced a trap composed of 326 places in 318 ms of which 1 ms to minimize.
[2023-03-16 02:06:17] [INFO ] Deduced a trap composed of 308 places in 308 ms of which 0 ms to minimize.
[2023-03-16 02:06:18] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 0 ms to minimize.
[2023-03-16 02:06:18] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 1 ms to minimize.
[2023-03-16 02:06:18] [INFO ] Deduced a trap composed of 314 places in 317 ms of which 1 ms to minimize.
[2023-03-16 02:06:19] [INFO ] Deduced a trap composed of 305 places in 308 ms of which 0 ms to minimize.
[2023-03-16 02:06:19] [INFO ] Deduced a trap composed of 332 places in 313 ms of which 0 ms to minimize.
[2023-03-16 02:06:20] [INFO ] Deduced a trap composed of 320 places in 298 ms of which 1 ms to minimize.
[2023-03-16 02:06:20] [INFO ] Deduced a trap composed of 329 places in 299 ms of which 1 ms to minimize.
[2023-03-16 02:06:20] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:06:21] [INFO ] Deduced a trap composed of 317 places in 315 ms of which 1 ms to minimize.
[2023-03-16 02:06:21] [INFO ] Deduced a trap composed of 335 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:06:22] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 1 ms to minimize.
[2023-03-16 02:06:22] [INFO ] Deduced a trap composed of 335 places in 318 ms of which 1 ms to minimize.
[2023-03-16 02:06:23] [INFO ] Deduced a trap composed of 344 places in 326 ms of which 1 ms to minimize.
[2023-03-16 02:06:24] [INFO ] Deduced a trap composed of 317 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:06:24] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:06:26] [INFO ] Deduced a trap composed of 314 places in 327 ms of which 1 ms to minimize.
[2023-03-16 02:06:28] [INFO ] Deduced a trap composed of 299 places in 319 ms of which 0 ms to minimize.
[2023-03-16 02:06:30] [INFO ] Deduced a trap composed of 347 places in 342 ms of which 1 ms to minimize.
[2023-03-16 02:06:33] [INFO ] Deduced a trap composed of 329 places in 307 ms of which 1 ms to minimize.
[2023-03-16 02:06:35] [INFO ] Deduced a trap composed of 323 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:06:38] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 32328 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 54 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 44 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-16 02:06:38] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:06:38] [INFO ] Invariant cache hit.
[2023-03-16 02:06:39] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2023-03-16 02:06:39] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:06:39] [INFO ] Invariant cache hit.
[2023-03-16 02:06:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:06:45] [INFO ] Implicit Places using invariants and state equation in 5418 ms returned []
Implicit Place search using SMT with State Equation took 6826 ms to find 0 implicit places.
[2023-03-16 02:06:45] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-16 02:06:45] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:06:45] [INFO ] Invariant cache hit.
[2023-03-16 02:06:46] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7966 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:06:46] [INFO ] Computed 177 place invariants in 39 ms
Incomplete random walk after 10001 steps, including 471 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :3
[2023-03-16 02:06:46] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:06:46] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-16 02:06:46] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-16 02:06:46] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 02:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:06:46] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-16 02:06:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:06:47] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-16 02:06:47] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-16 02:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:06:47] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-16 02:06:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:06:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 583 ms returned sat
[2023-03-16 02:06:48] [INFO ] Deduced a trap composed of 320 places in 328 ms of which 1 ms to minimize.
[2023-03-16 02:06:48] [INFO ] Deduced a trap composed of 305 places in 329 ms of which 1 ms to minimize.
[2023-03-16 02:06:49] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:06:49] [INFO ] Deduced a trap composed of 314 places in 305 ms of which 1 ms to minimize.
[2023-03-16 02:06:49] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:06:50] [INFO ] Deduced a trap composed of 323 places in 322 ms of which 1 ms to minimize.
[2023-03-16 02:06:50] [INFO ] Deduced a trap composed of 317 places in 324 ms of which 1 ms to minimize.
[2023-03-16 02:06:51] [INFO ] Deduced a trap composed of 323 places in 326 ms of which 0 ms to minimize.
[2023-03-16 02:06:51] [INFO ] Deduced a trap composed of 345 places in 339 ms of which 1 ms to minimize.
[2023-03-16 02:06:52] [INFO ] Deduced a trap composed of 324 places in 335 ms of which 1 ms to minimize.
[2023-03-16 02:06:52] [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) : [4] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 52 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-16 02:06:52] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 02:06:52] [INFO ] Computed 177 place invariants in 38 ms
[2023-03-16 02:06:53] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1018 ms. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 02:06:53] [INFO ] Computed 177 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 52302 resets, run finished after 5834 ms. (steps per millisecond=171 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2743 resets, run finished after 1507 ms. (steps per millisecond=663 ) properties (out of 1) seen :3
[2023-03-16 02:07:00] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-16 02:07:00] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-16 02:07:00] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-16 02:07:00] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 02:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:07:01] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2023-03-16 02:07:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:07:01] [INFO ] [Nat]Absence check using 170 positive place invariants in 38 ms returned sat
[2023-03-16 02:07:01] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-16 02:07:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:07:01] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-16 02:07:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:07:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 291 ms returned sat
[2023-03-16 02:07:02] [INFO ] Deduced a trap composed of 326 places in 303 ms of which 1 ms to minimize.
[2023-03-16 02:07:02] [INFO ] Deduced a trap composed of 305 places in 310 ms of which 0 ms to minimize.
[2023-03-16 02:07:03] [INFO ] Deduced a trap composed of 329 places in 304 ms of which 1 ms to minimize.
[2023-03-16 02:07:03] [INFO ] Deduced a trap composed of 329 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:07:04] [INFO ] Deduced a trap composed of 326 places in 307 ms of which 1 ms to minimize.
[2023-03-16 02:07:04] [INFO ] Deduced a trap composed of 323 places in 300 ms of which 1 ms to minimize.
[2023-03-16 02:07:04] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2023-03-16 02:07:05] [INFO ] Deduced a trap composed of 293 places in 304 ms of which 1 ms to minimize.
[2023-03-16 02:07:05] [INFO ] Deduced a trap composed of 326 places in 299 ms of which 0 ms to minimize.
[2023-03-16 02:07:06] [INFO ] Deduced a trap composed of 338 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:07:06] [INFO ] Deduced a trap composed of 326 places in 328 ms of which 1 ms to minimize.
[2023-03-16 02:07:07] [INFO ] Deduced a trap composed of 314 places in 317 ms of which 1 ms to minimize.
[2023-03-16 02:07:08] [INFO ] Deduced a trap composed of 332 places in 299 ms of which 1 ms to minimize.
[2023-03-16 02:07:08] [INFO ] Deduced a trap composed of 305 places in 301 ms of which 1 ms to minimize.
[2023-03-16 02:07:08] [INFO ] Deduced a trap composed of 320 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:07:09] [INFO ] Deduced a trap composed of 323 places in 298 ms of which 1 ms to minimize.
[2023-03-16 02:07:09] [INFO ] Deduced a trap composed of 329 places in 298 ms of which 1 ms to minimize.
[2023-03-16 02:07:10] [INFO ] Deduced a trap composed of 329 places in 306 ms of which 1 ms to minimize.
[2023-03-16 02:07:10] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:07:11] [INFO ] Deduced a trap composed of 308 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:07:11] [INFO ] Deduced a trap composed of 317 places in 299 ms of which 1 ms to minimize.
[2023-03-16 02:07:11] [INFO ] Deduced a trap composed of 329 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:07:12] [INFO ] Deduced a trap composed of 329 places in 324 ms of which 2 ms to minimize.
[2023-03-16 02:07:12] [INFO ] Deduced a trap composed of 314 places in 328 ms of which 0 ms to minimize.
[2023-03-16 02:07:13] [INFO ] Deduced a trap composed of 317 places in 338 ms of which 1 ms to minimize.
[2023-03-16 02:07:14] [INFO ] Deduced a trap composed of 323 places in 321 ms of which 0 ms to minimize.
[2023-03-16 02:07:14] [INFO ] Deduced a trap composed of 356 places in 324 ms of which 1 ms to minimize.
[2023-03-16 02:07:15] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:07:15] [INFO ] Deduced a trap composed of 335 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:07:16] [INFO ] Deduced a trap composed of 324 places in 342 ms of which 1 ms to minimize.
[2023-03-16 02:07:16] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:07:18] [INFO ] Deduced a trap composed of 314 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:07:18] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-16 02:07:18] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:07:19] [INFO ] Deduced a trap composed of 305 places in 322 ms of which 1 ms to minimize.
[2023-03-16 02:07:19] [INFO ] Deduced a trap composed of 299 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:07:20] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:07:21] [INFO ] Deduced a trap composed of 305 places in 325 ms of which 1 ms to minimize.
[2023-03-16 02:07:21] [INFO ] Deduced a trap composed of 329 places in 326 ms of which 3 ms to minimize.
[2023-03-16 02:07:22] [INFO ] Deduced a trap composed of 314 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:07:22] [INFO ] Deduced a trap composed of 332 places in 326 ms of which 1 ms to minimize.
[2023-03-16 02:07:24] [INFO ] Deduced a trap composed of 320 places in 343 ms of which 1 ms to minimize.
[2023-03-16 02:07:25] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 0 ms to minimize.
[2023-03-16 02:07:28] [INFO ] Deduced a trap composed of 338 places in 329 ms of which 1 ms to minimize.
[2023-03-16 02:07:29] [INFO ] Deduced a trap composed of 311 places in 336 ms of which 1 ms to minimize.
[2023-03-16 02:07:30] [INFO ] Deduced a trap composed of 311 places in 304 ms of which 1 ms to minimize.
[2023-03-16 02:07:33] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 31011 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 40 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 36 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-16 02:07:33] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:33] [INFO ] Invariant cache hit.
[2023-03-16 02:07:34] [INFO ] Implicit Places using invariants in 1435 ms returned []
[2023-03-16 02:07:34] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:34] [INFO ] Invariant cache hit.
[2023-03-16 02:07:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:07:40] [INFO ] Implicit Places using invariants and state equation in 5931 ms returned []
Implicit Place search using SMT with State Equation took 7371 ms to find 0 implicit places.
[2023-03-16 02:07:40] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-16 02:07:40] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-16 02:07:40] [INFO ] Invariant cache hit.
[2023-03-16 02:07:41] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8531 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01 in 55711 ms.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:07:41] [INFO ] Computed 177 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 459 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-16 02:07:41] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:07:41] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-16 02:07:42] [INFO ] [Real]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-16 02:07:42] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 02:07:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:07:42] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-16 02:07:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:07:42] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-16 02:07:42] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 02:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:07:43] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-16 02:07:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:07:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 125 ms returned sat
[2023-03-16 02:07:43] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2023-03-16 02:07:44] [INFO ] Deduced a trap composed of 317 places in 324 ms of which 0 ms to minimize.
[2023-03-16 02:07:44] [INFO ] Deduced a trap composed of 308 places in 328 ms of which 1 ms to minimize.
[2023-03-16 02:07:45] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 1 ms to minimize.
[2023-03-16 02:07:45] [INFO ] Deduced a trap composed of 326 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:07:45] [INFO ] Deduced a trap composed of 344 places in 324 ms of which 1 ms to minimize.
[2023-03-16 02:07:46] [INFO ] Deduced a trap composed of 320 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:07:46] [INFO ] Deduced a trap composed of 320 places in 311 ms of which 1 ms to minimize.
[2023-03-16 02:07:47] [INFO ] Deduced a trap composed of 314 places in 304 ms of which 1 ms to minimize.
[2023-03-16 02:07:47] [INFO ] Deduced a trap composed of 329 places in 332 ms of which 1 ms to minimize.
[2023-03-16 02:07:47] [INFO ] Deduced a trap composed of 326 places in 330 ms of which 1 ms to minimize.
[2023-03-16 02:07:47] [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 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-16 02:07:48] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:07:48] [INFO ] Invariant cache hit.
[2023-03-16 02:07:49] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1107 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:07:49] [INFO ] Computed 177 place invariants in 41 ms
Incomplete random walk after 1000000 steps, including 47309 resets, run finished after 5419 ms. (steps per millisecond=184 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2665 resets, run finished after 1497 ms. (steps per millisecond=668 ) properties (out of 1) seen :3
[2023-03-16 02:07:56] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-16 02:07:56] [INFO ] Computed 177 place invariants in 39 ms
[2023-03-16 02:07:56] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-16 02:07:56] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-16 02:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 02:07:56] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-16 02:07:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 02:07:56] [INFO ] [Nat]Absence check using 170 positive place invariants in 36 ms returned sat
[2023-03-16 02:07:56] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-16 02:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 02:07:57] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-16 02:07:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:07:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 125 ms returned sat
[2023-03-16 02:07:57] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 1 ms to minimize.
[2023-03-16 02:07:58] [INFO ] Deduced a trap composed of 317 places in 325 ms of which 1 ms to minimize.
[2023-03-16 02:07:58] [INFO ] Deduced a trap composed of 308 places in 324 ms of which 1 ms to minimize.
[2023-03-16 02:07:59] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 1 ms to minimize.
[2023-03-16 02:07:59] [INFO ] Deduced a trap composed of 326 places in 323 ms of which 1 ms to minimize.
[2023-03-16 02:07:59] [INFO ] Deduced a trap composed of 344 places in 328 ms of which 1 ms to minimize.
[2023-03-16 02:08:00] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 1 ms to minimize.
[2023-03-16 02:08:00] [INFO ] Deduced a trap composed of 320 places in 319 ms of which 1 ms to minimize.
[2023-03-16 02:08:01] [INFO ] Deduced a trap composed of 314 places in 338 ms of which 0 ms to minimize.
[2023-03-16 02:08:01] [INFO ] Deduced a trap composed of 329 places in 331 ms of which 1 ms to minimize.
[2023-03-16 02:08:02] [INFO ] Deduced a trap composed of 326 places in 338 ms of which 1 ms to minimize.
[2023-03-16 02:08:02] [INFO ] Deduced a trap composed of 308 places in 328 ms of which 1 ms to minimize.
[2023-03-16 02:08:02] [INFO ] Deduced a trap composed of 329 places in 310 ms of which 1 ms to minimize.
[2023-03-16 02:08:03] [INFO ] Deduced a trap composed of 323 places in 306 ms of which 0 ms to minimize.
[2023-03-16 02:08:03] [INFO ] Deduced a trap composed of 308 places in 308 ms of which 1 ms to minimize.
[2023-03-16 02:08:04] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 1 ms to minimize.
[2023-03-16 02:08:04] [INFO ] Deduced a trap composed of 311 places in 303 ms of which 0 ms to minimize.
[2023-03-16 02:08:05] [INFO ] Deduced a trap composed of 314 places in 308 ms of which 1 ms to minimize.
[2023-03-16 02:08:05] [INFO ] Deduced a trap composed of 320 places in 292 ms of which 1 ms to minimize.
[2023-03-16 02:08:06] [INFO ] Deduced a trap composed of 332 places in 306 ms of which 1 ms to minimize.
[2023-03-16 02:08:06] [INFO ] Deduced a trap composed of 332 places in 331 ms of which 1 ms to minimize.
[2023-03-16 02:08:07] [INFO ] Deduced a trap composed of 305 places in 308 ms of which 1 ms to minimize.
[2023-03-16 02:08:07] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 0 ms to minimize.
[2023-03-16 02:08:07] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 1 ms to minimize.
[2023-03-16 02:08:08] [INFO ] Deduced a trap composed of 320 places in 322 ms of which 1 ms to minimize.
[2023-03-16 02:08:09] [INFO ] Deduced a trap composed of 326 places in 305 ms of which 1 ms to minimize.
[2023-03-16 02:08:09] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-16 02:08:10] [INFO ] Deduced a trap composed of 332 places in 325 ms of which 1 ms to minimize.
[2023-03-16 02:08:10] [INFO ] Deduced a trap composed of 329 places in 321 ms of which 1 ms to minimize.
[2023-03-16 02:08:10] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 1 ms to minimize.
[2023-03-16 02:08:11] [INFO ] Deduced a trap composed of 305 places in 308 ms of which 1 ms to minimize.
[2023-03-16 02:08:11] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2023-03-16 02:08:12] [INFO ] Deduced a trap composed of 320 places in 304 ms of which 1 ms to minimize.
[2023-03-16 02:08:12] [INFO ] Deduced a trap composed of 329 places in 326 ms of which 1 ms to minimize.
[2023-03-16 02:08:12] [INFO ] Deduced a trap composed of 326 places in 325 ms of which 1 ms to minimize.
[2023-03-16 02:08:13] [INFO ] Deduced a trap composed of 317 places in 326 ms of which 1 ms to minimize.
[2023-03-16 02:08:13] [INFO ] Deduced a trap composed of 335 places in 297 ms of which 1 ms to minimize.
[2023-03-16 02:08:14] [INFO ] Deduced a trap composed of 314 places in 310 ms of which 1 ms to minimize.
[2023-03-16 02:08:14] [INFO ] Deduced a trap composed of 335 places in 314 ms of which 1 ms to minimize.
[2023-03-16 02:08:15] [INFO ] Deduced a trap composed of 344 places in 307 ms of which 1 ms to minimize.
[2023-03-16 02:08:15] [INFO ] Deduced a trap composed of 317 places in 309 ms of which 0 ms to minimize.
[2023-03-16 02:08:16] [INFO ] Deduced a trap composed of 308 places in 329 ms of which 1 ms to minimize.
[2023-03-16 02:08:18] [INFO ] Deduced a trap composed of 314 places in 331 ms of which 1 ms to minimize.
[2023-03-16 02:08:20] [INFO ] Deduced a trap composed of 299 places in 324 ms of which 1 ms to minimize.
[2023-03-16 02:08:22] [INFO ] Deduced a trap composed of 347 places in 353 ms of which 1 ms to minimize.
[2023-03-16 02:08:25] [INFO ] Deduced a trap composed of 329 places in 335 ms of which 1 ms to minimize.
[2023-03-16 02:08:27] [INFO ] Deduced a trap composed of 323 places in 310 ms of which 1 ms to minimize.
[2023-03-16 02:08:30] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 32604 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 40 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 38 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-16 02:08:30] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:08:30] [INFO ] Invariant cache hit.
[2023-03-16 02:08:31] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2023-03-16 02:08:31] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:08:31] [INFO ] Invariant cache hit.
[2023-03-16 02:08:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 02:08:37] [INFO ] Implicit Places using invariants and state equation in 5818 ms returned []
Implicit Place search using SMT with State Equation took 7137 ms to find 0 implicit places.
[2023-03-16 02:08:37] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-16 02:08:37] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-16 02:08:37] [INFO ] Invariant cache hit.
[2023-03-16 02:08:38] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8149 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07 in 56571 ms.
[2023-03-16 02:08:38] [INFO ] Flatten gal took : 159 ms
[2023-03-16 02:08:38] [INFO ] Applying decomposition
[2023-03-16 02:08:38] [INFO ] Flatten gal took : 122 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16981556972153896112.txt' '-o' '/tmp/graph16981556972153896112.bin' '-w' '/tmp/graph16981556972153896112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16981556972153896112.bin' '-l' '-1' '-v' '-w' '/tmp/graph16981556972153896112.weights' '-q' '0' '-e' '0.001'
[2023-03-16 02:08:39] [INFO ] Decomposing Gal with order
[2023-03-16 02:08:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:08:39] [INFO ] Removed a total of 1706 redundant transitions.
[2023-03-16 02:08:39] [INFO ] Flatten gal took : 354 ms
[2023-03-16 02:08:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 47 ms.
[2023-03-16 02:08:39] [INFO ] Time to serialize gal into /tmp/UpperBounds16786656795346461333.gal : 22 ms
[2023-03-16 02:08:39] [INFO ] Time to serialize properties into /tmp/UpperBounds761927769759459694.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16786656795346461333.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds761927769759459694.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds761927769759459694.prop.
Detected timeout of ITS tools.
[2023-03-16 02:31:39] [INFO ] Applying decomposition
[2023-03-16 02:31:39] [INFO ] Flatten gal took : 406 ms
[2023-03-16 02:31:40] [INFO ] Decomposing Gal with order
[2023-03-16 02:31:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 02:31:41] [INFO ] Removed a total of 5164 redundant transitions.
[2023-03-16 02:31:41] [INFO ] Flatten gal took : 584 ms
[2023-03-16 02:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2023-03-16 02:31:41] [INFO ] Time to serialize gal into /tmp/UpperBounds4993607368197739175.gal : 19 ms
[2023-03-16 02:31:41] [INFO ] Time to serialize properties into /tmp/UpperBounds16855090582984099795.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4993607368197739175.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16855090582984099795.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16855090582984099795.prop.
Detected timeout of ITS tools.
[2023-03-16 02:53:06] [INFO ] Flatten gal took : 247 ms
[2023-03-16 02:53:08] [INFO ] Input system was already deterministic with 1427 transitions.
[2023-03-16 02:53:08] [INFO ] Transformed 1011 places.
[2023-03-16 02:53:08] [INFO ] Transformed 1427 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 02:53:38] [INFO ] Time to serialize gal into /tmp/UpperBounds4922640190842525109.gal : 29 ms
[2023-03-16 02:53:38] [INFO ] Time to serialize properties into /tmp/UpperBounds14415465651983503527.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4922640190842525109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14415465651983503527.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14415465651983503527.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1064880 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16239336 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J80, 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 r293-tall-167873945700669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 '
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 ;