Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800246.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r307-tajo-171654460800246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 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 1717127640695

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=gold2023
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 202304061127
[2024-05-31 03:54:02] [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]
[2024-05-31 03:54:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:54:02] [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.
[2024-05-31 03:54:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:54:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 489 ms
[2024-05-31 03:54:03] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
[2024-05-31 03:54:03] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-31 03:54:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:54:03] [INFO ] Computed 13 invariants in 4 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 03:54:03] [INFO ] Invariant cache hit.
[2024-05-31 03:54:03] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 03:54:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:03] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 03:54:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:54:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-31 03:54:03] [INFO ] Added : 36 causal constraints over 8 iterations in 151 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 03:54:03] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 03:54:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 03:54:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 4 ms to minimize.
[2024-05-31 03:54:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-31 03:54:03] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:54:04] [INFO ] Added : 21 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 03:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:54:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:54:04] [INFO ] Added : 4 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 13 ms.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
[2024-05-31 03:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 03:54:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:54:04] [INFO ] Added : 18 causal constraints over 4 iterations in 240 ms. Result :sat
Minimization took 94 ms.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 03:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:54:04] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 03:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-31 03:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 03:54:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 03:54:05] [INFO ] Added : 11 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 70 ms.
[2024-05-31 03:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 03:54:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-31 03:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-31 03:54:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:54:05] [INFO ] Added : 36 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 03:54:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 03:54:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:05] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 03:54:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:05] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-31 03:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-31 03:54:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:54:06] [INFO ] Added : 18 causal constraints over 4 iterations in 343 ms. Result :sat
Minimization took 89 ms.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 03:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-31 03:54:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:54:06] [INFO ] Added : 33 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 03:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:54:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-31 03:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-31 03:54:06] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:54:06] [INFO ] Added : 36 causal constraints over 8 iterations in 158 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:06] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 03:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:54:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:54:07] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 03:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 03:54:07] [INFO ] Added : 22 causal constraints over 5 iterations in 122 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 03:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 03:54:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 03:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-31 03:54:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:54:07] [INFO ] Added : 21 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 219 ms.
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 03:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 03:54:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 03:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 03:54:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:54:07] [INFO ] Added : 36 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 03:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:54:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:08] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 03:54:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:54:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:54:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-31 03:54:08] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-31 03:54:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-31 03:54:08] [INFO ] Added : 36 causal constraints over 8 iterations in 239 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1, 3, -1, 10, -1, 10, -1, 10, 10, 5, -1, 3, 10, -1, -1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 10 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.
[2024-05-31 03:54:08] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 79 ms.
[2024-05-31 03:54:08] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 18 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 695 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 14) seen :31
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :22
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :22
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :25
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :25
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :23
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :23
[2024-05-31 03:54:09] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2024-05-31 03:54:09] [INFO ] Computed 182 invariants in 245 ms
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive place invariants in 91 ms returned sat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned unsat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned unsat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive place invariants in 78 ms returned sat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned unsat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive place invariants in 58 ms returned sat
[2024-05-31 03:54:10] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned unsat
[2024-05-31 03:54:11] [INFO ] [Real]Absence check using 175 positive place invariants in 58 ms returned sat
[2024-05-31 03:54:11] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-31 03:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:11] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2024-05-31 03:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:12] [INFO ] [Nat]Absence check using 175 positive place invariants in 61 ms returned sat
[2024-05-31 03:54:12] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-31 03:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:12] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-31 03:54:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:54:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 763 ms returned sat
[2024-05-31 03:54:13] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 201 ms.
[2024-05-31 03:54:15] [INFO ] Added : 16 causal constraints over 4 iterations in 1270 ms. Result :sat
Minimization took 626 ms.
[2024-05-31 03:54:15] [INFO ] [Real]Absence check using 175 positive place invariants in 53 ms returned sat
[2024-05-31 03:54:16] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 03:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:16] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2024-05-31 03:54:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:16] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2024-05-31 03:54:16] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 20 ms returned unsat
[2024-05-31 03:54:17] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2024-05-31 03:54:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned unsat
[2024-05-31 03:54:17] [INFO ] [Real]Absence check using 175 positive place invariants in 40 ms returned sat
[2024-05-31 03:54:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:18] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2024-05-31 03:54:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:18] [INFO ] [Nat]Absence check using 175 positive place invariants in 66 ms returned sat
[2024-05-31 03:54:18] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 03:54:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:20] [INFO ] [Nat]Absence check using state equation in 1580 ms returned unsat
[2024-05-31 03:54:20] [INFO ] [Real]Absence check using 175 positive place invariants in 41 ms returned sat
[2024-05-31 03:54:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned unsat
[2024-05-31 03:54:20] [INFO ] [Real]Absence check using 175 positive place invariants in 60 ms returned sat
[2024-05-31 03:54:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-31 03:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:21] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-31 03:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 58 ms returned sat
[2024-05-31 03:54:21] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2024-05-31 03:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:22] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2024-05-31 03:54:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2024-05-31 03:54:22] [INFO ] Deduced a trap composed of 403 places in 488 ms of which 2 ms to minimize.
[2024-05-31 03:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2024-05-31 03:54:22] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 153 ms.
[2024-05-31 03:54:23] [INFO ] Added : 17 causal constraints over 4 iterations in 1015 ms. Result :sat
Minimization took 886 ms.
[2024-05-31 03:54:25] [INFO ] [Real]Absence check using 175 positive place invariants in 64 ms returned sat
[2024-05-31 03:54:25] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-31 03:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:25] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-31 03:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:25] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2024-05-31 03:54:25] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned unsat
[2024-05-31 03:54:26] [INFO ] [Real]Absence check using 175 positive place invariants in 58 ms returned sat
[2024-05-31 03:54:26] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 1, 10, 1, 4, 4, 1, 10, 1, 1] Max seen :[1, 1, 4, 1, 3, 1, 4, 4, 1, 3, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 1 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 176 place count 1099 transition count 1609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 3 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 3 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 514 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2024-05-31 03:54:26] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2024-05-31 03:54:26] [INFO ] Computed 177 invariants in 109 ms
[2024-05-31 03:54:27] [INFO ] Dead Transitions using invariants and state equation in 1223 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 78 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 1823 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:54:28] [INFO ] Computed 177 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 47230 resets, run finished after 6109 ms. (steps per millisecond=163 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2657 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2634 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 2) seen :4
[2024-05-31 03:54:38] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:54:38] [INFO ] Computed 177 invariants in 60 ms
[2024-05-31 03:54:38] [INFO ] [Real]Absence check using 170 positive place invariants in 37 ms returned sat
[2024-05-31 03:54:38] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 03:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:38] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-05-31 03:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:38] [INFO ] [Nat]Absence check using 170 positive place invariants in 45 ms returned sat
[2024-05-31 03:54:38] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 03:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:39] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2024-05-31 03:54:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:54:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 90 ms returned sat
[2024-05-31 03:54:40] [INFO ] Deduced a trap composed of 202 places in 477 ms of which 1 ms to minimize.
[2024-05-31 03:54:40] [INFO ] Deduced a trap composed of 320 places in 446 ms of which 1 ms to minimize.
[2024-05-31 03:54:41] [INFO ] Deduced a trap composed of 332 places in 431 ms of which 1 ms to minimize.
[2024-05-31 03:54:42] [INFO ] Deduced a trap composed of 338 places in 427 ms of which 1 ms to minimize.
[2024-05-31 03:54:43] [INFO ] Deduced a trap composed of 335 places in 424 ms of which 1 ms to minimize.
[2024-05-31 03:54:43] [INFO ] Deduced a trap composed of 323 places in 436 ms of which 1 ms to minimize.
[2024-05-31 03:54:44] [INFO ] Deduced a trap composed of 311 places in 412 ms of which 1 ms to minimize.
[2024-05-31 03:54:44] [INFO ] Deduced a trap composed of 323 places in 348 ms of which 2 ms to minimize.
[2024-05-31 03:54:44] [INFO ] Deduced a trap composed of 329 places in 292 ms of which 1 ms to minimize.
[2024-05-31 03:54:45] [INFO ] Deduced a trap composed of 335 places in 410 ms of which 1 ms to minimize.
[2024-05-31 03:54:46] [INFO ] Deduced a trap composed of 323 places in 475 ms of which 1 ms to minimize.
[2024-05-31 03:54:46] [INFO ] Deduced a trap composed of 314 places in 456 ms of which 1 ms to minimize.
[2024-05-31 03:54:47] [INFO ] Deduced a trap composed of 317 places in 337 ms of which 1 ms to minimize.
[2024-05-31 03:54:47] [INFO ] Deduced a trap composed of 314 places in 401 ms of which 1 ms to minimize.
[2024-05-31 03:54:50] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 11154 ms
[2024-05-31 03:54:51] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2024-05-31 03:54:51] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 03:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:51] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-31 03:54:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:54:51] [INFO ] [Nat]Absence check using 170 positive place invariants in 45 ms returned sat
[2024-05-31 03:54:51] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 03:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:54:52] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-31 03:54:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 120 ms returned sat
[2024-05-31 03:54:52] [INFO ] Deduced a trap composed of 332 places in 380 ms of which 1 ms to minimize.
[2024-05-31 03:54:53] [INFO ] Deduced a trap composed of 341 places in 442 ms of which 1 ms to minimize.
[2024-05-31 03:54:53] [INFO ] Deduced a trap composed of 344 places in 353 ms of which 1 ms to minimize.
[2024-05-31 03:54:54] [INFO ] Deduced a trap composed of 311 places in 375 ms of which 1 ms to minimize.
[2024-05-31 03:54:54] [INFO ] Deduced a trap composed of 317 places in 408 ms of which 0 ms to minimize.
[2024-05-31 03:54:55] [INFO ] Deduced a trap composed of 329 places in 413 ms of which 1 ms to minimize.
[2024-05-31 03:54:55] [INFO ] Deduced a trap composed of 311 places in 441 ms of which 1 ms to minimize.
[2024-05-31 03:54:56] [INFO ] Deduced a trap composed of 335 places in 407 ms of which 1 ms to minimize.
[2024-05-31 03:54:56] [INFO ] Deduced a trap composed of 338 places in 332 ms of which 1 ms to minimize.
[2024-05-31 03:54:56] [INFO ] Deduced a trap composed of 314 places in 346 ms of which 1 ms to minimize.
[2024-05-31 03:54:57] [INFO ] Deduced a trap composed of 293 places in 387 ms of which 1 ms to minimize.
[2024-05-31 03:54:57] [INFO ] Deduced a trap composed of 308 places in 414 ms of which 1 ms to minimize.
[2024-05-31 03:54:58] [INFO ] Deduced a trap composed of 332 places in 458 ms of which 1 ms to minimize.
[2024-05-31 03:54:59] [INFO ] Deduced a trap composed of 332 places in 419 ms of which 1 ms to minimize.
[2024-05-31 03:55:01] [INFO ] Deduced a trap composed of 326 places in 379 ms of which 0 ms to minimize.
[2024-05-31 03:55:01] [INFO ] Deduced a trap composed of 317 places in 400 ms of which 1 ms to minimize.
[2024-05-31 03:55:02] [INFO ] Deduced a trap composed of 332 places in 439 ms of which 1 ms to minimize.
[2024-05-31 03:55:03] [INFO ] Deduced a trap composed of 338 places in 434 ms of which 1 ms to minimize.
[2024-05-31 03:55:03] [INFO ] Deduced a trap composed of 350 places in 421 ms of which 1 ms to minimize.
[2024-05-31 03:55:04] [INFO ] Deduced a trap composed of 302 places in 459 ms of which 1 ms to minimize.
[2024-05-31 03:55:04] [INFO ] Deduced a trap composed of 308 places in 444 ms of which 1 ms to minimize.
[2024-05-31 03:55:05] [INFO ] Deduced a trap composed of 317 places in 305 ms of which 0 ms to minimize.
[2024-05-31 03:55:06] [INFO ] Deduced a trap composed of 326 places in 424 ms of which 1 ms to minimize.
[2024-05-31 03:55:06] [INFO ] Deduced a trap composed of 341 places in 370 ms of which 1 ms to minimize.
[2024-05-31 03:55:07] [INFO ] Deduced a trap composed of 314 places in 465 ms of which 2 ms to minimize.
[2024-05-31 03:55:07] [INFO ] Deduced a trap composed of 332 places in 359 ms of which 1 ms to minimize.
[2024-05-31 03:55:08] [INFO ] Deduced a trap composed of 305 places in 466 ms of which 1 ms to minimize.
[2024-05-31 03:55:09] [INFO ] Deduced a trap composed of 344 places in 418 ms of which 1 ms to minimize.
[2024-05-31 03:55:09] [INFO ] Deduced a trap composed of 308 places in 334 ms of which 1 ms to minimize.
[2024-05-31 03:55:10] [INFO ] Deduced a trap composed of 311 places in 365 ms of which 1 ms to minimize.
[2024-05-31 03:55:10] [INFO ] Deduced a trap composed of 326 places in 383 ms of which 2 ms to minimize.
[2024-05-31 03:55:11] [INFO ] Deduced a trap composed of 305 places in 372 ms of which 2 ms to minimize.
[2024-05-31 03:55:12] [INFO ] Deduced a trap composed of 305 places in 385 ms of which 1 ms to minimize.
[2024-05-31 03:55:12] [INFO ] Deduced a trap composed of 335 places in 356 ms of which 1 ms to minimize.
[2024-05-31 03:55:13] [INFO ] Deduced a trap composed of 326 places in 351 ms of which 1 ms to minimize.
[2024-05-31 03:55:14] [INFO ] Deduced a trap composed of 320 places in 441 ms of which 1 ms to minimize.
[2024-05-31 03:55:14] [INFO ] Deduced a trap composed of 314 places in 314 ms of which 1 ms to minimize.
[2024-05-31 03:55:15] [INFO ] Deduced a trap composed of 341 places in 319 ms of which 1 ms to minimize.
[2024-05-31 03:55:15] [INFO ] Deduced a trap composed of 332 places in 434 ms of which 1 ms to minimize.
[2024-05-31 03:55:16] [INFO ] Deduced a trap composed of 302 places in 451 ms of which 5 ms to minimize.
[2024-05-31 03:55:16] [INFO ] Deduced a trap composed of 353 places in 319 ms of which 1 ms to minimize.
[2024-05-31 03:55:17] [INFO ] Deduced a trap composed of 323 places in 460 ms of which 2 ms to minimize.
[2024-05-31 03:55:19] [INFO ] Deduced a trap composed of 329 places in 377 ms of which 10 ms to minimize.
[2024-05-31 03:55:19] [INFO ] Deduced a trap composed of 332 places in 293 ms of which 1 ms to minimize.
[2024-05-31 03:55:22] [INFO ] Deduced a trap composed of 332 places in 335 ms of which 1 ms to minimize.
[2024-05-31 03:55:23] [INFO ] Deduced a trap composed of 305 places in 453 ms of which 1 ms to minimize.
[2024-05-31 03:55:24] [INFO ] Deduced a trap composed of 332 places in 466 ms of which 1 ms to minimize.
[2024-05-31 03:55:24] [INFO ] Deduced a trap composed of 308 places in 410 ms of which 2 ms to minimize.
[2024-05-31 03:55:26] [INFO ] Deduced a trap composed of 299 places in 462 ms of which 2 ms to minimize.
[2024-05-31 03:55:26] [INFO ] Deduced a trap composed of 326 places in 315 ms of which 1 ms to minimize.
[2024-05-31 03:55:27] [INFO ] Deduced a trap composed of 305 places in 323 ms of which 1 ms to minimize.
[2024-05-31 03:55:27] [INFO ] Deduced a trap composed of 311 places in 429 ms of which 1 ms to minimize.
[2024-05-31 03:55:29] [INFO ] Deduced a trap composed of 302 places in 344 ms of which 1 ms to minimize.
[2024-05-31 03:55:29] [INFO ] Deduced a trap composed of 308 places in 348 ms of which 2 ms to minimize.
[2024-05-31 03:55:30] [INFO ] Deduced a trap composed of 332 places in 472 ms of which 1 ms to minimize.
[2024-05-31 03:55:31] [INFO ] Deduced a trap composed of 299 places in 462 ms of which 1 ms to minimize.
[2024-05-31 03:55:31] [INFO ] Deduced a trap composed of 314 places in 378 ms of which 1 ms to minimize.
[2024-05-31 03:55:32] [INFO ] Deduced a trap composed of 317 places in 451 ms of which 1 ms to minimize.
[2024-05-31 03:55:34] [INFO ] Deduced a trap composed of 332 places in 376 ms of which 1 ms to minimize.
[2024-05-31 03:55:36] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 44056 ms
Current structural bounds on expressions (after SMT) : [10, 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 70 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 72 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 50 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 03:55:36] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:55:36] [INFO ] Invariant cache hit.
[2024-05-31 03:55:37] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2024-05-31 03:55:37] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:55:37] [INFO ] Invariant cache hit.
[2024-05-31 03:55:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:55:45] [INFO ] Implicit Places using invariants and state equation in 7724 ms returned []
Implicit Place search using SMT with State Equation took 8889 ms to find 0 implicit places.
[2024-05-31 03:55:45] [INFO ] Redundant transitions in 97 ms returned []
[2024-05-31 03:55:45] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:55:45] [INFO ] Invariant cache hit.
[2024-05-31 03:55:46] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10034 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-05
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:55:46] [INFO ] Computed 177 invariants in 38 ms
Incomplete random walk after 10000 steps, including 483 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2024-05-31 03:55:46] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:55:46] [INFO ] Computed 177 invariants in 57 ms
[2024-05-31 03:55:46] [INFO ] [Real]Absence check using 170 positive place invariants in 28 ms returned sat
[2024-05-31 03:55:47] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 03:55:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:55:47] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-31 03:55:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:55:47] [INFO ] [Nat]Absence check using 170 positive place invariants in 29 ms returned sat
[2024-05-31 03:55:47] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:55:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:55:47] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-05-31 03:55:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:55:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 79 ms returned sat
[2024-05-31 03:55:48] [INFO ] Deduced a trap composed of 202 places in 454 ms of which 1 ms to minimize.
[2024-05-31 03:55:49] [INFO ] Deduced a trap composed of 320 places in 434 ms of which 1 ms to minimize.
[2024-05-31 03:55:49] [INFO ] Deduced a trap composed of 332 places in 290 ms of which 1 ms to minimize.
[2024-05-31 03:55:50] [INFO ] Deduced a trap composed of 338 places in 266 ms of which 1 ms to minimize.
[2024-05-31 03:55:50] [INFO ] Deduced a trap composed of 335 places in 335 ms of which 1 ms to minimize.
[2024-05-31 03:55:51] [INFO ] Deduced a trap composed of 323 places in 397 ms of which 1 ms to minimize.
[2024-05-31 03:55:51] [INFO ] Deduced a trap composed of 311 places in 404 ms of which 1 ms to minimize.
[2024-05-31 03:55:51] [INFO ] Deduced a trap composed of 323 places in 288 ms of which 1 ms to minimize.
[2024-05-31 03:55:52] [INFO ] Deduced a trap composed of 329 places in 408 ms of which 1 ms to minimize.
[2024-05-31 03:55:52] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 4363 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 52 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 03:55:52] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:55:52] [INFO ] Invariant cache hit.
[2024-05-31 03:55:53] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1080 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:55:53] [INFO ] Computed 177 invariants in 56 ms
Incomplete random walk after 1000000 steps, including 47312 resets, run finished after 6267 ms. (steps per millisecond=159 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2703 resets, run finished after 1901 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2024-05-31 03:56:01] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:56:01] [INFO ] Computed 177 invariants in 42 ms
[2024-05-31 03:56:01] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2024-05-31 03:56:01] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 03:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:56:02] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-31 03:56:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:56:02] [INFO ] [Nat]Absence check using 170 positive place invariants in 28 ms returned sat
[2024-05-31 03:56:02] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:56:02] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2024-05-31 03:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:56:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-31 03:56:03] [INFO ] Deduced a trap composed of 202 places in 343 ms of which 0 ms to minimize.
[2024-05-31 03:56:03] [INFO ] Deduced a trap composed of 320 places in 290 ms of which 1 ms to minimize.
[2024-05-31 03:56:04] [INFO ] Deduced a trap composed of 332 places in 312 ms of which 1 ms to minimize.
[2024-05-31 03:56:05] [INFO ] Deduced a trap composed of 338 places in 283 ms of which 1 ms to minimize.
[2024-05-31 03:56:05] [INFO ] Deduced a trap composed of 335 places in 329 ms of which 1 ms to minimize.
[2024-05-31 03:56:05] [INFO ] Deduced a trap composed of 323 places in 275 ms of which 1 ms to minimize.
[2024-05-31 03:56:06] [INFO ] Deduced a trap composed of 311 places in 340 ms of which 1 ms to minimize.
[2024-05-31 03:56:06] [INFO ] Deduced a trap composed of 323 places in 334 ms of which 1 ms to minimize.
[2024-05-31 03:56:07] [INFO ] Deduced a trap composed of 329 places in 348 ms of which 1 ms to minimize.
[2024-05-31 03:56:07] [INFO ] Deduced a trap composed of 335 places in 392 ms of which 1 ms to minimize.
[2024-05-31 03:56:08] [INFO ] Deduced a trap composed of 323 places in 340 ms of which 1 ms to minimize.
[2024-05-31 03:56:08] [INFO ] Deduced a trap composed of 314 places in 428 ms of which 1 ms to minimize.
[2024-05-31 03:56:09] [INFO ] Deduced a trap composed of 317 places in 342 ms of which 1 ms to minimize.
[2024-05-31 03:56:09] [INFO ] Deduced a trap composed of 314 places in 428 ms of which 1 ms to minimize.
[2024-05-31 03:56:12] [INFO ] Deduced a trap composed of 305 places in 357 ms of which 1 ms to minimize.
[2024-05-31 03:56:13] [INFO ] Deduced a trap composed of 314 places in 428 ms of which 1 ms to minimize.
[2024-05-31 03:56:15] [INFO ] Deduced a trap composed of 332 places in 345 ms of which 1 ms to minimize.
[2024-05-31 03:56:17] [INFO ] Deduced a trap composed of 317 places in 437 ms of which 1 ms to minimize.
[2024-05-31 03:56:18] [INFO ] Deduced a trap composed of 317 places in 372 ms of which 1 ms to minimize.
[2024-05-31 03:56:21] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 18571 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 37 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 38 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 56 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 03:56:21] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:56:21] [INFO ] Invariant cache hit.
[2024-05-31 03:56:23] [INFO ] Implicit Places using invariants in 1250 ms returned []
[2024-05-31 03:56:23] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:56:23] [INFO ] Invariant cache hit.
[2024-05-31 03:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:56:29] [INFO ] Implicit Places using invariants and state equation in 6139 ms returned []
Implicit Place search using SMT with State Equation took 7392 ms to find 0 implicit places.
[2024-05-31 03:56:29] [INFO ] Redundant transitions in 82 ms returned []
[2024-05-31 03:56:29] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:56:29] [INFO ] Invariant cache hit.
[2024-05-31 03:56:30] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8518 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-05 in 43550 ms.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-12
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:56:30] [INFO ] Computed 177 invariants in 24 ms
Incomplete random walk after 10000 steps, including 496 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2024-05-31 03:56:30] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:56:30] [INFO ] Computed 177 invariants in 24 ms
[2024-05-31 03:56:30] [INFO ] [Real]Absence check using 170 positive place invariants in 28 ms returned sat
[2024-05-31 03:56:30] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 03:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:56:30] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-05-31 03:56:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:56:31] [INFO ] [Nat]Absence check using 170 positive place invariants in 27 ms returned sat
[2024-05-31 03:56:31] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:56:31] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-31 03:56:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:56:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2024-05-31 03:56:32] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2024-05-31 03:56:32] [INFO ] Deduced a trap composed of 341 places in 276 ms of which 1 ms to minimize.
[2024-05-31 03:56:32] [INFO ] Deduced a trap composed of 344 places in 288 ms of which 0 ms to minimize.
[2024-05-31 03:56:33] [INFO ] Deduced a trap composed of 311 places in 288 ms of which 1 ms to minimize.
[2024-05-31 03:56:33] [INFO ] Deduced a trap composed of 317 places in 276 ms of which 1 ms to minimize.
[2024-05-31 03:56:33] [INFO ] Deduced a trap composed of 329 places in 319 ms of which 1 ms to minimize.
[2024-05-31 03:56:34] [INFO ] Deduced a trap composed of 311 places in 325 ms of which 1 ms to minimize.
[2024-05-31 03:56:34] [INFO ] Deduced a trap composed of 335 places in 322 ms of which 1 ms to minimize.
[2024-05-31 03:56:35] [INFO ] Deduced a trap composed of 338 places in 301 ms of which 1 ms to minimize.
[2024-05-31 03:56:35] [INFO ] Deduced a trap composed of 314 places in 291 ms of which 13 ms to minimize.
[2024-05-31 03:56:35] [INFO ] Deduced a trap composed of 293 places in 352 ms of which 0 ms to minimize.
[2024-05-31 03:56:36] [INFO ] Deduced a trap composed of 308 places in 282 ms of which 0 ms to minimize.
[2024-05-31 03:56:36] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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 39 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 03:56:36] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:56:36] [INFO ] Invariant cache hit.
[2024-05-31 03:56:37] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1188 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:56:37] [INFO ] Computed 177 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 47372 resets, run finished after 5812 ms. (steps per millisecond=172 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2700 resets, run finished after 1509 ms. (steps per millisecond=662 ) properties (out of 1) seen :3
[2024-05-31 03:56:44] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2024-05-31 03:56:44] [INFO ] Computed 177 invariants in 59 ms
[2024-05-31 03:56:45] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2024-05-31 03:56:45] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 03:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:56:45] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-31 03:56:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:56:45] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2024-05-31 03:56:45] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-31 03:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:56:46] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-05-31 03:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:56:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 98 ms returned sat
[2024-05-31 03:56:46] [INFO ] Deduced a trap composed of 332 places in 442 ms of which 2 ms to minimize.
[2024-05-31 03:56:47] [INFO ] Deduced a trap composed of 341 places in 447 ms of which 1 ms to minimize.
[2024-05-31 03:56:47] [INFO ] Deduced a trap composed of 344 places in 418 ms of which 1 ms to minimize.
[2024-05-31 03:56:48] [INFO ] Deduced a trap composed of 311 places in 414 ms of which 1 ms to minimize.
[2024-05-31 03:56:48] [INFO ] Deduced a trap composed of 317 places in 400 ms of which 1 ms to minimize.
[2024-05-31 03:56:49] [INFO ] Deduced a trap composed of 329 places in 331 ms of which 1 ms to minimize.
[2024-05-31 03:56:49] [INFO ] Deduced a trap composed of 311 places in 408 ms of which 1 ms to minimize.
[2024-05-31 03:56:49] [INFO ] Deduced a trap composed of 335 places in 389 ms of which 1 ms to minimize.
[2024-05-31 03:56:50] [INFO ] Deduced a trap composed of 338 places in 439 ms of which 1 ms to minimize.
[2024-05-31 03:56:50] [INFO ] Deduced a trap composed of 314 places in 455 ms of which 1 ms to minimize.
[2024-05-31 03:56:51] [INFO ] Deduced a trap composed of 293 places in 290 ms of which 0 ms to minimize.
[2024-05-31 03:56:51] [INFO ] Deduced a trap composed of 308 places in 395 ms of which 1 ms to minimize.
[2024-05-31 03:56:52] [INFO ] Deduced a trap composed of 332 places in 342 ms of which 1 ms to minimize.
[2024-05-31 03:56:53] [INFO ] Deduced a trap composed of 332 places in 348 ms of which 0 ms to minimize.
[2024-05-31 03:56:54] [INFO ] Deduced a trap composed of 326 places in 429 ms of which 1 ms to minimize.
[2024-05-31 03:56:54] [INFO ] Deduced a trap composed of 317 places in 354 ms of which 0 ms to minimize.
[2024-05-31 03:56:55] [INFO ] Deduced a trap composed of 332 places in 445 ms of which 0 ms to minimize.
[2024-05-31 03:56:56] [INFO ] Deduced a trap composed of 338 places in 441 ms of which 1 ms to minimize.
[2024-05-31 03:56:56] [INFO ] Deduced a trap composed of 350 places in 414 ms of which 1 ms to minimize.
[2024-05-31 03:56:57] [INFO ] Deduced a trap composed of 302 places in 332 ms of which 1 ms to minimize.
[2024-05-31 03:56:57] [INFO ] Deduced a trap composed of 308 places in 427 ms of which 1 ms to minimize.
[2024-05-31 03:56:58] [INFO ] Deduced a trap composed of 317 places in 467 ms of which 1 ms to minimize.
[2024-05-31 03:56:59] [INFO ] Deduced a trap composed of 326 places in 363 ms of which 1 ms to minimize.
[2024-05-31 03:56:59] [INFO ] Deduced a trap composed of 341 places in 416 ms of which 1 ms to minimize.
[2024-05-31 03:57:00] [INFO ] Deduced a trap composed of 314 places in 425 ms of which 1 ms to minimize.
[2024-05-31 03:57:00] [INFO ] Deduced a trap composed of 332 places in 410 ms of which 1 ms to minimize.
[2024-05-31 03:57:01] [INFO ] Deduced a trap composed of 305 places in 440 ms of which 2 ms to minimize.
[2024-05-31 03:57:02] [INFO ] Deduced a trap composed of 344 places in 479 ms of which 1 ms to minimize.
[2024-05-31 03:57:02] [INFO ] Deduced a trap composed of 308 places in 340 ms of which 1 ms to minimize.
[2024-05-31 03:57:02] [INFO ] Deduced a trap composed of 311 places in 356 ms of which 1 ms to minimize.
[2024-05-31 03:57:03] [INFO ] Deduced a trap composed of 326 places in 338 ms of which 1 ms to minimize.
[2024-05-31 03:57:04] [INFO ] Deduced a trap composed of 305 places in 459 ms of which 1 ms to minimize.
[2024-05-31 03:57:04] [INFO ] Deduced a trap composed of 305 places in 472 ms of which 1 ms to minimize.
[2024-05-31 03:57:05] [INFO ] Deduced a trap composed of 335 places in 386 ms of which 1 ms to minimize.
[2024-05-31 03:57:05] [INFO ] Deduced a trap composed of 326 places in 432 ms of which 1 ms to minimize.
[2024-05-31 03:57:06] [INFO ] Deduced a trap composed of 320 places in 466 ms of which 1 ms to minimize.
[2024-05-31 03:57:07] [INFO ] Deduced a trap composed of 314 places in 407 ms of which 0 ms to minimize.
[2024-05-31 03:57:07] [INFO ] Deduced a trap composed of 341 places in 452 ms of which 1 ms to minimize.
[2024-05-31 03:57:08] [INFO ] Deduced a trap composed of 332 places in 441 ms of which 1 ms to minimize.
[2024-05-31 03:57:08] [INFO ] Deduced a trap composed of 302 places in 352 ms of which 1 ms to minimize.
[2024-05-31 03:57:09] [INFO ] Deduced a trap composed of 353 places in 392 ms of which 1 ms to minimize.
[2024-05-31 03:57:10] [INFO ] Deduced a trap composed of 323 places in 459 ms of which 1 ms to minimize.
[2024-05-31 03:57:11] [INFO ] Deduced a trap composed of 329 places in 367 ms of which 1 ms to minimize.
[2024-05-31 03:57:12] [INFO ] Deduced a trap composed of 332 places in 366 ms of which 0 ms to minimize.
[2024-05-31 03:57:14] [INFO ] Deduced a trap composed of 332 places in 435 ms of which 1 ms to minimize.
[2024-05-31 03:57:15] [INFO ] Deduced a trap composed of 305 places in 450 ms of which 1 ms to minimize.
[2024-05-31 03:57:16] [INFO ] Deduced a trap composed of 332 places in 477 ms of which 13 ms to minimize.
[2024-05-31 03:57:16] [INFO ] Deduced a trap composed of 308 places in 431 ms of which 1 ms to minimize.
[2024-05-31 03:57:17] [INFO ] Deduced a trap composed of 299 places in 306 ms of which 1 ms to minimize.
[2024-05-31 03:57:18] [INFO ] Deduced a trap composed of 326 places in 453 ms of which 1 ms to minimize.
[2024-05-31 03:57:18] [INFO ] Deduced a trap composed of 305 places in 325 ms of which 1 ms to minimize.
[2024-05-31 03:57:19] [INFO ] Deduced a trap composed of 311 places in 344 ms of which 1 ms to minimize.
[2024-05-31 03:57:20] [INFO ] Deduced a trap composed of 302 places in 456 ms of which 1 ms to minimize.
[2024-05-31 03:57:21] [INFO ] Deduced a trap composed of 308 places in 363 ms of which 1 ms to minimize.
[2024-05-31 03:57:21] [INFO ] Deduced a trap composed of 332 places in 389 ms of which 1 ms to minimize.
[2024-05-31 03:57:22] [INFO ] Deduced a trap composed of 299 places in 351 ms of which 1 ms to minimize.
[2024-05-31 03:57:23] [INFO ] Deduced a trap composed of 314 places in 353 ms of which 1 ms to minimize.
[2024-05-31 03:57:23] [INFO ] Deduced a trap composed of 317 places in 330 ms of which 1 ms to minimize.
[2024-05-31 03:57:26] [INFO ] Deduced a trap composed of 332 places in 432 ms of which 2 ms to minimize.
[2024-05-31 03:57:29] [INFO ] Deduced a trap composed of 332 places in 293 ms of which 1 ms to minimize.
[2024-05-31 03:57:30] [INFO ] Deduced a trap composed of 311 places in 419 ms of which 1 ms to minimize.
[2024-05-31 03:57:30] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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 44 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 44 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 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2024-05-31 03:57:30] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:57:30] [INFO ] Invariant cache hit.
[2024-05-31 03:57:31] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2024-05-31 03:57:31] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:57:31] [INFO ] Invariant cache hit.
[2024-05-31 03:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:57:38] [INFO ] Implicit Places using invariants and state equation in 6197 ms returned []
Implicit Place search using SMT with State Equation took 7443 ms to find 0 implicit places.
[2024-05-31 03:57:38] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-31 03:57:38] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2024-05-31 03:57:38] [INFO ] Invariant cache hit.
[2024-05-31 03:57:39] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8563 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-12 in 68951 ms.
[2024-05-31 03:57:39] [INFO ] Flatten gal took : 141 ms
[2024-05-31 03:57:39] [INFO ] Applying decomposition
[2024-05-31 03:57:39] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14615303640734277487.txt' '-o' '/tmp/graph14615303640734277487.bin' '-w' '/tmp/graph14615303640734277487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14615303640734277487.bin' '-l' '-1' '-v' '-w' '/tmp/graph14615303640734277487.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:57:40] [INFO ] Decomposing Gal with order
[2024-05-31 03:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:57:40] [INFO ] Removed a total of 1694 redundant transitions.
[2024-05-31 03:57:40] [INFO ] Flatten gal took : 689 ms
[2024-05-31 03:57:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 75 ms.
[2024-05-31 03:57:41] [INFO ] Time to serialize gal into /tmp/UpperBounds11744861387015753795.gal : 62 ms
[2024-05-31 03:57:41] [INFO ] Time to serialize properties into /tmp/UpperBounds6857012296297700250.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11744861387015753795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6857012296297700250.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds6857012296297700250.prop.
Detected timeout of ITS tools.
[2024-05-31 04:18:59] [INFO ] Applying decomposition
[2024-05-31 04:19:00] [INFO ] Flatten gal took : 409 ms
[2024-05-31 04:19:00] [INFO ] Decomposing Gal with order
[2024-05-31 04:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:19:01] [INFO ] Removed a total of 5164 redundant transitions.
[2024-05-31 04:19:01] [INFO ] Flatten gal took : 1211 ms
[2024-05-31 04:19:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-31 04:19:01] [INFO ] Time to serialize gal into /tmp/UpperBounds11129934174365178821.gal : 41 ms
[2024-05-31 04:19:01] [INFO ] Time to serialize properties into /tmp/UpperBounds9560906903625623148.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11129934174365178821.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9560906903625623148.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9560906903625623148.prop.
Detected timeout of ITS tools.
[2024-05-31 04:40:20] [INFO ] Flatten gal took : 950 ms
[2024-05-31 04:40:22] [INFO ] Input system was already deterministic with 1427 transitions.
[2024-05-31 04:40:22] [INFO ] Transformed 1011 places.
[2024-05-31 04:40:22] [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
[2024-05-31 04:40:52] [INFO ] Time to serialize gal into /tmp/UpperBounds11517523759321488851.gal : 21 ms
[2024-05-31 04:40:52] [INFO ] Time to serialize properties into /tmp/UpperBounds17212179245259743738.prop : 0 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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11517523759321488851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17212179245259743738.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17212179245259743738.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 582500 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16188884 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r307-tajo-171654460800246"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;