fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r311-tall-171662335900101
Last Updated
July 7, 2024

About the Execution of GreatSPN+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
962.487 331749.00 357449.00 830.10 29 16 841 29 29 1 1 29 1 1 1 1 1 1 1 1 normal

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.r311-tall-171662335900101.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 greatspnxred
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 r311-tall-171662335900101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 107K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 666K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 13 03:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 76K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 121K Apr 13 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 795K Apr 13 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 749K 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-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 1716661724170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 18:28:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 18:28:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:28:45] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-25 18:28:45] [INFO ] Transformed 2998 places.
[2024-05-25 18:28:45] [INFO ] Transformed 446 transitions.
[2024-05-25 18:28:45] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 16, 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, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 16, 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, +inf]
// Phase 1: matrix 446 rows 2998 cols
[2024-05-25 18:28:45] [INFO ] Computed 2553 invariants in 175 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, 16, +inf, 841, 841, 1, 1, +inf, 29, 29, +inf, +inf, 29, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (303 resets) in 216 ms. (46 steps per ms)
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (177 resets) in 401 ms. (298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, 29, +inf, +inf, 29, +inf]
[2024-05-25 18:28:46] [INFO ] Invariant cache hit.
[2024-05-25 18:28:47] [INFO ] [Real]Absence check using 32 positive place invariants in 74 ms returned sat
[2024-05-25 18:28:47] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 557 ms returned sat
[2024-05-25 18:28:51] [INFO ] [Real]Absence check using state equation in 3847 ms returned unknown
[2024-05-25 18:28:52] [INFO ] [Real]Absence check using 32 positive place invariants in 76 ms returned sat
[2024-05-25 18:28:52] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 539 ms returned sat
[2024-05-25 18:28:54] [INFO ] [Real]Absence check using state equation in 1418 ms returned sat
[2024-05-25 18:28:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:28:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 63 ms returned sat
[2024-05-25 18:28:55] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 499 ms returned sat
[2024-05-25 18:28:56] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2024-05-25 18:28:56] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2024-05-25 18:28:57] [INFO ] Added : 68 causal constraints over 14 iterations in 1189 ms. Result :sat
Minimization took 562 ms.
[2024-05-25 18:28:58] [INFO ] [Real]Absence check using 32 positive place invariants in 59 ms returned sat
[2024-05-25 18:28:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 502 ms returned sat
[2024-05-25 18:29:01] [INFO ] [Real]Absence check using state equation in 2565 ms returned sat
[2024-05-25 18:29:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:29:02] [INFO ] [Nat]Absence check using 32 positive place invariants in 73 ms returned sat
[2024-05-25 18:29:02] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 464 ms returned sat
[2024-05-25 18:29:04] [INFO ] [Nat]Absence check using state equation in 2266 ms returned unknown
[2024-05-25 18:29:05] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-05-25 18:29:05] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2024-05-25 18:29:07] [INFO ] [Real]Absence check using state equation in 1348 ms returned sat
[2024-05-25 18:29:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:29:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-05-25 18:29:08] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 478 ms returned sat
[2024-05-25 18:29:09] [INFO ] [Nat]Absence check using state equation in 1601 ms returned sat
[2024-05-25 18:29:09] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 54 ms.
[2024-05-25 18:29:11] [INFO ] Added : 80 causal constraints over 16 iterations in 1348 ms. Result :sat
Minimization took 555 ms.
[2024-05-25 18:29:11] [INFO ] [Real]Absence check using 32 positive place invariants in 60 ms returned sat
[2024-05-25 18:29:12] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 477 ms returned sat
[2024-05-25 18:29:13] [INFO ] [Real]Absence check using state equation in 1343 ms returned sat
[2024-05-25 18:29:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2024-05-25 18:29:14] [INFO ] Added : 59 causal constraints over 12 iterations in 982 ms. Result :sat
Minimization took 554 ms.
[2024-05-25 18:29:15] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-05-25 18:29:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 496 ms returned sat
[2024-05-25 18:29:17] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2024-05-25 18:29:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:29:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 57 ms returned sat
[2024-05-25 18:29:18] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 524 ms returned sat
[2024-05-25 18:29:21] [INFO ] [Nat]Absence check using state equation in 2418 ms returned sat
[2024-05-25 18:29:21] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2024-05-25 18:29:22] [INFO ] Added : 61 causal constraints over 13 iterations in 958 ms. Result :sat
Minimization took 554 ms.
[2024-05-25 18:29:23] [INFO ] [Real]Absence check using 32 positive place invariants in 59 ms returned sat
[2024-05-25 18:29:23] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 497 ms returned sat
[2024-05-25 18:29:24] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2024-05-25 18:29:24] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 41 ms.
[2024-05-25 18:29:26] [INFO ] Added : 125 causal constraints over 25 iterations in 2084 ms. Result :sat
Minimization took 574 ms.
[2024-05-25 18:29:28] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-05-25 18:29:28] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 508 ms returned sat
[2024-05-25 18:29:28] [INFO ] [Real]Absence check using state equation in 106 ms returned unsat
[2024-05-25 18:29:28] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-05-25 18:29:29] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 513 ms returned sat
[2024-05-25 18:29:30] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2024-05-25 18:29:30] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2024-05-25 18:29:31] [INFO ] Added : 41 causal constraints over 9 iterations in 773 ms. Result :sat
Minimization took 554 ms.
[2024-05-25 18:29:32] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-05-25 18:29:33] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 449 ms returned sat
[2024-05-25 18:29:34] [INFO ] [Real]Absence check using state equation in 1477 ms returned sat
[2024-05-25 18:29:34] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 29 ms.
[2024-05-25 18:29:37] [INFO ] Added : 147 causal constraints over 30 iterations in 2421 ms. Result :sat
Minimization took 151 ms.
[2024-05-25 18:29:37] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-05-25 18:29:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 486 ms returned sat
[2024-05-25 18:29:39] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2024-05-25 18:29:39] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2024-05-25 18:29:41] [INFO ] Added : 129 causal constraints over 26 iterations in 2078 ms. Result :sat
Minimization took 555 ms.
[2024-05-25 18:29:42] [INFO ] [Real]Absence check using 32 positive place invariants in 56 ms returned sat
[2024-05-25 18:29:43] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 515 ms returned sat
[2024-05-25 18:29:44] [INFO ] [Real]Absence check using state equation in 1492 ms returned sat
[2024-05-25 18:29:44] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2024-05-25 18:29:46] [INFO ] Added : 139 causal constraints over 28 iterations in 2248 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, 1, +inf, +inf, 29, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, +inf, +inf, 29, +inf]
Support contains 961 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 2095 are kept as prefixes of interest. Removing 903 places using SCC suffix rule.16 ms
Discarding 903 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Discarding 29 places :
Implicit places reduction removed 29 places
Iterating post reduction 0 with 176 rules applied. Total rules applied 177 place count 2066 transition count 269
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 177 place count 2066 transition count 239
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 57 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 1 with 117 rules applied. Total rules applied 294 place count 1979 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 294 place count 1979 transition count 238
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 1 with 3 rules applied. Total rules applied 297 place count 1977 transition count 238
Applied a total of 297 rules in 255 ms. Remains 1977 /2998 variables (removed 1021) and now considering 238/446 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 1977/2998 places, 238/446 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 238 rows 1977 cols
[2024-05-25 18:29:47] [INFO ] Computed 1739 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[841, +inf, 841, 841, 1, +inf, 29, +inf, +inf, 29, +inf]
RANDOM walk for 1000000 steps (16104 resets) in 19666 ms. (50 steps per ms)
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9363226 steps (7819 resets) in 30762 ms. (304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 696, 0, 29, 29, 0, 1, 0, 0, 0] Max Struct:[841, +inf, 841, 841, +inf, 29, +inf, +inf, 29, +inf]
[2024-05-25 18:30:38] [INFO ] Invariant cache hit.
[2024-05-25 18:30:38] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 372 ms returned sat
[2024-05-25 18:30:39] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2024-05-25 18:30:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:30:40] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 330 ms returned sat
[2024-05-25 18:30:41] [INFO ] [Nat]Absence check using state equation in 1143 ms returned sat
[2024-05-25 18:30:41] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 21 ms.
[2024-05-25 18:30:42] [INFO ] Added : 117 causal constraints over 24 iterations in 1307 ms. Result :sat
Minimization took 2686 ms.
[2024-05-25 18:30:45] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 381 ms returned sat
[2024-05-25 18:30:46] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2024-05-25 18:30:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:30:47] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 355 ms returned sat
[2024-05-25 18:30:48] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2024-05-25 18:30:48] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-25 18:30:49] [INFO ] Added : 81 causal constraints over 17 iterations in 908 ms. Result :sat
Minimization took 2595 ms.
[2024-05-25 18:30:52] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 372 ms returned sat
[2024-05-25 18:30:53] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2024-05-25 18:30:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:30:53] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 360 ms returned sat
[2024-05-25 18:30:57] [INFO ] [Nat]Absence check using state equation in 3243 ms returned sat
[2024-05-25 18:30:57] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-25 18:30:58] [INFO ] Added : 89 causal constraints over 18 iterations in 910 ms. Result :sat
Minimization took 2864 ms.
[2024-05-25 18:31:01] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 383 ms returned sat
[2024-05-25 18:31:03] [INFO ] [Real]Absence check using state equation in 1505 ms returned unsat
[2024-05-25 18:31:03] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 364 ms returned sat
[2024-05-25 18:31:04] [INFO ] [Real]Absence check using state equation in 444 ms returned unsat
[2024-05-25 18:31:04] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 364 ms returned sat
[2024-05-25 18:31:05] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-25 18:31:05] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-25 18:31:06] [INFO ] Added : 106 causal constraints over 22 iterations in 1220 ms. Result :sat
Minimization took 2621 ms.
[2024-05-25 18:31:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:31:09] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 344 ms returned sat
[2024-05-25 18:31:10] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2024-05-25 18:31:10] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 18 ms.
[2024-05-25 18:31:11] [INFO ] Added : 106 causal constraints over 22 iterations in 1037 ms. Result :sat
Minimization took 2546 ms.
[2024-05-25 18:31:14] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 369 ms returned sat
[2024-05-25 18:31:15] [INFO ] [Real]Absence check using state equation in 479 ms returned unsat
[2024-05-25 18:31:15] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 355 ms returned sat
[2024-05-25 18:31:16] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2024-05-25 18:31:16] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 18 ms.
[2024-05-25 18:31:17] [INFO ] Added : 88 causal constraints over 18 iterations in 1013 ms. Result :sat
Minimization took 2581 ms.
[2024-05-25 18:31:20] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 343 ms returned sat
[2024-05-25 18:31:20] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-25 18:31:20] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 39 ms.
[2024-05-25 18:31:22] [INFO ] Added : 106 causal constraints over 22 iterations in 1249 ms. Result :sat
Minimization took 2566 ms.
[2024-05-25 18:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:31:25] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 343 ms returned sat
[2024-05-25 18:31:25] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2024-05-25 18:31:25] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 17 ms.
[2024-05-25 18:31:27] [INFO ] Added : 106 causal constraints over 22 iterations in 1131 ms. Result :sat
Minimization took 2512 ms.
[2024-05-25 18:31:30] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 350 ms returned sat
[2024-05-25 18:31:30] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2024-05-25 18:31:30] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 38 ms.
[2024-05-25 18:31:31] [INFO ] Added : 106 causal constraints over 22 iterations in 1246 ms. Result :sat
Minimization took 2584 ms.
[2024-05-25 18:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:31:35] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 358 ms returned sat
[2024-05-25 18:31:35] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2024-05-25 18:31:35] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 23 ms.
[2024-05-25 18:31:36] [INFO ] Added : 106 causal constraints over 22 iterations in 1164 ms. Result :sat
Minimization took 2530 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 696, 0, 29, 29, 0, 1, 0, 0, 0] Max Struct:[841, +inf, 841, 29, 29, 29, 1, +inf, 29, +inf]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 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-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[841, +inf, 841, 29, +inf, 29, +inf]
Support contains 901 out of 1977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1977/1977 places, 238/238 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Discarding 29 places :
Implicit places reduction removed 29 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 60 rules applied. Total rules applied 60 place count 1948 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 1947 transition count 207
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 61 place count 1947 transition count 149
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 29 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 206 place count 1860 transition count 149
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 2 with 1 rules applied. Total rules applied 207 place count 1860 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 1859 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 1858 transition count 147
Applied a total of 209 rules in 281 ms. Remains 1858 /1977 variables (removed 119) and now considering 147/238 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 1858/1977 places, 147/238 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 147 rows 1858 cols
[2024-05-25 18:31:44] [INFO ] Computed 1711 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[841, +inf, 841, 29, +inf, 29, +inf]
RANDOM walk for 616239 steps (5222 resets) in 30001 ms. (20 steps per ms)
BEST_FIRST walk for 3199138 steps (1339 resets) in 35007 ms. (91 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[841, +inf, 841, 29, +inf, 29, +inf]
[2024-05-25 18:32:49] [INFO ] Invariant cache hit.
[2024-05-25 18:32:49] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 309 ms returned sat
[2024-05-25 18:32:51] [INFO ] [Real]Absence check using state equation in 2161 ms returned unsat
[2024-05-25 18:32:52] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 320 ms returned sat
[2024-05-25 18:33:06] [INFO ] [Real]Absence check using state equation in 14386 ms returned sat
[2024-05-25 18:33:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:33:07] [INFO ] [Nat]Absence check using 0 positive and 1711 generalized place invariants in 328 ms returned sat
[2024-05-25 18:33:17] [INFO ] [Nat]Absence check using state equation in 10598 ms returned sat
[2024-05-25 18:33:17] [INFO ] Computed and/alt/rep : 59/59/59 causal constraints (skipped 59 transitions) in 11 ms.
[2024-05-25 18:33:18] [INFO ] Added : 28 causal constraints over 6 iterations in 303 ms. Result :sat
Minimization took 1193 ms.
[2024-05-25 18:33:19] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 299 ms returned sat
[2024-05-25 18:33:22] [INFO ] [Real]Absence check using state equation in 2579 ms returned unsat
[2024-05-25 18:33:22] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 293 ms returned sat
[2024-05-25 18:33:23] [INFO ] [Real]Absence check using state equation in 490 ms returned unsat
[2024-05-25 18:33:23] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 303 ms returned sat
[2024-05-25 18:33:24] [INFO ] [Real]Absence check using state equation in 438 ms returned unsat
[2024-05-25 18:33:24] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 297 ms returned sat
[2024-05-25 18:33:25] [INFO ] [Real]Absence check using state equation in 287 ms returned unsat
[2024-05-25 18:33:25] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 304 ms returned sat
[2024-05-25 18:33:26] [INFO ] [Real]Absence check using state equation in 987 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[29, 841, 29, 1, 1, 1, 1] Max Struct:[29, +inf, 29, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[841] Max Struct:[+inf]
Support contains 841 out of 1858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1858/1858 places, 147/147 transitions.
Graph (complete) has 27058 edges and 1858 vertex of which 899 are kept as prefixes of interest. Removing 959 places using SCC suffix rule.2 ms
Discarding 959 places :
Also discarding 89 output transitions
Drop transitions (Output transitions of discarded places.) removed 89 transitions
Applied a total of 1 rules in 10 ms. Remains 899 /1858 variables (removed 959) and now considering 58/147 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 899/1858 places, 58/147 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 58 rows 899 cols
[2024-05-25 18:33:39] [INFO ] Computed 841 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[841] Max Struct:[+inf]
RANDOM walk for 613742 steps (10402 resets) in 30001 ms. (20 steps per ms)
BEST_FIRST walk for 114624 steps (123 resets) in 5002 ms. (22 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[841] Max Struct:[+inf]
[2024-05-25 18:34:14] [INFO ] Invariant cache hit.
[2024-05-25 18:34:15] [INFO ] [Real]Absence check using 0 positive and 841 generalized place invariants in 126 ms returned sat
[2024-05-25 18:34:15] [INFO ] [Real]Absence check using state equation in 615 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[841] Max Struct:[841]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 841 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 330505 ms.
ITS solved all properties within timeout

BK_STOP 1716662055919

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="greatspnxred"
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 greatspnxred"
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 r311-tall-171662335900101"
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 ;