Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716658642050

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-25 17:37:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 17:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:37:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 17:37:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 17:37:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 602 ms
[2024-05-25 17:37:23] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-25 17:37:23] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 17:37:23] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 17:37:24] [INFO ] Computed 5 invariants in 25 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 23, 0, 0, 0, 0, 0, 0, 23, 1, 0, 0, 0, 0, 0, 0] Max Struct:[23, 23, 1, 13, 529, 1, 23, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-08 23 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-01 23 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-25 17:37:24] [INFO ] Invariant cache hit.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 17:37:24] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:37:24] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:24] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:37:24] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 17:37:24] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-25 17:37:24] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:37:24] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 17:37:24] [INFO ] Added : 7 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 17:37:24] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:37:24] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:24] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 17:37:25] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:37:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 17:37:25] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 17:37:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:25] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:25] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 17:37:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 17:37:25] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:25] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 17:37:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:25] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 17:37:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 17:37:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 17:37:25] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 17:37:25] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-25 17:37:25] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 28 ms.
[2024-05-25 17:37:25] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
// Phase 1: matrix 356 rows 1966 cols
[2024-05-25 17:37:25] [INFO ] Computed 1611 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
RANDOM walk for 10000 steps (370 resets) in 255 ms. (39 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (183 resets) in 287 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 23, 23, 0] Max Struct:[13, 529, 1, 23, 1, +inf, +inf, +inf, +inf]
[2024-05-25 17:37:26] [INFO ] Invariant cache hit.
[2024-05-25 17:37:26] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2024-05-25 17:37:26] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 277 ms returned sat
[2024-05-25 17:37:27] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2024-05-25 17:37:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 18 ms returned sat
[2024-05-25 17:37:27] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 249 ms returned sat
[2024-05-25 17:37:28] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2024-05-25 17:37:28] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2024-05-25 17:37:29] [INFO ] Added : 105 causal constraints over 21 iterations in 1147 ms. Result :sat
Minimization took 513 ms.
[2024-05-25 17:37:30] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2024-05-25 17:37:30] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 271 ms returned sat
[2024-05-25 17:37:33] [INFO ] [Real]Absence check using state equation in 2905 ms returned sat
[2024-05-25 17:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 20 ms returned sat
[2024-05-25 17:37:34] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 264 ms returned sat
[2024-05-25 17:37:35] [INFO ] [Nat]Absence check using state equation in 1809 ms returned sat
[2024-05-25 17:37:36] [INFO ] Deduced a trap composed of 6 places in 967 ms of which 89 ms to minimize.
[2024-05-25 17:37:37] [INFO ] Deduced a trap composed of 6 places in 870 ms of which 12 ms to minimize.
[2024-05-25 17:37:38] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-25 17:37:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2333 ms
[2024-05-25 17:37:38] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-25 17:37:38] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-05-25 17:37:39] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 259 ms returned sat
[2024-05-25 17:37:39] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-25 17:37:39] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2024-05-25 17:37:40] [INFO ] Added : 55 causal constraints over 11 iterations in 655 ms. Result :sat
Minimization took 691 ms.
[2024-05-25 17:37:41] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-05-25 17:37:41] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 240 ms returned sat
[2024-05-25 17:37:43] [INFO ] [Real]Absence check using state equation in 1587 ms returned sat
[2024-05-25 17:37:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-05-25 17:37:43] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 255 ms returned sat
[2024-05-25 17:37:44] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2024-05-25 17:37:44] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 23 ms.
[2024-05-25 17:37:45] [INFO ] Added : 95 causal constraints over 19 iterations in 988 ms. Result :sat
Minimization took 502 ms.
[2024-05-25 17:37:46] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-05-25 17:37:46] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 266 ms returned sat
[2024-05-25 17:37:47] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-05-25 17:37:47] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2024-05-25 17:37:48] [INFO ] Added : 50 causal constraints over 10 iterations in 613 ms. Result :sat
Minimization took 667 ms.
[2024-05-25 17:37:48] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-05-25 17:37:49] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 270 ms returned sat
[2024-05-25 17:37:49] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2024-05-25 17:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 18 ms returned sat
[2024-05-25 17:37:50] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 255 ms returned sat
[2024-05-25 17:37:51] [INFO ] [Nat]Absence check using state equation in 1278 ms returned sat
[2024-05-25 17:37:51] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 30 ms.
[2024-05-25 17:37:52] [INFO ] Added : 93 causal constraints over 19 iterations in 971 ms. Result :sat
Minimization took 586 ms.
[2024-05-25 17:37:53] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned sat
[2024-05-25 17:37:53] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 242 ms returned sat
[2024-05-25 17:37:54] [INFO ] [Real]Absence check using state equation in 449 ms returned unsat
[2024-05-25 17:37:54] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2024-05-25 17:37:54] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 250 ms returned sat
[2024-05-25 17:37:55] [INFO ] [Real]Absence check using state equation in 752 ms returned unsat
[2024-05-25 17:37:55] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2024-05-25 17:37:55] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 248 ms returned sat
[2024-05-25 17:37:56] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2024-05-25 17:37:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:37:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-05-25 17:37:56] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 262 ms returned sat
[2024-05-25 17:37:57] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-25 17:37:57] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 28 ms.
[2024-05-25 17:37:57] [INFO ] Added : 48 causal constraints over 10 iterations in 573 ms. Result :sat
Minimization took 582 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 23, 23, 0] Max Struct:[13, 529, 1, 23, 1, +inf, 23, 23, +inf]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-13 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-11 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[13, 529, 1, 23, 1, +inf, +inf]
Support contains 1107 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1917 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.13 ms
Discarding 49 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 165 rules applied. Total rules applied 166 place count 1871 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 1870 transition count 237
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 167 place count 1870 transition count 214
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 258 place count 1802 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 258 place count 1802 transition count 213
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 261 place count 1800 transition count 213
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 329 place count 1755 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 330 place count 1754 transition count 189
Applied a total of 330 rules in 295 ms. Remains 1754 /1966 variables (removed 212) and now considering 189/356 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 1754/1966 places, 189/356 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 189 rows 1754 cols
[2024-05-25 17:37:59] [INFO ] Computed 1565 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[13, 529, 1, 23, 1, +inf, +inf]
RANDOM walk for 770370 steps (9200 resets) in 30001 ms. (25 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-04 529 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-03 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1783630 steps (1543 resets) in 15003 ms. (118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 529, 23] Max Struct:[23, +inf, +inf]
[2024-05-25 17:38:44] [INFO ] Invariant cache hit.
[2024-05-25 17:38:44] [INFO ] [Real]Absence check using 0 positive and 1565 generalized place invariants in 315 ms returned sat
[2024-05-25 17:38:45] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2024-05-25 17:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 17:38:45] [INFO ] [Nat]Absence check using 0 positive and 1565 generalized place invariants in 288 ms returned sat
[2024-05-25 17:38:47] [INFO ] [Nat]Absence check using state equation in 1573 ms returned sat
[2024-05-25 17:38:47] [INFO ] Computed and/alt/rep : 96/97/96 causal constraints (skipped 70 transitions) in 18 ms.
[2024-05-25 17:38:47] [INFO ] Added : 38 causal constraints over 8 iterations in 400 ms. Result :sat
Minimization took 699 ms.
[2024-05-25 17:38:49] [INFO ] [Real]Absence check using 0 positive and 1565 generalized place invariants in 516 ms returned sat
[2024-05-25 17:38:50] [INFO ] [Real]Absence check using state equation in 1252 ms returned unsat
[2024-05-25 17:38:50] [INFO ] [Real]Absence check using 0 positive and 1565 generalized place invariants in 297 ms returned sat
[2024-05-25 17:38:51] [INFO ] [Real]Absence check using state equation in 358 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[18, 529, 23] Max Struct:[23, 529, 23]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-15 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-10 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[23] Max Struct:[23]
Support contains 23 out of 1754 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1754/1754 places, 189/189 transitions.
Graph (complete) has 14977 edges and 1754 vertex of which 1199 are kept as prefixes of interest. Removing 555 places using SCC suffix rule.2 ms
Discarding 555 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 1199 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 1198 transition count 139
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 27 place count 1198 transition count 116
Deduced a syphon composed of 23 places in 4 ms
Ensure Unique test removed 23 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 96 place count 1152 transition count 116
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 506 places
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 2 with 552 rules applied. Total rules applied 648 place count 623 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 622 transition count 92
Ensure Unique test removed 23 places
Iterating post reduction 2 with 23 rules applied. Total rules applied 672 place count 599 transition count 92
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 695 place count 576 transition count 69
Ensure Unique test removed 529 places
Iterating post reduction 3 with 529 rules applied. Total rules applied 1224 place count 47 transition count 69
Applied a total of 1224 rules in 137 ms. Remains 47 /1754 variables (removed 1707) and now considering 69/189 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 47/1754 places, 69/189 transitions.
// Phase 1: matrix 69 rows 47 cols
[2024-05-25 17:38:51] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[23] Max Struct:[23]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (21276 resets) in 1431 ms. (698 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-25 17:38:53] [INFO ] Flatten gal took : 18 ms
[2024-05-25 17:38:53] [INFO ] Flatten gal took : 8 ms
[2024-05-25 17:38:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9850728951218919168.gal : 11 ms
[2024-05-25 17:38:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15028817393666680042.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9850728951218919168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15028817393666680042.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 89987 ms.

BK_STOP 1716658733260

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-22"
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-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-COL-22, 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 r312-tall-171662337700037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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