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

About the Execution of Marcie+red for QuasiCertifProtocol-PT-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
724.964 163369.00 179632.00 651.60 1 29 29 29 29 29 29 29 1 1 16 1 1 16 1 16 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.r298-tall-167873952400901.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952400901
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 749K 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-PT-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679691098941

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 20:51:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 20:51:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 20:51:40] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-24 20:51:40] [INFO ] Transformed 2998 places.
[2023-03-24 20:51:40] [INFO ] Transformed 446 transitions.
[2023-03-24 20:51:40] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-24 20:51:40] [INFO ] Computed 2553 place invariants in 150 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 303 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 15) seen :90
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :72
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 :72
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :88
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :72
[2023-03-24 20:51:41] [INFO ] Invariant cache hit.
[2023-03-24 20:51:41] [INFO ] [Real]Absence check using 32 positive place invariants in 36 ms returned unsat
[2023-03-24 20:51:42] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2023-03-24 20:51:42] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 495 ms returned sat
[2023-03-24 20:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:51:43] [INFO ] [Real]Absence check using state equation in 1191 ms returned sat
[2023-03-24 20:51:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:51:44] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-24 20:51:44] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 532 ms returned sat
[2023-03-24 20:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:51:45] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2023-03-24 20:51:46] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2023-03-24 20:51:47] [INFO ] Added : 119 causal constraints over 24 iterations in 1838 ms. Result :sat
Minimization took 448 ms.
[2023-03-24 20:51:48] [INFO ] [Real]Absence check using 32 positive place invariants in 71 ms returned sat
[2023-03-24 20:51:49] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 515 ms returned sat
[2023-03-24 20:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:51:53] [INFO ] [Real]Absence check using state equation in 3879 ms returned sat
[2023-03-24 20:51:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:51:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 53 ms returned sat
[2023-03-24 20:51:53] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 491 ms returned sat
[2023-03-24 20:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:51:58] [INFO ] [Nat]Absence check using state equation in 4223 ms returned unknown
[2023-03-24 20:51:58] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2023-03-24 20:51:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 530 ms returned sat
[2023-03-24 20:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:51:59] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2023-03-24 20:52:00] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2023-03-24 20:52:02] [INFO ] Added : 135 causal constraints over 27 iterations in 2180 ms. Result :sat
Minimization took 247 ms.
[2023-03-24 20:52:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:52:02] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-24 20:52:03] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 530 ms returned sat
[2023-03-24 20:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:04] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2023-03-24 20:52:04] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2023-03-24 20:52:06] [INFO ] Added : 135 causal constraints over 27 iterations in 1903 ms. Result :sat
Minimization took 734 ms.
[2023-03-24 20:52:07] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2023-03-24 20:52:08] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 492 ms returned sat
[2023-03-24 20:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:09] [INFO ] [Real]Absence check using state equation in 1593 ms returned sat
[2023-03-24 20:52:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:52:09] [INFO ] [Nat]Absence check using 32 positive place invariants in 52 ms returned sat
[2023-03-24 20:52:10] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 489 ms returned sat
[2023-03-24 20:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:13] [INFO ] [Nat]Absence check using state equation in 2736 ms returned sat
[2023-03-24 20:52:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2023-03-24 20:52:14] [INFO ] Added : 73 causal constraints over 15 iterations in 1158 ms. Result :sat
Minimization took 253 ms.
[2023-03-24 20:52:14] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2023-03-24 20:52:15] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 526 ms returned sat
[2023-03-24 20:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:19] [INFO ] [Real]Absence check using state equation in 3782 ms returned unsat
[2023-03-24 20:52:19] [INFO ] [Real]Absence check using 32 positive place invariants in 31 ms returned unsat
[2023-03-24 20:52:19] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2023-03-24 20:52:20] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 508 ms returned sat
[2023-03-24 20:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:21] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2023-03-24 20:52:21] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 34 ms.
[2023-03-24 20:52:23] [INFO ] Added : 135 causal constraints over 27 iterations in 2191 ms. Result :sat
Minimization took 239 ms.
[2023-03-24 20:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:52:24] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-24 20:52:24] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 507 ms returned sat
[2023-03-24 20:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:25] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2023-03-24 20:52:25] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2023-03-24 20:52:27] [INFO ] Added : 135 causal constraints over 27 iterations in 1914 ms. Result :sat
Minimization took 203 ms.
[2023-03-24 20:52:28] [INFO ] [Real]Absence check using 32 positive place invariants in 46 ms returned sat
[2023-03-24 20:52:28] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 510 ms returned sat
[2023-03-24 20:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:30] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2023-03-24 20:52:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:52:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-24 20:52:31] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 527 ms returned sat
[2023-03-24 20:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:32] [INFO ] [Nat]Absence check using state equation in 1420 ms returned sat
[2023-03-24 20:52:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2023-03-24 20:52:33] [INFO ] Added : 59 causal constraints over 12 iterations in 926 ms. Result :sat
Minimization took 207 ms.
[2023-03-24 20:52:34] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2023-03-24 20:52:34] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 512 ms returned sat
[2023-03-24 20:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:35] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2023-03-24 20:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:52:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 47 ms returned sat
[2023-03-24 20:52:36] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 509 ms returned sat
[2023-03-24 20:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:37] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2023-03-24 20:52:37] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2023-03-24 20:52:39] [INFO ] Added : 135 causal constraints over 27 iterations in 1920 ms. Result :sat
Minimization took 208 ms.
[2023-03-24 20:52:39] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2023-03-24 20:52:40] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 484 ms returned sat
[2023-03-24 20:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:41] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2023-03-24 20:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:52:41] [INFO ] [Nat]Absence check using 32 positive place invariants in 48 ms returned sat
[2023-03-24 20:52:42] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 525 ms returned sat
[2023-03-24 20:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:43] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2023-03-24 20:52:43] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 44 ms.
[2023-03-24 20:52:45] [INFO ] Added : 135 causal constraints over 27 iterations in 1929 ms. Result :sat
Minimization took 424 ms.
[2023-03-24 20:52:45] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2023-03-24 20:52:46] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 524 ms returned sat
[2023-03-24 20:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:52:49] [INFO ] [Real]Absence check using state equation in 2730 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 841, 841, -1, -1, 29, 29, -1, 1, 1, 16, 1] Max seen :[29, 0, 0, 0, 0, 29, 29, 0, 0, 0, 0, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 116 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.15 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 150 rules applied. Total rules applied 151 place count 2877 transition count 323
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 30 rules applied. Total rules applied 181 place count 2876 transition count 294
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 210 place count 2847 transition count 294
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 210 place count 2847 transition count 264
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 57 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 327 place count 2760 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 327 place count 2760 transition count 263
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 330 place count 2758 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 2757 transition count 262
Applied a total of 331 rules in 579 ms. Remains 2757 /2998 variables (removed 241) and now considering 262/446 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 579 ms. Remains : 2757/2998 places, 262/446 transitions.
// Phase 1: matrix 262 rows 2757 cols
[2023-03-24 20:52:50] [INFO ] Computed 2495 place invariants in 46 ms
Incomplete random walk after 1000000 steps, including 13698 resets, run finished after 6937 ms. (steps per millisecond=144 ) properties (out of 5) seen :64
Incomplete Best-First random walk after 1000001 steps, including 826 resets, run finished after 2147 ms. (steps per millisecond=465 ) properties (out of 5) seen :64
Incomplete Best-First random walk after 1000001 steps, including 399 resets, run finished after 2870 ms. (steps per millisecond=348 ) properties (out of 5) seen :71
Incomplete Best-First random walk after 1000001 steps, including 799 resets, run finished after 2148 ms. (steps per millisecond=465 ) properties (out of 5) seen :64
Incomplete Best-First random walk after 1000001 steps, including 823 resets, run finished after 2117 ms. (steps per millisecond=472 ) properties (out of 5) seen :62
Incomplete Best-First random walk after 1000001 steps, including 798 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 5) seen :62
[2023-03-24 20:53:08] [INFO ] Invariant cache hit.
[2023-03-24 20:53:09] [INFO ] [Real]Absence check using 0 positive and 2495 generalized place invariants in 516 ms returned sat
[2023-03-24 20:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:53:14] [INFO ] [Real]Absence check using state equation in 4978 ms returned sat
[2023-03-24 20:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:53:15] [INFO ] [Nat]Absence check using 0 positive and 2495 generalized place invariants in 514 ms returned sat
[2023-03-24 20:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:53:24] [INFO ] [Nat]Absence check using state equation in 9029 ms returned sat
[2023-03-24 20:53:24] [INFO ] Computed and/alt/rep : 145/174/145 causal constraints (skipped 88 transitions) in 22 ms.
[2023-03-24 20:53:25] [INFO ] Added : 58 causal constraints over 12 iterations in 831 ms. Result :sat
Minimization took 3056 ms.
[2023-03-24 20:53:29] [INFO ] [Real]Absence check using 0 positive and 2495 generalized place invariants in 511 ms returned sat
[2023-03-24 20:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:53:36] [INFO ] [Real]Absence check using state equation in 7140 ms returned sat
[2023-03-24 20:53:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 20:53:37] [INFO ] [Nat]Absence check using 0 positive and 2495 generalized place invariants in 505 ms returned sat
[2023-03-24 20:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 20:53:46] [INFO ] [Nat]Absence check using state equation in 9757 ms returned sat
[2023-03-24 20:53:46] [INFO ] Computed and/alt/rep : 145/174/145 causal constraints (skipped 88 transitions) in 25 ms.
[2023-03-24 20:53:47] [INFO ] Added : 4 causal constraints over 1 iterations in 186 ms. Result :sat
Minimization took 1133 ms.
[2023-03-24 20:53:48] [INFO ] [Real]Absence check using 0 positive and 2495 generalized place invariants in 519 ms returned sat
[2023-03-24 20:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:54:00] [INFO ] [Real]Absence check using state equation in 11435 ms returned unsat
[2023-03-24 20:54:01] [INFO ] [Real]Absence check using 0 positive and 2495 generalized place invariants in 587 ms returned sat
[2023-03-24 20:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:54:02] [INFO ] [Real]Absence check using state equation in 1691 ms returned unsat
[2023-03-24 20:54:03] [INFO ] [Real]Absence check using 0 positive and 2495 generalized place invariants in 509 ms returned sat
[2023-03-24 20:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:54:04] [INFO ] [Real]Absence check using state equation in 856 ms returned unsat
Current structural bounds on expressions (after SMT) : [841, 841, 29, 29, 1] Max seen :[29, 29, 29, 29, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 58 out of 2757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2757/2757 places, 262/262 transitions.
Graph (complete) has 53186 edges and 2757 vertex of which 1887 are kept as prefixes of interest. Removing 870 places using SCC suffix rule.4 ms
Discarding 870 places :
Also discarding 29 output transitions
Drop transitions removed 29 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 1887 transition count 204
Applied a total of 30 rules in 253 ms. Remains 1887 /2757 variables (removed 870) and now considering 204/262 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 1887/2757 places, 204/262 transitions.
// Phase 1: matrix 204 rows 1887 cols
[2023-03-24 20:54:04] [INFO ] Computed 1683 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 13698 resets, run finished after 5412 ms. (steps per millisecond=184 ) properties (out of 2) seen :35
Incomplete Best-First random walk after 1000001 steps, including 825 resets, run finished after 2049 ms. (steps per millisecond=488 ) properties (out of 2) seen :34
Incomplete Best-First random walk after 1000001 steps, including 398 resets, run finished after 2798 ms. (steps per millisecond=357 ) properties (out of 2) seen :42
[2023-03-24 20:54:15] [INFO ] Invariant cache hit.
[2023-03-24 20:54:15] [INFO ] [Real]Absence check using 0 positive and 1683 generalized place invariants in 336 ms returned sat
[2023-03-24 20:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:54:16] [INFO ] [Real]Absence check using state equation in 1113 ms returned unsat
[2023-03-24 20:54:17] [INFO ] [Real]Absence check using 0 positive and 1683 generalized place invariants in 327 ms returned sat
[2023-03-24 20:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 20:54:21] [INFO ] [Real]Absence check using state equation in 4121 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 29] Max seen :[29, 29]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 160915 ms.
ITS solved all properties within timeout

BK_STOP 1679691262310

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is QuasiCertifProtocol-PT-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873952400901"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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