fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-28

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
913.060 327046.00 351542.00 1045.40 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.r312-tall-171662337800101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800101
=====================================================================

--------------------
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 1716671559087

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-25 21:12:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:12:40] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-25 21:12:40] [INFO ] Transformed 2998 places.
[2024-05-25 21:12:40] [INFO ] Transformed 446 transitions.
[2024-05-25 21:12:40] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 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 21:12:40] [INFO ] Computed 2553 invariants in 173 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 (302 resets) in 222 ms. (44 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 (167 resets) in 398 ms. (300 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 21:12:41] [INFO ] Invariant cache hit.
[2024-05-25 21:12:42] [INFO ] [Real]Absence check using 32 positive place invariants in 86 ms returned sat
[2024-05-25 21:12:42] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 468 ms returned sat
[2024-05-25 21:12:46] [INFO ] [Real]Absence check using state equation in 3935 ms returned unknown
[2024-05-25 21:12:46] [INFO ] [Real]Absence check using 32 positive place invariants in 71 ms returned sat
[2024-05-25 21:12:47] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 491 ms returned sat
[2024-05-25 21:12:48] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2024-05-25 21:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:12:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 59 ms returned sat
[2024-05-25 21:12:49] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 486 ms returned sat
[2024-05-25 21:12:51] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2024-05-25 21:12:51] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 66 ms.
[2024-05-25 21:12:52] [INFO ] Added : 68 causal constraints over 14 iterations in 1255 ms. Result :sat
Minimization took 569 ms.
[2024-05-25 21:12:53] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-05-25 21:12:54] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 508 ms returned sat
[2024-05-25 21:12:56] [INFO ] [Real]Absence check using state equation in 2565 ms returned sat
[2024-05-25 21:12:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:12:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 62 ms returned sat
[2024-05-25 21:12:57] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 461 ms returned sat
[2024-05-25 21:12:59] [INFO ] [Nat]Absence check using state equation in 2257 ms returned unknown
[2024-05-25 21:13:00] [INFO ] [Real]Absence check using 32 positive place invariants in 56 ms returned sat
[2024-05-25 21:13:00] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 503 ms returned sat
[2024-05-25 21:13:02] [INFO ] [Real]Absence check using state equation in 1413 ms returned sat
[2024-05-25 21:13:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:13:02] [INFO ] [Nat]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-05-25 21:13:02] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 482 ms returned sat
[2024-05-25 21:13:04] [INFO ] [Nat]Absence check using state equation in 1701 ms returned sat
[2024-05-25 21:13:04] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 38 ms.
[2024-05-25 21:13:05] [INFO ] Added : 80 causal constraints over 16 iterations in 1277 ms. Result :sat
Minimization took 553 ms.
[2024-05-25 21:13:06] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-05-25 21:13:07] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 484 ms returned sat
[2024-05-25 21:13:08] [INFO ] [Real]Absence check using state equation in 1322 ms returned sat
[2024-05-25 21:13:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 52 ms.
[2024-05-25 21:13:09] [INFO ] Added : 59 causal constraints over 12 iterations in 1025 ms. Result :sat
Minimization took 504 ms.
[2024-05-25 21:13:10] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2024-05-25 21:13:11] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 483 ms returned sat
[2024-05-25 21:13:12] [INFO ] [Real]Absence check using state equation in 1405 ms returned sat
[2024-05-25 21:13:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:13:12] [INFO ] [Nat]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-05-25 21:13:13] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 457 ms returned sat
[2024-05-25 21:13:15] [INFO ] [Nat]Absence check using state equation in 2313 ms returned sat
[2024-05-25 21:13:15] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2024-05-25 21:13:16] [INFO ] Added : 61 causal constraints over 13 iterations in 948 ms. Result :sat
Minimization took 553 ms.
[2024-05-25 21:13:17] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2024-05-25 21:13:18] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 501 ms returned sat
[2024-05-25 21:13:19] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2024-05-25 21:13:19] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 33 ms.
[2024-05-25 21:13:21] [INFO ] Added : 125 causal constraints over 25 iterations in 1975 ms. Result :sat
Minimization took 553 ms.
[2024-05-25 21:13:22] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2024-05-25 21:13:22] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 486 ms returned sat
[2024-05-25 21:13:22] [INFO ] [Real]Absence check using state equation in 96 ms returned unsat
[2024-05-25 21:13:23] [INFO ] [Real]Absence check using 32 positive place invariants in 56 ms returned sat
[2024-05-25 21:13:23] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 476 ms returned sat
[2024-05-25 21:13:24] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2024-05-25 21:13:25] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2024-05-25 21:13:25] [INFO ] Added : 41 causal constraints over 9 iterations in 776 ms. Result :sat
Minimization took 553 ms.
[2024-05-25 21:13:26] [INFO ] [Real]Absence check using 32 positive place invariants in 58 ms returned sat
[2024-05-25 21:13:27] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 487 ms returned sat
[2024-05-25 21:13:28] [INFO ] [Real]Absence check using state equation in 1517 ms returned sat
[2024-05-25 21:13:28] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 27 ms.
[2024-05-25 21:13:31] [INFO ] Added : 147 causal constraints over 30 iterations in 2414 ms. Result :sat
Minimization took 81 ms.
[2024-05-25 21:13:31] [INFO ] [Real]Absence check using 32 positive place invariants in 56 ms returned sat
[2024-05-25 21:13:32] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 497 ms returned sat
[2024-05-25 21:13:33] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2024-05-25 21:13:33] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2024-05-25 21:13:35] [INFO ] Added : 129 causal constraints over 26 iterations in 2064 ms. Result :sat
Minimization took 555 ms.
[2024-05-25 21:13:36] [INFO ] [Real]Absence check using 32 positive place invariants in 55 ms returned sat
[2024-05-25 21:13:37] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 511 ms returned sat
[2024-05-25 21:13:38] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2024-05-25 21:13:38] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2024-05-25 21:13:40] [INFO ] Added : 139 causal constraints over 28 iterations in 2275 ms. Result :sat
Minimization took 250 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 1 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 2 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 259 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 271 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 21:13:41] [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 (16113 resets) in 21884 ms. (45 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 9377545 steps (7807 resets) in 29723 ms. (315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 609, 0, 29, 29, 0, 1, 0, 0, 0] Max Struct:[841, +inf, 841, 841, +inf, 29, +inf, +inf, 29, +inf]
[2024-05-25 21:14:33] [INFO ] Invariant cache hit.
[2024-05-25 21:14:33] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 350 ms returned sat
[2024-05-25 21:14:34] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2024-05-25 21:14:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:14:35] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 351 ms returned sat
[2024-05-25 21:14:36] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2024-05-25 21:14:36] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 18 ms.
[2024-05-25 21:14:37] [INFO ] Added : 117 causal constraints over 24 iterations in 1203 ms. Result :sat
Minimization took 2463 ms.
[2024-05-25 21:14:40] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 354 ms returned sat
[2024-05-25 21:14:41] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2024-05-25 21:14:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:14:41] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 357 ms returned sat
[2024-05-25 21:14:42] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2024-05-25 21:14:42] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 24 ms.
[2024-05-25 21:14:43] [INFO ] Added : 77 causal constraints over 16 iterations in 806 ms. Result :sat
Minimization took 2281 ms.
[2024-05-25 21:14:46] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 349 ms returned sat
[2024-05-25 21:14:47] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2024-05-25 21:14:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:14:47] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 346 ms returned sat
[2024-05-25 21:14:50] [INFO ] [Nat]Absence check using state equation in 3144 ms returned sat
[2024-05-25 21:14:50] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 17 ms.
[2024-05-25 21:14:51] [INFO ] Added : 89 causal constraints over 18 iterations in 895 ms. Result :sat
Minimization took 2730 ms.
[2024-05-25 21:14:55] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 349 ms returned sat
[2024-05-25 21:14:56] [INFO ] [Real]Absence check using state equation in 1425 ms returned unsat
[2024-05-25 21:14:57] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 347 ms returned sat
[2024-05-25 21:14:57] [INFO ] [Real]Absence check using state equation in 404 ms returned unsat
[2024-05-25 21:14:58] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 340 ms returned sat
[2024-05-25 21:14:58] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2024-05-25 21:14:58] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-25 21:14:59] [INFO ] Added : 106 causal constraints over 22 iterations in 1163 ms. Result :sat
Minimization took 2218 ms.
[2024-05-25 21:15:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:15:02] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 342 ms returned sat
[2024-05-25 21:15:03] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-05-25 21:15:03] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 17 ms.
[2024-05-25 21:15:04] [INFO ] Added : 106 causal constraints over 22 iterations in 1044 ms. Result :sat
Minimization took 2176 ms.
[2024-05-25 21:15:06] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 347 ms returned sat
[2024-05-25 21:15:07] [INFO ] [Real]Absence check using state equation in 440 ms returned unsat
[2024-05-25 21:15:07] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 355 ms returned sat
[2024-05-25 21:15:08] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-25 21:15:08] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 16 ms.
[2024-05-25 21:15:09] [INFO ] Added : 88 causal constraints over 18 iterations in 972 ms. Result :sat
Minimization took 2201 ms.
[2024-05-25 21:15:12] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 331 ms returned sat
[2024-05-25 21:15:12] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-25 21:15:12] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 16 ms.
[2024-05-25 21:15:13] [INFO ] Added : 106 causal constraints over 22 iterations in 1195 ms. Result :sat
Minimization took 2197 ms.
[2024-05-25 21:15:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:15:16] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 358 ms returned sat
[2024-05-25 21:15:17] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2024-05-25 21:15:17] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 23 ms.
[2024-05-25 21:15:18] [INFO ] Added : 106 causal constraints over 22 iterations in 1119 ms. Result :sat
Minimization took 2162 ms.
[2024-05-25 21:15:21] [INFO ] [Real]Absence check using 0 positive and 1739 generalized place invariants in 346 ms returned sat
[2024-05-25 21:15:21] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-05-25 21:15:21] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-25 21:15:22] [INFO ] Added : 106 causal constraints over 22 iterations in 1201 ms. Result :sat
Minimization took 2230 ms.
[2024-05-25 21:15:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:15:25] [INFO ] [Nat]Absence check using 0 positive and 1739 generalized place invariants in 363 ms returned sat
[2024-05-25 21:15:26] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2024-05-25 21:15:26] [INFO ] Computed and/alt/rep : 177/206/177 causal constraints (skipped 60 transitions) in 27 ms.
[2024-05-25 21:15:27] [INFO ] Added : 106 causal constraints over 22 iterations in 1149 ms. Result :sat
Minimization took 2191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 609, 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 195 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 195 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 21:15:34] [INFO ] Computed 1711 invariants in 5 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 609602 steps (5166 resets) in 30001 ms. (20 steps per ms)
BEST_FIRST walk for 3190071 steps (1335 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 21:16:39] [INFO ] Invariant cache hit.
[2024-05-25 21:16:39] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 312 ms returned sat
[2024-05-25 21:16:41] [INFO ] [Real]Absence check using state equation in 2125 ms returned unsat
[2024-05-25 21:16:42] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 327 ms returned sat
[2024-05-25 21:16:56] [INFO ] [Real]Absence check using state equation in 14391 ms returned sat
[2024-05-25 21:16:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:16:57] [INFO ] [Nat]Absence check using 0 positive and 1711 generalized place invariants in 342 ms returned sat
[2024-05-25 21:17:07] [INFO ] [Nat]Absence check using state equation in 10766 ms returned sat
[2024-05-25 21:17:07] [INFO ] Computed and/alt/rep : 59/59/59 causal constraints (skipped 59 transitions) in 12 ms.
[2024-05-25 21:17:08] [INFO ] Added : 28 causal constraints over 6 iterations in 279 ms. Result :sat
Minimization took 1210 ms.
[2024-05-25 21:17:09] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 308 ms returned sat
[2024-05-25 21:17:12] [INFO ] [Real]Absence check using state equation in 2559 ms returned unsat
[2024-05-25 21:17:12] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 290 ms returned sat
[2024-05-25 21:17:13] [INFO ] [Real]Absence check using state equation in 498 ms returned unsat
[2024-05-25 21:17:13] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 299 ms returned sat
[2024-05-25 21:17:14] [INFO ] [Real]Absence check using state equation in 435 ms returned unsat
[2024-05-25 21:17:14] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 303 ms returned sat
[2024-05-25 21:17:15] [INFO ] [Real]Absence check using state equation in 262 ms returned unsat
[2024-05-25 21:17:15] [INFO ] [Real]Absence check using 0 positive and 1711 generalized place invariants in 298 ms returned sat
[2024-05-25 21:17:16] [INFO ] [Real]Absence check using state equation in 996 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 12 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 13 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 21:17:29] [INFO ] Computed 841 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[841] Max Struct:[+inf]
RANDOM walk for 609445 steps (10329 resets) in 30001 ms. (20 steps per ms)
BEST_FIRST walk for 114858 steps (123 resets) in 5001 ms. (22 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[841] Max Struct:[+inf]
[2024-05-25 21:18:04] [INFO ] Invariant cache hit.
[2024-05-25 21:18:05] [INFO ] [Real]Absence check using 0 positive and 841 generalized place invariants in 135 ms returned sat
[2024-05-25 21:18:05] [INFO ] [Real]Absence check using state equation in 619 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 )
[2024-05-25 21:18:05] [INFO ] Flatten gal took : 109 ms
[2024-05-25 21:18:05] [INFO ] Flatten gal took : 58 ms
[2024-05-25 21:18:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8890388093798231088.gal : 23 ms
[2024-05-25 21:18:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13181591953606329373.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8890388093798231088.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13181591953606329373.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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

BK_STOP 1716671886133

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-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 r312-tall-171662337800101"
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 ;