fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r319-tall-167873970000107
Last Updated
May 14, 2023

About the Execution of 2022-gold for QuasiCertifProtocol-COL-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2273.176 131856.00 180161.00 2197.60 1 33 19 19 33 1 1 33 33 33 33 19 1 33 33 33 normal

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.r319-tall-167873970000107.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 gold2022
Input is QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873970000107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K 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 QuasiCertifProtocol-COL-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678881788543

Running Version 202205111006
[2023-03-15 12:03:10] [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]
[2023-03-15 12:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:03:10] [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-15 12:03:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 12:03:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 912 ms
[2023-03-15 12:03:11] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-15 12:03:11] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2023-03-15 12:03:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 12:03:11] [INFO ] Computed 5 place invariants in 7 ms
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 26 rows 30 cols
[2023-03-15 12:03:11] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-15 12:03:11] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-15 12:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:12] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-15 12:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 12:03:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 12:03:12] [INFO ] Added : 6 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 26 ms.
[2023-03-15 12:03:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:12] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-15 12:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 12:03:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:03:12] [INFO ] Added : 13 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 12:03:12] [INFO ] [Real]Absence check using 5 positive place invariants in 34 ms returned sat
[2023-03-15 12:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:12] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2023-03-15 12:03:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-15 12:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:12] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-15 12:03:12] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 12:03:12] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 12:03:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 12:03:13] [INFO ] Added : 10 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 7 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:03:13] [INFO ] Added : 12 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:03:13] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 12:03:13] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:03:13] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 12:03:13] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 12:03:13] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:03:13] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 12:03:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-15 12:03:13] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 12:03:13] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2023-03-15 12:03:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-15 12:03:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 12:03:14] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 12:03:14] [INFO ] Added : 13 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 12:03:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 12:03:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 12:03:14] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 12:03:14] [INFO ] Added : 9 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-15 12:03:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-15 12:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 12:03:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-15 12:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 12:03:14] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 12:03:14] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 19, 33, 1, 1, -1, 33, 33, -1, 19, 33, 33, -1]
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-15 12:03:14] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 50 ms.
[2023-03-15 12:03:14] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 14) seen :67
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :47
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :66
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :33
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :33
// Phase 1: matrix 506 rows 3806 cols
[2023-03-15 12:03:15] [INFO ] Computed 3301 place invariants in 184 ms
[2023-03-15 12:03:15] [INFO ] [Real]Absence check using 37 positive place invariants in 153 ms returned sat
[2023-03-15 12:03:16] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 711 ms returned sat
[2023-03-15 12:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:20] [INFO ] [Real]Absence check using state equation in 3510 ms returned unknown
[2023-03-15 12:03:20] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2023-03-15 12:03:21] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 730 ms returned sat
[2023-03-15 12:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:23] [INFO ] [Real]Absence check using state equation in 1686 ms returned sat
[2023-03-15 12:03:23] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 73 ms.
[2023-03-15 12:03:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:03:25] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2023-03-15 12:03:26] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 876 ms returned sat
[2023-03-15 12:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:30] [INFO ] [Real]Absence check using state equation in 3384 ms returned unknown
[2023-03-15 12:03:30] [INFO ] [Real]Absence check using 37 positive place invariants in 116 ms returned sat
[2023-03-15 12:03:31] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1112 ms returned sat
[2023-03-15 12:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:34] [INFO ] [Real]Absence check using state equation in 2992 ms returned sat
[2023-03-15 12:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 69 ms returned sat
[2023-03-15 12:03:36] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 728 ms returned sat
[2023-03-15 12:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:38] [INFO ] [Nat]Absence check using state equation in 2302 ms returned sat
[2023-03-15 12:03:38] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 49 ms.
[2023-03-15 12:03:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:03:40] [INFO ] [Real]Absence check using 37 positive place invariants in 95 ms returned sat
[2023-03-15 12:03:42] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1581 ms returned sat
[2023-03-15 12:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:45] [INFO ] [Real]Absence check using state equation in 2682 ms returned unknown
[2023-03-15 12:03:45] [INFO ] [Real]Absence check using 37 positive place invariants in 63 ms returned sat
[2023-03-15 12:03:46] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 819 ms returned sat
[2023-03-15 12:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:49] [INFO ] [Real]Absence check using state equation in 3125 ms returned sat
[2023-03-15 12:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:03:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 71 ms returned sat
[2023-03-15 12:03:50] [INFO ] [Nat]Absence check using 37 positive and 3264 generalized place invariants in 788 ms returned sat
[2023-03-15 12:03:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:03:53] [INFO ] [Nat]Absence check using state equation in 2520 ms returned sat
[2023-03-15 12:03:53] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 115 ms.
[2023-03-15 12:03:59] [INFO ] Deduced a trap composed of 6 places in 5196 ms of which 24 ms to minimize.
[2023-03-15 12:03:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:04:01] [INFO ] [Real]Absence check using 37 positive place invariants in 94 ms returned sat
[2023-03-15 12:04:02] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1605 ms returned sat
[2023-03-15 12:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:04] [INFO ] [Real]Absence check using state equation in 2212 ms returned unknown
[2023-03-15 12:04:05] [INFO ] [Real]Absence check using 37 positive place invariants in 96 ms returned sat
[2023-03-15 12:04:07] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1367 ms returned sat
[2023-03-15 12:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:04:10] [INFO ] [Real]Absence check using 37 positive place invariants in 107 ms returned sat
[2023-03-15 12:04:12] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1408 ms returned sat
[2023-03-15 12:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:14] [INFO ] [Real]Absence check using state equation in 2735 ms returned sat
[2023-03-15 12:04:14] [WARNING] SMT solver failed with error :java.lang.StringIndexOutOfBoundsException: String index out of range: 4106 while checking expression at index 8
java.lang.StringIndexOutOfBoundsException: String index out of range: 4106
at java.base/java.lang.StringLatin1.charAt(StringLatin1.java:47)
at java.base/java.lang.String.charAt(String.java:693)
at org.smtlib.impl.Pos$Source.charAt(Pos.java:116)
at org.smtlib.impl.Pos$Source.nextLineTermination(Pos.java:147)
at org.smtlib.impl.Pos$Source.textLine(Pos.java:134)
at org.smtlib.Log.locationIndication(Log.java:213)
at org.smtlib.Log$StandardListener.logError(Log.java:97)
at org.smtlib.Log.logError(Log.java:148)
at org.smtlib.sexpr.Lexer.getToken(Lexer.java:502)
at org.smtlib.sexpr.Lexer.getToken(Lexer.java:364)
at org.smtlib.sexpr.Parser.parseSeq(Parser.java:317)
at org.smtlib.sexpr.Parser.parseSeq(Parser.java:324)
at org.smtlib.sexpr.Parser.parseSexpr(Parser.java:298)
at org.smtlib.sexpr.Parser.parseResponse(Parser.java:959)
at org.smtlib.solvers.Solver_z3_4_3.parseResponse(Solver_z3_4_3.java:234)
at org.smtlib.solvers.Solver_z3_4_3.get_model(Solver_z3_4_3.java:643)
at org.smtlib.ext.C_get_model.execute(C_get_model.java:42)
at fr.lip6.move.gal.structural.smt.DeadlockTester.queryVariables(DeadlockTester.java:1336)
at fr.lip6.move.gal.structural.smt.DeadlockTester.realityCheck(DeadlockTester.java:985)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:905)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 12:04:15] [INFO ] [Real]Absence check using 37 positive place invariants in 98 ms returned sat
[2023-03-15 12:04:17] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1235 ms returned sat
[2023-03-15 12:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:19] [INFO ] [Real]Absence check using state equation in 2949 ms returned unknown
[2023-03-15 12:04:20] [INFO ] [Real]Absence check using 37 positive place invariants in 96 ms returned sat
[2023-03-15 12:04:22] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1429 ms returned sat
[2023-03-15 12:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:25] [INFO ] [Real]Absence check using state equation in 2764 ms returned unknown
[2023-03-15 12:04:25] [INFO ] [Real]Absence check using 37 positive place invariants in 96 ms returned sat
[2023-03-15 12:04:27] [INFO ] [Real]Absence check using 37 positive and 3264 generalized place invariants in 1469 ms returned sat
[2023-03-15 12:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:04:30] [INFO ] [Real]Absence check using state equation in 2820 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 2147483647, 33, 1, 1, 2147483647, 33, 2147483647, 19, 33, 33, 2147483647] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33]
Support contains 268 out of 3806 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3804 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.39 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 201 rules applied. Total rules applied 202 place count 3738 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 202 place count 3738 transition count 370
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 204 place count 3737 transition count 370
Applied a total of 204 rules in 1355 ms. Remains 3737 /3806 variables (removed 69) and now considering 370/506 (removed 136) transitions.
Finished structural reductions, in 1 iterations. Remains : 3737/3806 places, 370/506 transitions.
// Phase 1: matrix 370 rows 3737 cols
[2023-03-15 12:04:31] [INFO ] Computed 3367 place invariants in 184 ms
Incomplete random walk after 1000000 steps, including 9232 resets, run finished after 11604 ms. (steps per millisecond=86 ) properties (out of 12) seen :170
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 369 resets, run finished after 3163 ms. (steps per millisecond=316 ) properties (out of 9) seen :180
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 436744 steps, including 95 resets, run visited all 8 properties in 5001 ms. (steps per millisecond=87 )
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 19 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 427 resets, run finished after 3349 ms. (steps per millisecond=298 ) properties (out of 5) seen :132
Incomplete Best-First random walk after 1000001 steps, including 454 resets, run finished after 3272 ms. (steps per millisecond=305 ) properties (out of 5) seen :132
Incomplete Best-First random walk after 1000001 steps, including 438 resets, run finished after 3368 ms. (steps per millisecond=296 ) properties (out of 5) seen :132
// Phase 1: matrix 370 rows 3737 cols
[2023-03-15 12:05:01] [INFO ] Computed 3367 place invariants in 66 ms
[2023-03-15 12:05:02] [INFO ] [Real]Absence check using 1090 positive place invariants in 426 ms returned sat
[2023-03-15 12:05:03] [INFO ] [Real]Absence check using 1090 positive and 2277 generalized place invariants in 855 ms returned sat
[2023-03-15 12:05:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:05] [INFO ] [Real]Absence check using state equation in 2230 ms returned unsat
[2023-03-15 12:05:06] [INFO ] [Real]Absence check using 1090 positive place invariants in 354 ms returned sat
[2023-03-15 12:05:07] [INFO ] [Real]Absence check using 1090 positive and 2277 generalized place invariants in 512 ms returned sat
[2023-03-15 12:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:08] [INFO ] [Real]Absence check using state equation in 1207 ms returned unsat
[2023-03-15 12:05:09] [INFO ] [Real]Absence check using 1090 positive place invariants in 251 ms returned sat
[2023-03-15 12:05:10] [INFO ] [Real]Absence check using 1090 positive and 2277 generalized place invariants in 695 ms returned sat
[2023-03-15 12:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:11] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2023-03-15 12:05:11] [INFO ] Computed and/alt/rep : 267/267/267 causal constraints (skipped 102 transitions) in 70 ms.
[2023-03-15 12:05:14] [INFO ] Added : 166 causal constraints over 34 iterations in 3352 ms. Result :sat
Minimization took 241 ms.
[2023-03-15 12:05:15] [INFO ] [Real]Absence check using 1090 positive place invariants in 248 ms returned sat
[2023-03-15 12:05:16] [INFO ] [Real]Absence check using 1090 positive and 2277 generalized place invariants in 485 ms returned sat
[2023-03-15 12:05:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:17] [INFO ] [Real]Absence check using state equation in 1113 ms returned unsat
[2023-03-15 12:05:18] [INFO ] [Real]Absence check using 1090 positive place invariants in 265 ms returned sat
[2023-03-15 12:05:18] [INFO ] [Real]Absence check using 1090 positive and 2277 generalized place invariants in 537 ms returned sat
[2023-03-15 12:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:19] [INFO ] [Real]Absence check using state equation in 1137 ms returned unsat
Current structural bounds on expressions (after SMT) : [33, 33, 33, 33, 33] Max seen :[33, 33, 14, 33, 33]
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 129712 ms.

BK_STOP 1678881920399

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is QuasiCertifProtocol-COL-32, 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 r319-tall-167873970000107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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