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-165277016800501.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-S04J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016800501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.6K Apr 29 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 14:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:28 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-S04J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S04J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652864496623

Running Version 202205111006
[2022-05-18 09:01:37] [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 09:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 09:01:37] [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 09:01:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 09:01:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 716 ms
[2022-05-18 09:01:38] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 712 PT places and 4080.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-18 09:01:38] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2022-05-18 09:01:38] [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 09:01:38] [INFO ] Computed 26 place invariants in 12 ms
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 09:01:38] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 09:01:38] [INFO ] Computed 26 place invariants in 5 ms
[2022-05-18 09:01:38] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 09:01:38] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 14 ms returned sat
[2022-05-18 09:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:38] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-18 09:01:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-18 09:01:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-18 09:01:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2022-05-18 09:01:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-18 09:01:39] [INFO ] Added : 54 causal constraints over 11 iterations in 133 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-18 09:01:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 09:01:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 09:01:39] [INFO ] Added : 3 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-18 09:01:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:39] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2022-05-18 09:01:39] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-18 09:01:39] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 6 ms to minimize.
[2022-05-18 09:01:39] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2022-05-18 09:01:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2022-05-18 09:01:39] [INFO ] Added : 28 causal constraints over 7 iterations in 149 ms. Result :sat
Minimization took 17 ms.
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 09:01:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2022-05-18 09:01:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 09:01:40] [INFO ] Added : 54 causal constraints over 11 iterations in 106 ms. Result :sat
Minimization took 18 ms.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 13 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-18 09:01:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2022-05-18 09:01:40] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2022-05-18 09:01:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-18 09:01:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-18 09:01:40] [INFO ] Added : 54 causal constraints over 11 iterations in 152 ms. Result :sat
Minimization took 20 ms.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 09:01:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 38 ms returned sat
[2022-05-18 09:01:40] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 09:01:40] [INFO ] Added : 9 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-18 09:01:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-18 09:01:40] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 09:01:41] [INFO ] Added : 29 causal constraints over 7 iterations in 58 ms. Result :sat
Minimization took 123 ms.
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 09:01:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2022-05-18 09:01:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-18 09:01:41] [INFO ] Added : 31 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned unsat
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-18 09:01:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 09:01:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 09:01:41] [INFO ] Added : 29 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 48 ms.
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:41] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-18 09:01:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:41] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-18 09:01:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 09:01:41] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 09:01:41] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 09:01:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:42] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 09:01:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:42] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 09:01:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 09:01:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 5 ms to minimize.
[2022-05-18 09:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-18 09:01:42] [INFO ] Added : 37 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 35 ms.
[2022-05-18 09:01:42] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 09:01:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:42] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-18 09:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 09:01:42] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
[2022-05-18 09:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-18 09:01:42] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 09:01:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2022-05-18 09:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-05-18 09:01:42] [INFO ] Added : 28 causal constraints over 6 iterations in 118 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, 4, 1, 1, 8, 4, 38, 1, 1, 8, 4, 1, 1]
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 09:01:42] [INFO ] Unfolded HLPN to a Petri net with 712 places and 4012 transitions 27744 arcs in 82 ms.
[2022-05-18 09:01:42] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :27
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :11
[2022-05-18 09:01:42] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2022-05-18 09:01:43] [INFO ] Computed 54 place invariants in 164 ms
[2022-05-18 09:01:43] [INFO ] [Real]Absence check using 16 positive place invariants in 25 ms returned sat
[2022-05-18 09:01:43] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 40 ms returned unsat
[2022-05-18 09:01:43] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-05-18 09:01:43] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned unsat
[2022-05-18 09:01:43] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-18 09:01:43] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 30 ms returned sat
[2022-05-18 09:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:44] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2022-05-18 09:01:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 09:01:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-18 09:01:44] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 25 ms returned sat
[2022-05-18 09:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 09:01:45] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2022-05-18 09:01:45] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-05-18 09:01:46] [INFO ] [Nat]Added 160 Read/Feed constraints in 788 ms returned sat
[2022-05-18 09:01:46] [INFO ] Deduced a trap composed of 174 places in 345 ms of which 0 ms to minimize.
[2022-05-18 09:01:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 404 ms
Current structural bounds on expressions (after SMT) : [1, 4, 7] Max seen :[1, 4, 7]
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S04J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8789 ms.

BK_STOP 1652864506624

--------------------
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-S04J04T08"
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-S04J04T08, 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-165277016800501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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