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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717126555474

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-S05J60
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 03:36: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:36:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:36: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:36:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:36:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1383 ms
[2024-05-31 03:36:04] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 79 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
[2024-05-31 03:36:04] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 11 ms.
[2024-05-31 03:36:04] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:36:04] [INFO ] Computed 13 invariants in 22 ms
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 03:36:04] [INFO ] Invariant cache hit.
[2024-05-31 03:36:04] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-31 03:36:04] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-31 03:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:04] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 03:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:05] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-31 03:36:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:36:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2024-05-31 03:36:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 03:36:05] [INFO ] Added : 3 causal constraints over 1 iterations in 106 ms. Result :sat
Minimization took 16 ms.
[2024-05-31 03:36:05] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:05] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-31 03:36:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:05] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 03:36:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
[2024-05-31 03:36:05] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 18 ms to minimize.
[2024-05-31 03:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-05-31 03:36:05] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 03:36:06] [INFO ] Added : 36 causal constraints over 8 iterations in 217 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 03:36:06] [INFO ] [Real]Absence check using 6 positive place invariants in 40 ms returned sat
[2024-05-31 03:36:06] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 45 ms returned sat
[2024-05-31 03:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:06] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-31 03:36:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-05-31 03:36:06] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-31 03:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:07] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-31 03:36:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2024-05-31 03:36:07] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 23 ms to minimize.
[2024-05-31 03:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2024-05-31 03:36:07] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 03:36:07] [INFO ] Added : 20 causal constraints over 4 iterations in 353 ms. Result :sat
Minimization took 24 ms.
[2024-05-31 03:36:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:36:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-31 03:36:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:36:08] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 03:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:08] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 03:36:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-31 03:36:08] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 60 ms returned sat
[2024-05-31 03:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 03:36:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2024-05-31 03:36:08] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2024-05-31 03:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2024-05-31 03:36:08] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 03:36:08] [INFO ] Added : 22 causal constraints over 5 iterations in 214 ms. Result :sat
Minimization took 93 ms.
[2024-05-31 03:36:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:09] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 03:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:09] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-31 03:36:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:36:09] [INFO ] Added : 33 causal constraints over 7 iterations in 149 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 03:36:09] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 03:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:09] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 03:36:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:36:09] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-31 03:36:09] [INFO ] Added : 36 causal constraints over 8 iterations in 211 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 03:36:10] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:36:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 03:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:10] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 03:36:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 03:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 03:36:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2024-05-31 03:36:10] [INFO ] Deduced a trap composed of 14 places in 653 ms of which 5 ms to minimize.
[2024-05-31 03:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 657 ms
[2024-05-31 03:36:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:36:11] [INFO ] Added : 18 causal constraints over 4 iterations in 268 ms. Result :sat
Minimization took 101 ms.
[2024-05-31 03:36:11] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2024-05-31 03:36:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 56 ms returned sat
[2024-05-31 03:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:11] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-05-31 03:36:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:11] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-31 03:36:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2024-05-31 03:36:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:36:12] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using state equation in 204 ms returned unsat
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 03:36:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:12] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2024-05-31 03:36:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:36:12] [INFO ] Added : 3 causal constraints over 1 iterations in 82 ms. Result :sat
Minimization took 20 ms.
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 03:36:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 33 ms returned sat
[2024-05-31 03:36:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 56 ms returned sat
[2024-05-31 03:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:13] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-31 03:36:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 62 ms returned sat
[2024-05-31 03:36:13] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
[2024-05-31 03:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-31 03:36:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 03:36:13] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-31 03:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-31 03:36:13] [INFO ] Added : 36 causal constraints over 8 iterations in 247 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 03:36:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:36:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 4, 1, 4, 5, -1, 10, -1, 10, -1, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 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:36:13] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 161 ms.
[2024-05-31 03:36:13] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 31 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 681 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 10) seen :21
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 246 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 249 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :16
[2024-05-31 03:36:15] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-31 03:36:15] [INFO ] Computed 142 invariants in 272 ms
[2024-05-31 03:36:15] [INFO ] [Real]Absence check using 135 positive place invariants in 122 ms returned sat
[2024-05-31 03:36:15] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2024-05-31 03:36:16] [INFO ] [Real]Absence check using 135 positive place invariants in 45 ms returned sat
[2024-05-31 03:36:16] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-31 03:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:17] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2024-05-31 03:36:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:18] [INFO ] [Nat]Absence check using 135 positive place invariants in 658 ms returned sat
[2024-05-31 03:36:18] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 56 ms returned unsat
[2024-05-31 03:36:18] [INFO ] [Real]Absence check using 135 positive place invariants in 51 ms returned sat
[2024-05-31 03:36:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-31 03:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:19] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2024-05-31 03:36:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:19] [INFO ] [Nat]Absence check using 135 positive place invariants in 91 ms returned sat
[2024-05-31 03:36:19] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 50 ms returned sat
[2024-05-31 03:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:20] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2024-05-31 03:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:36:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 416 ms returned sat
[2024-05-31 03:36:21] [INFO ] Deduced a trap composed of 507 places in 706 ms of which 2 ms to minimize.
[2024-05-31 03:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 979 ms
[2024-05-31 03:36:22] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 220 ms.
[2024-05-31 03:36:23] [INFO ] Added : 19 causal constraints over 4 iterations in 1180 ms. Result :sat
Minimization took 493 ms.
[2024-05-31 03:36:23] [INFO ] [Real]Absence check using 135 positive place invariants in 55 ms returned sat
[2024-05-31 03:36:23] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-31 03:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:24] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-05-31 03:36:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:36:24] [INFO ] [Nat]Absence check using 135 positive place invariants in 46 ms returned sat
[2024-05-31 03:36:24] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2024-05-31 03:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:36:29] [INFO ] [Nat]Absence check using state equation in 4651 ms returned unknown
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive place invariants in 136 ms returned sat
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive place invariants in 59 ms returned sat
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 61 ms returned unsat
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive place invariants in 48 ms returned sat
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned unsat
[2024-05-31 03:36:30] [INFO ] [Real]Absence check using 135 positive place invariants in 49 ms returned sat
[2024-05-31 03:36:31] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 4, 5, 1, 4, 1, 1] Max seen :[1, 1, 3, 4, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 306 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 580 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
[2024-05-31 03:36:31] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-31 03:36:31] [INFO ] Computed 137 invariants in 132 ms
[2024-05-31 03:36:47] [INFO ] Dead Transitions using invariants and state equation in 16182 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 : 770/909 places, 1086/1315 transitions.
Applied a total of 0 rules in 61 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16872 ms. Remains : 770/909 places, 1086/1315 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:36:48] [INFO ] Computed 137 invariants in 48 ms
Incomplete random walk after 1000000 steps, including 52003 resets, run finished after 10179 ms. (steps per millisecond=98 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 3425 resets, run finished after 1457 ms. (steps per millisecond=686 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 3550 resets, run finished after 4191 ms. (steps per millisecond=238 ) properties (out of 2) seen :7
[2024-05-31 03:37:03] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:37:03] [INFO ] Computed 137 invariants in 16 ms
[2024-05-31 03:37:04] [INFO ] [Real]Absence check using 130 positive place invariants in 49 ms returned sat
[2024-05-31 03:37:04] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 44 ms returned sat
[2024-05-31 03:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:04] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2024-05-31 03:37:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:37:04] [INFO ] [Nat]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-31 03:37:04] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 03:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:05] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-31 03:37:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:37:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 143 ms returned sat
[2024-05-31 03:37:11] [INFO ] Deduced a trap composed of 242 places in 5725 ms of which 2 ms to minimize.
[2024-05-31 03:37:11] [INFO ] Deduced a trap composed of 236 places in 296 ms of which 1 ms to minimize.
[2024-05-31 03:37:11] [INFO ] Deduced a trap composed of 239 places in 446 ms of which 1 ms to minimize.
[2024-05-31 03:37:12] [INFO ] Deduced a trap composed of 230 places in 403 ms of which 1 ms to minimize.
[2024-05-31 03:37:12] [INFO ] Deduced a trap composed of 248 places in 300 ms of which 1 ms to minimize.
[2024-05-31 03:37:13] [INFO ] Deduced a trap composed of 254 places in 412 ms of which 0 ms to minimize.
[2024-05-31 03:37:13] [INFO ] Deduced a trap composed of 227 places in 505 ms of which 1 ms to minimize.
[2024-05-31 03:37:14] [INFO ] Deduced a trap composed of 249 places in 554 ms of which 1 ms to minimize.
[2024-05-31 03:37:15] [INFO ] Deduced a trap composed of 233 places in 488 ms of which 1 ms to minimize.
[2024-05-31 03:37:15] [INFO ] Deduced a trap composed of 239 places in 354 ms of which 0 ms to minimize.
[2024-05-31 03:37:16] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 1 ms to minimize.
[2024-05-31 03:37:16] [INFO ] Deduced a trap composed of 224 places in 353 ms of which 1 ms to minimize.
[2024-05-31 03:37:16] [INFO ] Deduced a trap composed of 242 places in 271 ms of which 1 ms to minimize.
[2024-05-31 03:37:17] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 0 ms to minimize.
[2024-05-31 03:37:18] [INFO ] Deduced a trap composed of 242 places in 464 ms of which 2 ms to minimize.
[2024-05-31 03:37:20] [INFO ] Deduced a trap composed of 231 places in 318 ms of which 1 ms to minimize.
[2024-05-31 03:37:21] [INFO ] Deduced a trap composed of 261 places in 307 ms of which 1 ms to minimize.
[2024-05-31 03:37:21] [INFO ] Deduced a trap composed of 236 places in 312 ms of which 1 ms to minimize.
[2024-05-31 03:37:24] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 19211 ms
[2024-05-31 03:37:24] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-31 03:37:24] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 66 ms returned sat
[2024-05-31 03:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:25] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-31 03:37:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:37:25] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2024-05-31 03:37:25] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 03:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:27] [INFO ] [Nat]Absence check using state equation in 2463 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4] Max seen :[3, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 55 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 770/770 places, 1086/1086 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:37:27] [INFO ] Computed 137 invariants in 15 ms
Incomplete random walk after 1000000 steps, including 52058 resets, run finished after 5154 ms. (steps per millisecond=194 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3409 resets, run finished after 1257 ms. (steps per millisecond=795 ) properties (out of 1) seen :3
[2024-05-31 03:37:34] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:37:34] [INFO ] Computed 137 invariants in 40 ms
[2024-05-31 03:37:34] [INFO ] [Real]Absence check using 130 positive place invariants in 34 ms returned sat
[2024-05-31 03:37:34] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 48 ms returned sat
[2024-05-31 03:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:34] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-31 03:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:37:35] [INFO ] [Nat]Absence check using 130 positive place invariants in 34 ms returned sat
[2024-05-31 03:37:35] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 03:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:35] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-05-31 03:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:37:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 145 ms returned sat
[2024-05-31 03:37:36] [INFO ] Deduced a trap composed of 242 places in 599 ms of which 2 ms to minimize.
[2024-05-31 03:37:36] [INFO ] Deduced a trap composed of 236 places in 528 ms of which 1 ms to minimize.
[2024-05-31 03:37:37] [INFO ] Deduced a trap composed of 239 places in 317 ms of which 1 ms to minimize.
[2024-05-31 03:37:37] [INFO ] Deduced a trap composed of 230 places in 393 ms of which 1 ms to minimize.
[2024-05-31 03:37:38] [INFO ] Deduced a trap composed of 248 places in 315 ms of which 1 ms to minimize.
[2024-05-31 03:37:38] [INFO ] Deduced a trap composed of 254 places in 285 ms of which 1 ms to minimize.
[2024-05-31 03:37:38] [INFO ] Deduced a trap composed of 227 places in 311 ms of which 1 ms to minimize.
[2024-05-31 03:37:39] [INFO ] Deduced a trap composed of 249 places in 284 ms of which 1 ms to minimize.
[2024-05-31 03:37:39] [INFO ] Deduced a trap composed of 233 places in 312 ms of which 2 ms to minimize.
[2024-05-31 03:37:40] [INFO ] Deduced a trap composed of 239 places in 299 ms of which 5 ms to minimize.
[2024-05-31 03:37:40] [INFO ] Deduced a trap composed of 236 places in 316 ms of which 1 ms to minimize.
[2024-05-31 03:37:40] [INFO ] Deduced a trap composed of 224 places in 423 ms of which 2 ms to minimize.
[2024-05-31 03:37:41] [INFO ] Deduced a trap composed of 242 places in 319 ms of which 1 ms to minimize.
[2024-05-31 03:37:41] [INFO ] Deduced a trap composed of 236 places in 334 ms of which 1 ms to minimize.
[2024-05-31 03:37:42] [INFO ] Deduced a trap composed of 242 places in 337 ms of which 1 ms to minimize.
[2024-05-31 03:37:45] [INFO ] Deduced a trap composed of 231 places in 640 ms of which 1 ms to minimize.
[2024-05-31 03:37:45] [INFO ] Deduced a trap composed of 261 places in 444 ms of which 1 ms to minimize.
[2024-05-31 03:37:46] [INFO ] Deduced a trap composed of 236 places in 458 ms of which 1 ms to minimize.
[2024-05-31 03:37:49] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 13787 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 58 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 118 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 03:37:49] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:37:49] [INFO ] Invariant cache hit.
[2024-05-31 03:37:50] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-05-31 03:37:50] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:37:50] [INFO ] Invariant cache hit.
[2024-05-31 03:37:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:37:55] [INFO ] Implicit Places using invariants and state equation in 4595 ms returned []
Implicit Place search using SMT with State Equation took 5631 ms to find 0 implicit places.
[2024-05-31 03:37:55] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-31 03:37:55] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:37:55] [INFO ] Invariant cache hit.
[2024-05-31 03:37:56] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6671 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:37:56] [INFO ] Computed 137 invariants in 28 ms
Incomplete random walk after 10000 steps, including 528 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2024-05-31 03:37:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:37:56] [INFO ] Computed 137 invariants in 20 ms
[2024-05-31 03:37:56] [INFO ] [Real]Absence check using 130 positive place invariants in 29 ms returned sat
[2024-05-31 03:37:56] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 03:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:56] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-31 03:37:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:37:57] [INFO ] [Nat]Absence check using 130 positive place invariants in 65 ms returned sat
[2024-05-31 03:37:57] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-31 03:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:37:57] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-05-31 03:37:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:37:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 110 ms returned sat
[2024-05-31 03:37:58] [INFO ] Deduced a trap composed of 242 places in 309 ms of which 1 ms to minimize.
[2024-05-31 03:37:58] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 0 ms to minimize.
[2024-05-31 03:37:59] [INFO ] Deduced a trap composed of 239 places in 336 ms of which 0 ms to minimize.
[2024-05-31 03:37:59] [INFO ] Deduced a trap composed of 230 places in 373 ms of which 1 ms to minimize.
[2024-05-31 03:38:00] [INFO ] Deduced a trap composed of 248 places in 357 ms of which 1 ms to minimize.
[2024-05-31 03:38:00] [INFO ] Deduced a trap composed of 254 places in 288 ms of which 1 ms to minimize.
[2024-05-31 03:38:00] [INFO ] Deduced a trap composed of 227 places in 298 ms of which 0 ms to minimize.
[2024-05-31 03:38:01] [INFO ] Deduced a trap composed of 249 places in 265 ms of which 1 ms to minimize.
[2024-05-31 03:38:01] [INFO ] Deduced a trap composed of 233 places in 359 ms of which 1 ms to minimize.
[2024-05-31 03:38:02] [INFO ] Deduced a trap composed of 239 places in 358 ms of which 1 ms to minimize.
[2024-05-31 03:38:02] [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) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 34 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 03:38:02] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:38:02] [INFO ] Invariant cache hit.
[2024-05-31 03:38:02] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 770/770 places, 1086/1086 transitions.
Normalized transition count is 1082 out of 1086 initially.
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:38:03] [INFO ] Computed 137 invariants in 20 ms
Incomplete random walk after 1000000 steps, including 51972 resets, run finished after 4606 ms. (steps per millisecond=217 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3394 resets, run finished after 1477 ms. (steps per millisecond=677 ) properties (out of 1) seen :3
[2024-05-31 03:38:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-31 03:38:09] [INFO ] Computed 137 invariants in 21 ms
[2024-05-31 03:38:09] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-31 03:38:09] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-31 03:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:38:09] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-05-31 03:38:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:38:09] [INFO ] [Nat]Absence check using 130 positive place invariants in 35 ms returned sat
[2024-05-31 03:38:09] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 03:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:38:10] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2024-05-31 03:38:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:38:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 145 ms returned sat
[2024-05-31 03:38:11] [INFO ] Deduced a trap composed of 242 places in 366 ms of which 1 ms to minimize.
[2024-05-31 03:38:11] [INFO ] Deduced a trap composed of 236 places in 557 ms of which 1 ms to minimize.
[2024-05-31 03:38:12] [INFO ] Deduced a trap composed of 239 places in 426 ms of which 11 ms to minimize.
[2024-05-31 03:38:12] [INFO ] Deduced a trap composed of 230 places in 446 ms of which 2 ms to minimize.
[2024-05-31 03:38:13] [INFO ] Deduced a trap composed of 248 places in 412 ms of which 1 ms to minimize.
[2024-05-31 03:38:13] [INFO ] Deduced a trap composed of 254 places in 432 ms of which 1 ms to minimize.
[2024-05-31 03:38:14] [INFO ] Deduced a trap composed of 227 places in 440 ms of which 1 ms to minimize.
[2024-05-31 03:38:14] [INFO ] Deduced a trap composed of 249 places in 433 ms of which 1 ms to minimize.
[2024-05-31 03:38:15] [INFO ] Deduced a trap composed of 233 places in 471 ms of which 1 ms to minimize.
[2024-05-31 03:38:15] [INFO ] Deduced a trap composed of 239 places in 428 ms of which 1 ms to minimize.
[2024-05-31 03:38:16] [INFO ] Deduced a trap composed of 236 places in 407 ms of which 1 ms to minimize.
[2024-05-31 03:38:16] [INFO ] Deduced a trap composed of 224 places in 311 ms of which 1 ms to minimize.
[2024-05-31 03:38:17] [INFO ] Deduced a trap composed of 242 places in 298 ms of which 3 ms to minimize.
[2024-05-31 03:38:17] [INFO ] Deduced a trap composed of 236 places in 323 ms of which 3 ms to minimize.
[2024-05-31 03:38:18] [INFO ] Deduced a trap composed of 242 places in 631 ms of which 2 ms to minimize.
[2024-05-31 03:38:21] [INFO ] Deduced a trap composed of 231 places in 601 ms of which 0 ms to minimize.
[2024-05-31 03:38:22] [INFO ] Deduced a trap composed of 261 places in 473 ms of which 1 ms to minimize.
[2024-05-31 03:38:22] [INFO ] Deduced a trap composed of 236 places in 314 ms of which 0 ms to minimize.
[2024-05-31 03:38:25] [INFO ] Trap strengthening (SAT) tested/added 18/18 trap constraints in 14665 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 82 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 49 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-31 03:38:25] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:38:25] [INFO ] Invariant cache hit.
[2024-05-31 03:38:26] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2024-05-31 03:38:26] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:38:26] [INFO ] Invariant cache hit.
[2024-05-31 03:38:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:38:30] [INFO ] Implicit Places using invariants and state equation in 3999 ms returned []
Implicit Place search using SMT with State Equation took 5220 ms to find 0 implicit places.
[2024-05-31 03:38:30] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-31 03:38:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-31 03:38:30] [INFO ] Invariant cache hit.
[2024-05-31 03:38:31] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6081 ms. Remains : 770/770 places, 1086/1086 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06 in 35316 ms.
[2024-05-31 03:38:31] [INFO ] Flatten gal took : 166 ms
[2024-05-31 03:38:31] [INFO ] Applying decomposition
[2024-05-31 03:38:32] [INFO ] Flatten gal took : 89 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/graph9416527747402438569.txt' '-o' '/tmp/graph9416527747402438569.bin' '-w' '/tmp/graph9416527747402438569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9416527747402438569.bin' '-l' '-1' '-v' '-w' '/tmp/graph9416527747402438569.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:38:32] [INFO ] Decomposing Gal with order
[2024-05-31 03:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:38:32] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-31 03:38:32] [INFO ] Flatten gal took : 366 ms
[2024-05-31 03:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 498 labels/synchronizations in 50 ms.
[2024-05-31 03:38:32] [INFO ] Time to serialize gal into /tmp/UpperBounds17751673800467016831.gal : 20 ms
[2024-05-31 03:38:32] [INFO ] Time to serialize properties into /tmp/UpperBounds17016634846570315532.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/UpperBounds17751673800467016831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17016634846570315532.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 ...285
Loading property file /tmp/UpperBounds17016634846570315532.prop.
Detected timeout of ITS tools.
[2024-05-31 03:59:24] [INFO ] Applying decomposition
[2024-05-31 03:59:24] [INFO ] Flatten gal took : 212 ms
[2024-05-31 03:59:24] [INFO ] Decomposing Gal with order
[2024-05-31 03:59:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:59:25] [INFO ] Removed a total of 3944 redundant transitions.
[2024-05-31 03:59:25] [INFO ] Flatten gal took : 142 ms
[2024-05-31 03:59:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-31 03:59:26] [INFO ] Time to serialize gal into /tmp/UpperBounds15348795261806412867.gal : 985 ms
[2024-05-31 03:59:26] [INFO ] Time to serialize properties into /tmp/UpperBounds18232937824251792979.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/UpperBounds15348795261806412867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18232937824251792979.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 ...285
Loading property file /tmp/UpperBounds18232937824251792979.prop.
Detected timeout of ITS tools.
[2024-05-31 04:20:18] [INFO ] Flatten gal took : 791 ms
[2024-05-31 04:20:19] [INFO ] Input system was already deterministic with 1086 transitions.
[2024-05-31 04:20:19] [INFO ] Transformed 770 places.
[2024-05-31 04:20:19] [INFO ] Transformed 1086 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:20:49] [INFO ] Time to serialize gal into /tmp/UpperBounds17663401239459209215.gal : 16 ms
[2024-05-31 04:20:49] [INFO ] Time to serialize properties into /tmp/UpperBounds7916658117383022007.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/UpperBounds17663401239459209215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7916658117383022007.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7916658117383022007.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 1781772 kB
After kill :
MemTotal: 16393356 kB
MemFree: 15830704 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-S05J60"
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-S05J60, 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-171654460700241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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