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-171654460700236.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-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 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 93K 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-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717125947560

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-S05J40
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 03:25:50] [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:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:25:50] [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:25:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:25:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 561 ms
[2024-05-31 03:25:51] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-31 03:25:51] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-31 03:25:51] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:25:51] [INFO ] Computed 13 invariants in 5 ms
FORMULA PolyORBNT-COL-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 03:25:51] [INFO ] Invariant cache hit.
[2024-05-31 03:25:51] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 03:25:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:51] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 03:25:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:25:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:25:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:25:51] [INFO ] Added : 33 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 03:25:51] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 03:25:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:52] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:25:52] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 5 ms to minimize.
[2024-05-31 03:25:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-31 03:25:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-31 03:25:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2024-05-31 03:25:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 03:25:52] [INFO ] Added : 36 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 03:25:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 03:25:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:25:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-31 03:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-31 03:25:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:25:52] [INFO ] Added : 18 causal constraints over 4 iterations in 285 ms. Result :sat
Minimization took 103 ms.
[2024-05-31 03:25:52] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 03:25:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2024-05-31 03:25:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-31 03:25:53] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 03:25:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 03:25:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-31 03:25:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-31 03:25:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2024-05-31 03:25:53] [INFO ] Added : 36 causal constraints over 8 iterations in 233 ms. Result :sat
Minimization took 192 ms.
[2024-05-31 03:25:53] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:25:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 03:25:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:25:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-31 03:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-31 03:25:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 03:25:54] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-31 03:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 03:25:54] [INFO ] Added : 36 causal constraints over 8 iterations in 73 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:25:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 03:25:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:25:54] [INFO ] Added : 21 causal constraints over 5 iterations in 304 ms. Result :sat
Minimization took 98 ms.
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:25:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:25:54] [INFO ] Added : 36 causal constraints over 8 iterations in 39 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 03:25:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 03:25:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:25:54] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 03:25:54] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-31 03:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-31 03:25:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 03:25:55] [INFO ] Added : 36 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 03:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2024-05-31 03:25:55] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-31 03:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-31 03:25:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:25:55] [INFO ] Added : 20 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 03:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 03:25:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 03:25:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-31 03:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-31 03:25:55] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 03:25:55] [INFO ] Added : 21 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [5, -1, 10, -1, 10, 1, 5, 1, 1, -1, -1, -1, 2, 10]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J40-UpperBounds-09 1 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:25:55] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 83 ms.
[2024-05-31 03:25:55] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 12) seen :27
FORMULA PolyORBNT-COL-S05J40-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :22
Incomplete Best-First random walk after 10000 steps, including 166 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 148 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :21
[2024-05-31 03:25:56] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-31 03:25:56] [INFO ] Computed 102 invariants in 92 ms
[2024-05-31 03:25:56] [INFO ] [Real]Absence check using 95 positive place invariants in 57 ms returned sat
[2024-05-31 03:25:56] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-31 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:56] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-31 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:56] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-31 03:25:56] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:58] [INFO ] [Nat]Absence check using state equation in 1420 ms returned unsat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive place invariants in 34 ms returned sat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive place invariants in 19 ms returned sat
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:25:58] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-05-31 03:25:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:25:59] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-05-31 03:25:59] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 03:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:04] [INFO ] [Nat]Absence check using state equation in 4908 ms returned unknown
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive place invariants in 28 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 6 ms returned unsat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive place invariants in 20 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive place invariants in 17 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 7 ms returned unsat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive place invariants in 19 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-31 03:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:04] [INFO ] [Nat]Absence check using 95 positive place invariants in 18 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive place invariants in 19 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 03:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:05] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-05-31 03:26:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:05] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2024-05-31 03:26:05] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:05] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2024-05-31 03:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 69 ms returned sat
[2024-05-31 03:26:06] [INFO ] Deduced a trap composed of 343 places in 259 ms of which 1 ms to minimize.
[2024-05-31 03:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 472 ms
[2024-05-31 03:26:06] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 77 ms.
[2024-05-31 03:26:06] [INFO ] Added : 18 causal constraints over 4 iterations in 427 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : [4, 1, 4, 1, 10, 4, 1, 1, 1, 10] Max seen :[4, 1, 4, 1, 4, 4, 1, 1, 1, 3]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 97 place count 578 transition count 845
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 185 place count 534 transition count 845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 533 transition count 844
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 533 transition count 844
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 531 transition count 842
Applied a total of 191 rules in 162 ms. Remains 531 /629 variables (removed 98) and now considering 842/935 (removed 93) transitions.
[2024-05-31 03:26:07] [INFO ] Flow matrix only has 838 transitions (discarded 4 similar events)
// Phase 1: matrix 838 rows 531 cols
[2024-05-31 03:26:07] [INFO ] Computed 97 invariants in 34 ms
[2024-05-31 03:26:07] [INFO ] Dead Transitions using invariants and state equation in 614 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 : 531/629 places, 747/935 transitions.
Applied a total of 0 rules in 49 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 531/629 places, 747/935 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:08] [INFO ] Computed 97 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47183 resets, run finished after 3250 ms. (steps per millisecond=307 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 3480 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4599 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 2) seen :7
[2024-05-31 03:26:13] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:13] [INFO ] Computed 97 invariants in 12 ms
[2024-05-31 03:26:13] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2024-05-31 03:26:13] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 03:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:13] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-05-31 03:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:13] [INFO ] [Nat]Absence check using 90 positive place invariants in 19 ms returned sat
[2024-05-31 03:26:13] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 26 ms returned sat
[2024-05-31 03:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:14] [INFO ] [Nat]Absence check using state equation in 1065 ms returned unsat
[2024-05-31 03:26:14] [INFO ] [Real]Absence check using 90 positive place invariants in 22 ms returned sat
[2024-05-31 03:26:15] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 03:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:15] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2024-05-31 03:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:15] [INFO ] [Nat]Absence check using 90 positive place invariants in 24 ms returned sat
[2024-05-31 03:26:15] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:15] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-05-31 03:26:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2024-05-31 03:26:16] [INFO ] Deduced a trap composed of 161 places in 213 ms of which 1 ms to minimize.
[2024-05-31 03:26:16] [INFO ] Deduced a trap composed of 152 places in 185 ms of which 1 ms to minimize.
[2024-05-31 03:26:16] [INFO ] Deduced a trap composed of 149 places in 206 ms of which 1 ms to minimize.
[2024-05-31 03:26:16] [INFO ] Deduced a trap composed of 161 places in 179 ms of which 1 ms to minimize.
[2024-05-31 03:26:17] [INFO ] Deduced a trap composed of 155 places in 250 ms of which 1 ms to minimize.
[2024-05-31 03:26:17] [INFO ] Deduced a trap composed of 173 places in 251 ms of which 1 ms to minimize.
[2024-05-31 03:26:17] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 1 ms to minimize.
[2024-05-31 03:26:17] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2024-05-31 03:26:17] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 0 ms to minimize.
[2024-05-31 03:26:18] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 0 ms to minimize.
[2024-05-31 03:26:18] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2024-05-31 03:26:18] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 1 ms to minimize.
[2024-05-31 03:26:18] [INFO ] Deduced a trap composed of 158 places in 131 ms of which 0 ms to minimize.
[2024-05-31 03:26:19] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 0 ms to minimize.
[2024-05-31 03:26:19] [INFO ] Deduced a trap composed of 179 places in 143 ms of which 0 ms to minimize.
[2024-05-31 03:26:19] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:26:19] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 0 ms to minimize.
[2024-05-31 03:26:20] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2024-05-31 03:26:20] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 1 ms to minimize.
[2024-05-31 03:26:20] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 4 ms to minimize.
[2024-05-31 03:26:21] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 1 ms to minimize.
[2024-05-31 03:26:21] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 1 ms to minimize.
[2024-05-31 03:26:22] [INFO ] Deduced a trap composed of 158 places in 234 ms of which 0 ms to minimize.
[2024-05-31 03:26:22] [INFO ] Deduced a trap composed of 161 places in 199 ms of which 0 ms to minimize.
[2024-05-31 03:26:23] [INFO ] Deduced a trap composed of 152 places in 228 ms of which 1 ms to minimize.
[2024-05-31 03:26:23] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 0 ms to minimize.
[2024-05-31 03:26:23] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 1 ms to minimize.
[2024-05-31 03:26:26] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 10768 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[4, 3]
FORMULA PolyORBNT-COL-S05J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 46 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:26] [INFO ] Computed 97 invariants in 17 ms
Incomplete random walk after 1000000 steps, including 47404 resets, run finished after 3977 ms. (steps per millisecond=251 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4547 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 1) seen :3
[2024-05-31 03:26:31] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:31] [INFO ] Computed 97 invariants in 18 ms
[2024-05-31 03:26:32] [INFO ] [Real]Absence check using 90 positive place invariants in 19 ms returned sat
[2024-05-31 03:26:32] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:32] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-31 03:26:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:32] [INFO ] [Nat]Absence check using 90 positive place invariants in 23 ms returned sat
[2024-05-31 03:26:32] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:32] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2024-05-31 03:26:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2024-05-31 03:26:33] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:26:33] [INFO ] Deduced a trap composed of 152 places in 164 ms of which 0 ms to minimize.
[2024-05-31 03:26:33] [INFO ] Deduced a trap composed of 149 places in 197 ms of which 0 ms to minimize.
[2024-05-31 03:26:33] [INFO ] Deduced a trap composed of 161 places in 164 ms of which 0 ms to minimize.
[2024-05-31 03:26:33] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 1 ms to minimize.
[2024-05-31 03:26:34] [INFO ] Deduced a trap composed of 173 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:26:34] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 1 ms to minimize.
[2024-05-31 03:26:34] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 1 ms to minimize.
[2024-05-31 03:26:34] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 2 ms to minimize.
[2024-05-31 03:26:35] [INFO ] Deduced a trap composed of 179 places in 173 ms of which 0 ms to minimize.
[2024-05-31 03:26:35] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2024-05-31 03:26:35] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 0 ms to minimize.
[2024-05-31 03:26:36] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 1 ms to minimize.
[2024-05-31 03:26:36] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:26:36] [INFO ] Deduced a trap composed of 179 places in 211 ms of which 10 ms to minimize.
[2024-05-31 03:26:36] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:26:37] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 1 ms to minimize.
[2024-05-31 03:26:37] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 0 ms to minimize.
[2024-05-31 03:26:37] [INFO ] Deduced a trap composed of 161 places in 231 ms of which 1 ms to minimize.
[2024-05-31 03:26:38] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2024-05-31 03:26:38] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 0 ms to minimize.
[2024-05-31 03:26:39] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2024-05-31 03:26:39] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:26:39] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 2 ms to minimize.
[2024-05-31 03:26:40] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 1 ms to minimize.
[2024-05-31 03:26:40] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 8 ms to minimize.
[2024-05-31 03:26:41] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 5 ms to minimize.
[2024-05-31 03:26:44] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 11235 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 34 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 18 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2024-05-31 03:26:44] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:26:44] [INFO ] Invariant cache hit.
[2024-05-31 03:26:44] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-05-31 03:26:44] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:26:44] [INFO ] Invariant cache hit.
[2024-05-31 03:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:46] [INFO ] Implicit Places using invariants and state equation in 2001 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2024-05-31 03:26:46] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-31 03:26:46] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:26:46] [INFO ] Invariant cache hit.
[2024-05-31 03:26:47] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2936 ms. Remains : 531/531 places, 747/747 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-15
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:47] [INFO ] Computed 97 invariants in 11 ms
Incomplete random walk after 10000 steps, including 457 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2024-05-31 03:26:47] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:47] [INFO ] Computed 97 invariants in 22 ms
[2024-05-31 03:26:47] [INFO ] [Real]Absence check using 90 positive place invariants in 15 ms returned sat
[2024-05-31 03:26:47] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:47] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-31 03:26:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:47] [INFO ] [Nat]Absence check using 90 positive place invariants in 19 ms returned sat
[2024-05-31 03:26:47] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-31 03:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:48] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-05-31 03:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2024-05-31 03:26:48] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 2 ms to minimize.
[2024-05-31 03:26:48] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 1 ms to minimize.
[2024-05-31 03:26:48] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 0 ms to minimize.
[2024-05-31 03:26:48] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 0 ms to minimize.
[2024-05-31 03:26:49] [INFO ] Deduced a trap composed of 155 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:26:49] [INFO ] Deduced a trap composed of 173 places in 220 ms of which 1 ms to minimize.
[2024-05-31 03:26:49] [INFO ] Deduced a trap composed of 176 places in 166 ms of which 0 ms to minimize.
[2024-05-31 03:26:49] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2024-05-31 03:26:50] [INFO ] Deduced a trap composed of 161 places in 190 ms of which 0 ms to minimize.
[2024-05-31 03:26:50] [INFO ] Deduced a trap composed of 179 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:26:50] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 0 ms to minimize.
[2024-05-31 03:26:50] [INFO ] Deduced a trap composed of 170 places in 179 ms of which 10 ms to minimize.
[2024-05-31 03:26:51] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2024-05-31 03:26:51] [INFO ] Deduced a trap composed of 158 places in 242 ms of which 0 ms to minimize.
[2024-05-31 03:26:52] [INFO ] Deduced a trap composed of 179 places in 173 ms of which 1 ms to minimize.
[2024-05-31 03:26:52] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2024-05-31 03:26:52] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 4469 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 65 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2024-05-31 03:26:52] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:26:52] [INFO ] Invariant cache hit.
[2024-05-31 03:26:53] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 531/531 places, 747/747 transitions.
Normalized transition count is 743 out of 747 initially.
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:53] [INFO ] Computed 97 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 47297 resets, run finished after 3638 ms. (steps per millisecond=274 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4471 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties (out of 1) seen :3
[2024-05-31 03:26:58] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2024-05-31 03:26:58] [INFO ] Computed 97 invariants in 24 ms
[2024-05-31 03:26:58] [INFO ] [Real]Absence check using 90 positive place invariants in 21 ms returned sat
[2024-05-31 03:26:58] [INFO ] [Real]Absence check using 90 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 03:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:58] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-31 03:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:26:58] [INFO ] [Nat]Absence check using 90 positive place invariants in 16 ms returned sat
[2024-05-31 03:26:58] [INFO ] [Nat]Absence check using 90 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:26:58] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-05-31 03:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:26:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2024-05-31 03:26:58] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 1 ms to minimize.
[2024-05-31 03:26:59] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 1 ms to minimize.
[2024-05-31 03:26:59] [INFO ] Deduced a trap composed of 149 places in 219 ms of which 1 ms to minimize.
[2024-05-31 03:26:59] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 1 ms to minimize.
[2024-05-31 03:26:59] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 0 ms to minimize.
[2024-05-31 03:27:00] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 1 ms to minimize.
[2024-05-31 03:27:00] [INFO ] Deduced a trap composed of 176 places in 193 ms of which 0 ms to minimize.
[2024-05-31 03:27:00] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2024-05-31 03:27:00] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 0 ms to minimize.
[2024-05-31 03:27:01] [INFO ] Deduced a trap composed of 179 places in 190 ms of which 0 ms to minimize.
[2024-05-31 03:27:01] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 0 ms to minimize.
[2024-05-31 03:27:01] [INFO ] Deduced a trap composed of 170 places in 212 ms of which 1 ms to minimize.
[2024-05-31 03:27:02] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2024-05-31 03:27:02] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2024-05-31 03:27:02] [INFO ] Deduced a trap composed of 179 places in 188 ms of which 0 ms to minimize.
[2024-05-31 03:27:02] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 1 ms to minimize.
[2024-05-31 03:27:03] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 1 ms to minimize.
[2024-05-31 03:27:03] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 0 ms to minimize.
[2024-05-31 03:27:03] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 1 ms to minimize.
[2024-05-31 03:27:04] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 0 ms to minimize.
[2024-05-31 03:27:04] [INFO ] Deduced a trap composed of 170 places in 182 ms of which 1 ms to minimize.
[2024-05-31 03:27:05] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2024-05-31 03:27:05] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 0 ms to minimize.
[2024-05-31 03:27:05] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 1 ms to minimize.
[2024-05-31 03:27:06] [INFO ] Deduced a trap composed of 152 places in 166 ms of which 0 ms to minimize.
[2024-05-31 03:27:06] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 0 ms to minimize.
[2024-05-31 03:27:06] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 1 ms to minimize.
[2024-05-31 03:27:09] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 11032 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 29 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 531/531 places, 747/747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 transitions.
Applied a total of 0 rules in 15 ms. Remains 531 /531 variables (removed 0) and now considering 747/747 (removed 0) transitions.
[2024-05-31 03:27:09] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:27:09] [INFO ] Invariant cache hit.
[2024-05-31 03:27:10] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-31 03:27:10] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:27:10] [INFO ] Invariant cache hit.
[2024-05-31 03:27:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:27:12] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned []
Implicit Place search using SMT with State Equation took 2152 ms to find 0 implicit places.
[2024-05-31 03:27:12] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-31 03:27:12] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2024-05-31 03:27:12] [INFO ] Invariant cache hit.
[2024-05-31 03:27:12] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2747 ms. Remains : 531/531 places, 747/747 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J40-UpperBounds-15 in 25588 ms.
[2024-05-31 03:27:12] [INFO ] Flatten gal took : 140 ms
[2024-05-31 03:27:12] [INFO ] Applying decomposition
[2024-05-31 03:27:13] [INFO ] Flatten gal took : 82 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/graph17909096614325859281.txt' '-o' '/tmp/graph17909096614325859281.bin' '-w' '/tmp/graph17909096614325859281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17909096614325859281.bin' '-l' '-1' '-v' '-w' '/tmp/graph17909096614325859281.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:27:13] [INFO ] Decomposing Gal with order
[2024-05-31 03:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:27:13] [INFO ] Removed a total of 721 redundant transitions.
[2024-05-31 03:27:13] [INFO ] Flatten gal took : 279 ms
[2024-05-31 03:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 328 labels/synchronizations in 31 ms.
[2024-05-31 03:27:13] [INFO ] Time to serialize gal into /tmp/UpperBounds7868878678137159537.gal : 14 ms
[2024-05-31 03:27:13] [INFO ] Time to serialize properties into /tmp/UpperBounds12831195025963589751.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/UpperBounds7868878678137159537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12831195025963589751.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/UpperBounds12831195025963589751.prop.
Detected timeout of ITS tools.
[2024-05-31 03:47:45] [INFO ] Applying decomposition
[2024-05-31 03:47:45] [INFO ] Flatten gal took : 408 ms
[2024-05-31 03:47:45] [INFO ] Decomposing Gal with order
[2024-05-31 03:47:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:47:46] [INFO ] Removed a total of 2724 redundant transitions.
[2024-05-31 03:47:46] [INFO ] Flatten gal took : 588 ms
[2024-05-31 03:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 100 ms.
[2024-05-31 03:47:46] [INFO ] Time to serialize gal into /tmp/UpperBounds9304246507639571780.gal : 82 ms
[2024-05-31 03:47:46] [INFO ] Time to serialize properties into /tmp/UpperBounds12918341919952959187.prop : 2 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/UpperBounds9304246507639571780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12918341919952959187.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/UpperBounds12918341919952959187.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.10827e+10,709.452,7787492,1.97968e+06,25,2.03423e+07,2754,1808,2.2309e+07,48,2479,0
Total reachable state count : 11082705900

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J40-UpperBounds-15 :0 <= QueueJobE.QueueJobE_0 <= 3
FORMULA PolyORBNT-COL-S05J40-UpperBounds-15 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J40-UpperBounds-15,0,830.741,7798656,1,0,2.03423e+07,2754,3740,3.14225e+07,60,2479,54719
Total runtime 2149135 ms.

BK_STOP 1717128100698

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-S05J40"
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-S05J40, 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-171654460700236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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