Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679616202846

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 00:03:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 00:03:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 00:03:24] [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.
[2023-03-24 00:03:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 00:03:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 466 ms
[2023-03-24 00:03:25] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-24 00:03:25] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-24 00:03:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-24 00:03:25] [INFO ] Computed 13 place invariants in 9 ms
FORMULA PolyORBNT-COL-S05J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-24 00:03:25] [INFO ] Invariant cache hit.
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-24 00:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:25] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-24 00:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-24 00:03:25] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 3 ms to minimize.
[2023-03-24 00:03:25] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2023-03-24 00:03:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-24 00:03:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:03:25] [INFO ] Added : 36 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-24 00:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:25] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:03:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:03:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2023-03-24 00:03:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-24 00:03:25] [INFO ] Added : 22 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 17 ms.
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:03:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 00:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-24 00:03:26] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2023-03-24 00:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-24 00:03:26] [INFO ] Added : 36 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 15 ms.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 00:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-24 00:03:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2023-03-24 00:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-24 00:03:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:03:26] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-24 00:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-24 00:03:26] [INFO ] Added : 36 causal constraints over 8 iterations in 144 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-24 00:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2023-03-24 00:03:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-24 00:03:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:03:26] [INFO ] Added : 36 causal constraints over 8 iterations in 124 ms. Result :sat
Minimization took 14 ms.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-24 00:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:26] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-24 00:03:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:03:26] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-24 00:03:27] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-24 00:03:27] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2023-03-24 00:03:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-24 00:03:27] [INFO ] Added : 36 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 13 ms.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-24 00:03:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:03:27] [INFO ] Added : 33 causal constraints over 7 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-24 00:03:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:03:27] [INFO ] Added : 36 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-24 00:03:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-24 00:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-24 00:03:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:03:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2023-03-24 00:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-24 00:03:27] [INFO ] Added : 33 causal constraints over 7 iterations in 148 ms. Result :sat
Minimization took 25 ms.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-24 00:03:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:27] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-24 00:03:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-24 00:03:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-24 00:03:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-24 00:03:27] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:03:27] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 00:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-24 00:03:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-24 00:03:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-24 00:03:28] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-24 00:03:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2023-03-24 00:03:28] [INFO ] Added : 36 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 12 ms.
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-24 00:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-24 00:03:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-03-24 00:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-24 00:03:28] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-24 00:03:28] [INFO ] Added : 20 causal constraints over 5 iterations in 75 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1, 3, 1, 1, -1, -1, -1, 5, -1, 10, 1, 1, 1, 2]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-24 00:03:28] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 44 ms.
[2023-03-24 00:03:28] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 689 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :15
FORMULA PolyORBNT-COL-S05J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :9
Incomplete Best-First random walk after 10000 steps, including 185 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :11
FORMULA PolyORBNT-COL-S05J20-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 151 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :9
[2023-03-24 00:03:28] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-24 00:03:28] [INFO ] Computed 62 place invariants in 26 ms
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2023-03-24 00:03:28] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-24 00:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:29] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-24 00:03:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:29] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 00:03:29] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 00:03:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:29] [INFO ] [Nat]Absence check using state equation in 560 ms returned unsat
[2023-03-24 00:03:30] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-24 00:03:30] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-24 00:03:30] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-24 00:03:30] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 00:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:30] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-24 00:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 00:03:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-24 00:03:30] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-24 00:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 00:03:31] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2023-03-24 00:03:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 00:03:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-24 00:03:31] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 44 ms.
[2023-03-24 00:03:31] [INFO ] Added : 6 causal constraints over 2 iterations in 141 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 4, 1, 1] Max seen :[1, 1, 1, 1, 4, 1, 0]
FORMULA PolyORBNT-COL-S05J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7767 ms.
ITS solved all properties within timeout

BK_STOP 1679616212931

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is PolyORBNT-COL-S05J20, 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 r298-tall-167873952000637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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