fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r168-tall-165277016900573
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for PolyORBLF-COL-S06J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16222.352 3600000.00 2635749.00 616079.50 2 4 6 2 4 ? 1 4 4 1 1 1 1 6 4 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016900573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S06J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016900573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.0K Apr 29 13:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 13:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 13:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 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 PolyORBLF-COL-S06J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652884008544

Running Version 202205111006
[2022-05-18 14:26:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 14:26:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 14:26:49] [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.
[2022-05-18 14:26:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 14:26:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2022-05-18 14:26:50] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-18 14:26:50] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2022-05-18 14:26:50] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 14:26:50] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-18 14:26:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 14:26:50] [INFO ] Computed 26 place invariants in 12 ms
[2022-05-18 14:26:50] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 14:26:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 14:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:50] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-18 14:26:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-05-18 14:26:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:50] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-18 14:26:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-18 14:26:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2022-05-18 14:26:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-18 14:26:50] [INFO ] Added : 10 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 14:26:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 14:26:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 14:26:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 14:26:51] [INFO ] Added : 27 causal constraints over 6 iterations in 58 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 14:26:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2022-05-18 14:26:51] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2022-05-18 14:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-18 14:26:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 14:26:51] [INFO ] Added : 42 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 34 ms.
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 14:26:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 14:26:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 14:26:51] [INFO ] Added : 33 causal constraints over 7 iterations in 83 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-18 14:26:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:51] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-18 14:26:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 14:26:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 14:26:52] [INFO ] Added : 58 causal constraints over 12 iterations in 103 ms. Result :sat
Minimization took 36 ms.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-18 14:26:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 31 ms returned sat
[2022-05-18 14:26:52] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2022-05-18 14:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-18 14:26:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 14:26:52] [INFO ] Added : 22 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 29 ms.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 14:26:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2022-05-18 14:26:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-18 14:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-18 14:26:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 14:26:52] [INFO ] Added : 37 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 18 ms.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 14:26:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 20 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 14:26:52] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 20 ms.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 14:26:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:52] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-18 14:26:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 14:26:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 14:26:53] [INFO ] Added : 3 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 14:26:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 14:26:53] [INFO ] Added : 31 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 16 ms.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 14:26:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 14:26:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
[2022-05-18 14:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-18 14:26:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 14:26:53] [INFO ] Added : 62 causal constraints over 13 iterations in 115 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 14:26:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2022-05-18 14:26:53] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2022-05-18 14:26:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2022-05-18 14:26:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-18 14:26:53] [INFO ] Added : 59 causal constraints over 12 iterations in 101 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 14:26:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:53] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-18 14:26:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 14:26:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 14:26:53] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2022-05-18 14:26:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 14:26:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:54] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2022-05-18 14:26:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 14:26:54] [INFO ] Added : 32 causal constraints over 7 iterations in 50 ms. Result :sat
Minimization took 36 ms.
[2022-05-18 14:26:54] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 14:26:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:54] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-18 14:26:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 31 ms returned sat
[2022-05-18 14:26:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 14:26:54] [INFO ] Added : 50 causal constraints over 10 iterations in 72 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [6, 4, 6, 2, 6, 6, 6, 40, 4, 1, 6, 6, 1, 6, 46, 1]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 14:26:54] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 152 ms.
[2022-05-18 14:26:54] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 15) seen :39
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :21
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :17
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :18
[2022-05-18 14:26:55] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2022-05-18 14:26:55] [INFO ] Computed 58 place invariants in 160 ms
[2022-05-18 14:26:55] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-05-18 14:26:55] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 26 ms returned sat
[2022-05-18 14:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:56] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2022-05-18 14:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:56] [INFO ] [Nat]Absence check using 24 positive place invariants in 12 ms returned sat
[2022-05-18 14:26:56] [INFO ] [Nat]Absence check using 24 positive and 34 generalized place invariants in 25 ms returned unsat
[2022-05-18 14:26:56] [INFO ] [Real]Absence check using 24 positive place invariants in 10 ms returned unsat
[2022-05-18 14:26:56] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2022-05-18 14:26:56] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 31 ms returned sat
[2022-05-18 14:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:57] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2022-05-18 14:26:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:26:57] [INFO ] [Nat]Absence check using 24 positive place invariants in 15 ms returned sat
[2022-05-18 14:26:57] [INFO ] [Nat]Absence check using 24 positive and 34 generalized place invariants in 25 ms returned sat
[2022-05-18 14:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:26:57] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2022-05-18 14:26:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:27:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:27:02] [INFO ] [Nat]Added 168 Read/Feed constraints in 4284 ms returned unknown
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 26 ms returned unsat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive place invariants in 13 ms returned unsat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 27 ms returned unsat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 25 ms returned unsat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-05-18 14:27:02] [INFO ] [Real]Absence check using 24 positive and 34 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 4, 6, 1, 4, 1, 1, 4] Max seen :[2, 4, 4, 1, 4, 1, 1, 4]
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J06T06-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 36 out of 700 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 694 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 640 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 114 place count 640 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 282 place count 556 transition count 2532
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 426 place count 484 transition count 2460
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 438 place count 484 transition count 2448
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 450 place count 472 transition count 2448
Applied a total of 450 rules in 374 ms. Remains 472 /700 variables (removed 228) and now considering 2448/2670 (removed 222) transitions.
[2022-05-18 14:27:03] [INFO ] Flow matrix only has 2412 transitions (discarded 36 similar events)
// Phase 1: matrix 2412 rows 472 cols
[2022-05-18 14:27:03] [INFO ] Computed 52 place invariants in 93 ms
[2022-05-18 14:27:04] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 472/700 places, 1530/2670 transitions.
Applied a total of 0 rules in 30 ms. Remains 472 /472 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 472/700 places, 1530/2670 transitions.
Normalized transition count is 1494 out of 1530 initially.
// Phase 1: matrix 1494 rows 472 cols
[2022-05-18 14:27:04] [INFO ] Computed 52 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 10861 resets, run finished after 5414 ms. (steps per millisecond=184 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1826 resets, run finished after 2229 ms. (steps per millisecond=448 ) properties (out of 1) seen :4
[2022-05-18 14:27:11] [INFO ] Flow matrix only has 1494 transitions (discarded 36 similar events)
// Phase 1: matrix 1494 rows 472 cols
[2022-05-18 14:27:11] [INFO ] Computed 52 place invariants in 32 ms
[2022-05-18 14:27:12] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2022-05-18 14:27:12] [INFO ] [Real]Absence check using 19 positive and 33 generalized place invariants in 16 ms returned sat
[2022-05-18 14:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:27:12] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2022-05-18 14:27:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:27:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2022-05-18 14:27:12] [INFO ] [Nat]Absence check using 19 positive and 33 generalized place invariants in 25 ms returned sat
[2022-05-18 14:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:27:13] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2022-05-18 14:27:13] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:27:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:27:19] [INFO ] [Nat]Added 168 Read/Feed constraints in 6021 ms returned unknown
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 472 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 472/472 places, 1530/1530 transitions.
Applied a total of 0 rules in 32 ms. Remains 472 /472 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 472/472 places, 1530/1530 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 472/472 places, 1530/1530 transitions.
Applied a total of 0 rules in 24 ms. Remains 472 /472 variables (removed 0) and now considering 1530/1530 (removed 0) transitions.
[2022-05-18 14:27:19] [INFO ] Flow matrix only has 1494 transitions (discarded 36 similar events)
// Phase 1: matrix 1494 rows 472 cols
[2022-05-18 14:27:19] [INFO ] Computed 52 place invariants in 24 ms
[2022-05-18 14:27:19] [INFO ] Implicit Places using invariants in 492 ms returned [408, 409, 410, 411, 412, 413]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 497 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 466/472 places, 1530/1530 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 460 transition count 1524
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 460 transition count 1524
Applied a total of 12 rules in 44 ms. Remains 460 /466 variables (removed 6) and now considering 1524/1530 (removed 6) transitions.
[2022-05-18 14:27:19] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:19] [INFO ] Computed 46 place invariants in 30 ms
[2022-05-18 14:27:20] [INFO ] Implicit Places using invariants in 446 ms returned []
[2022-05-18 14:27:20] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:20] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-18 14:27:20] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:27:29] [INFO ] Implicit Places using invariants and state equation in 9714 ms returned []
Implicit Place search using SMT with State Equation took 10166 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 460/472 places, 1524/1530 transitions.
Finished structural reductions, in 2 iterations. Remains : 460/472 places, 1524/1530 transitions.
Normalized transition count is 1488 out of 1524 initially.
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:29] [INFO ] Computed 46 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 10991 resets, run finished after 5090 ms. (steps per millisecond=196 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 1871 resets, run finished after 2153 ms. (steps per millisecond=464 ) properties (out of 1) seen :4
[2022-05-18 14:27:37] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:37] [INFO ] Computed 46 place invariants in 32 ms
[2022-05-18 14:27:37] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-18 14:27:37] [INFO ] [Real]Absence check using 20 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 14:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:27:37] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-05-18 14:27:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:27:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-18 14:27:37] [INFO ] [Nat]Absence check using 20 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 14:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:27:38] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2022-05-18 14:27:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:27:41] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:27:42] [INFO ] [Nat]Added 168 Read/Feed constraints in 4205 ms returned sat
[2022-05-18 14:27:42] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 0 ms to minimize.
[2022-05-18 14:27:45] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3121 ms
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 460 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 460/460 places, 1524/1524 transitions.
Applied a total of 0 rules in 27 ms. Remains 460 /460 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 460/460 places, 1524/1524 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 460/460 places, 1524/1524 transitions.
Applied a total of 0 rules in 26 ms. Remains 460 /460 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2022-05-18 14:27:46] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:46] [INFO ] Computed 46 place invariants in 27 ms
[2022-05-18 14:27:46] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-05-18 14:27:46] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:46] [INFO ] Computed 46 place invariants in 25 ms
[2022-05-18 14:27:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:27:58] [INFO ] Implicit Places using invariants and state equation in 11604 ms returned []
Implicit Place search using SMT with State Equation took 12044 ms to find 0 implicit places.
[2022-05-18 14:27:58] [INFO ] Redundant transitions in 88 ms returned []
[2022-05-18 14:27:58] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:58] [INFO ] Computed 46 place invariants in 31 ms
[2022-05-18 14:27:58] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 460/460 places, 1524/1524 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J06T06-UpperBounds-05
Normalized transition count is 1488 out of 1524 initially.
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:58] [INFO ] Computed 46 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 97 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :4
[2022-05-18 14:27:59] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:27:59] [INFO ] Computed 46 place invariants in 33 ms
[2022-05-18 14:27:59] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-18 14:27:59] [INFO ] [Real]Absence check using 20 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 14:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:27:59] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-05-18 14:27:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:27:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-18 14:27:59] [INFO ] [Nat]Absence check using 20 positive and 26 generalized place invariants in 20 ms returned sat
[2022-05-18 14:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:28:00] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2022-05-18 14:28:00] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:28:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:28:04] [INFO ] [Nat]Added 168 Read/Feed constraints in 4234 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 460 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 460/460 places, 1524/1524 transitions.
Applied a total of 0 rules in 32 ms. Remains 460 /460 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2022-05-18 14:28:04] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:28:04] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-18 14:28:05] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 460/460 places, 1524/1524 transitions.
Normalized transition count is 1488 out of 1524 initially.
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:28:05] [INFO ] Computed 46 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 10816 resets, run finished after 5141 ms. (steps per millisecond=194 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 1832 resets, run finished after 2190 ms. (steps per millisecond=456 ) properties (out of 1) seen :4
[2022-05-18 14:28:12] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:28:12] [INFO ] Computed 46 place invariants in 28 ms
[2022-05-18 14:28:12] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-18 14:28:12] [INFO ] [Real]Absence check using 20 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 14:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:28:13] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2022-05-18 14:28:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:28:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-18 14:28:13] [INFO ] [Nat]Absence check using 20 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 14:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:28:13] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2022-05-18 14:28:13] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:28:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:28:18] [INFO ] [Nat]Added 168 Read/Feed constraints in 4585 ms returned sat
[2022-05-18 14:28:18] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 1 ms to minimize.
[2022-05-18 14:28:21] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3338 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 460 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 460/460 places, 1524/1524 transitions.
Applied a total of 0 rules in 22 ms. Remains 460 /460 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 460/460 places, 1524/1524 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 460/460 places, 1524/1524 transitions.
Applied a total of 0 rules in 24 ms. Remains 460 /460 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2022-05-18 14:28:21] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:28:22] [INFO ] Computed 46 place invariants in 35 ms
[2022-05-18 14:28:22] [INFO ] Implicit Places using invariants in 454 ms returned []
[2022-05-18 14:28:22] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:28:22] [INFO ] Computed 46 place invariants in 31 ms
[2022-05-18 14:28:22] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 14:28:32] [INFO ] Implicit Places using invariants and state equation in 10371 ms returned []
Implicit Place search using SMT with State Equation took 10827 ms to find 0 implicit places.
[2022-05-18 14:28:32] [INFO ] Redundant transitions in 70 ms returned []
[2022-05-18 14:28:32] [INFO ] Flow matrix only has 1488 transitions (discarded 36 similar events)
// Phase 1: matrix 1488 rows 460 cols
[2022-05-18 14:28:32] [INFO ] Computed 46 place invariants in 32 ms
[2022-05-18 14:28:33] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 460/460 places, 1524/1524 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J06T06-UpperBounds-05 in 34642 ms.
[2022-05-18 14:28:33] [INFO ] Flatten gal took : 189 ms
[2022-05-18 14:28:33] [INFO ] Applying decomposition
[2022-05-18 14:28:34] [INFO ] Flatten gal took : 139 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6388954917476066477.txt' '-o' '/tmp/graph6388954917476066477.bin' '-w' '/tmp/graph6388954917476066477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6388954917476066477.bin' '-l' '-1' '-v' '-w' '/tmp/graph6388954917476066477.weights' '-q' '0' '-e' '0.001'
[2022-05-18 14:28:34] [INFO ] Decomposing Gal with order
[2022-05-18 14:28:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 14:28:34] [INFO ] Removed a total of 1142 redundant transitions.
[2022-05-18 14:28:34] [INFO ] Flatten gal took : 420 ms
[2022-05-18 14:28:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 46 ms.
[2022-05-18 14:28:35] [INFO ] Time to serialize gal into /tmp/UpperBounds14536320028442811098.gal : 29 ms
[2022-05-18 14:28:35] [INFO ] Time to serialize properties into /tmp/UpperBounds9012664820626712989.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14536320028442811098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9012664820626712989.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds9012664820626712989.prop.
Detected timeout of ITS tools.
[2022-05-18 14:49:11] [INFO ] Applying decomposition
[2022-05-18 14:49:26] [INFO ] Flatten gal took : 15487 ms
[2022-05-18 14:49:27] [INFO ] Decomposing Gal with order
[2022-05-18 14:49:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 14:49:28] [INFO ] Removed a total of 7299 redundant transitions.
[2022-05-18 14:49:28] [INFO ] Flatten gal took : 708 ms
[2022-05-18 14:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 188 ms.
[2022-05-18 14:49:29] [INFO ] Time to serialize gal into /tmp/UpperBounds4695743727719855770.gal : 40 ms
[2022-05-18 14:49:29] [INFO ] Time to serialize properties into /tmp/UpperBounds13256405197619717924.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4695743727719855770.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13256405197619717924.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds13256405197619717924.prop.
Detected timeout of ITS tools.
[2022-05-18 15:10:10] [INFO ] Flatten gal took : 613 ms
[2022-05-18 15:10:12] [INFO ] Input system was already deterministic with 1524 transitions.
[2022-05-18 15:10:12] [INFO ] Transformed 460 places.
[2022-05-18 15:10:12] [INFO ] Transformed 1524 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-18 15:10:43] [INFO ] Time to serialize gal into /tmp/UpperBounds16156988653967677011.gal : 8 ms
[2022-05-18 15:10:43] [INFO ] Time to serialize properties into /tmp/UpperBounds7191472059518336783.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16156988653967677011.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7191472059518336783.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7191472059518336783.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="PolyORBLF-COL-S06J06T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J06T06, 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 r168-tall-165277016900573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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