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

About the Execution of LTSMin+red for QuasiCertifProtocol-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
292.831 8587.00 17831.00 337.20 TTTFTTTFFTTTTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950900801.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900801
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 34K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679653868347

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 10:31:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 10:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 10:31:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 10:31:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 10:31:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 557 ms
[2023-03-24 10:31:11] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2023-03-24 10:31:11] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 10:31:11] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1332 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 84) seen :23
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 63 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 72 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 67 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 67 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Running SMT prover for 61 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 10:31:12] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-24 10:31:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 10:31:12] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:44
[2023-03-24 10:31:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 10:31:12] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :61 sat :0
Fused 61 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 61 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 10:31:13] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-24 10:31:13] [INFO ] Flatten gal took : 20 ms
[2023-03-24 10:31:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 10:31:13] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2023-03-24 10:31:13] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 27 ms.
[2023-03-24 10:31:13] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 76 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 56
Applied a total of 1 rules in 8 ms. Remains 85 /86 variables (removed 1) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 85 cols
[2023-03-24 10:31:13] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-24 10:31:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-24 10:31:13] [INFO ] Invariant cache hit.
[2023-03-24 10:31:13] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-24 10:31:13] [INFO ] Invariant cache hit.
[2023-03-24 10:31:13] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 85/86 places, 56/56 transitions.
Support contains 76 out of 85 places after structural reductions.
[2023-03-24 10:31:13] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:31:13] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:31:13] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 38) seen :4
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 24 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :4
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-24 10:31:14] [INFO ] Invariant cache hit.
[2023-03-24 10:31:14] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-24 10:31:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-24 10:31:14] [INFO ] [Nat]Absence check using 2 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-24 10:31:14] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :25 sat :5
[2023-03-24 10:31:14] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :25 sat :5
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-24 10:31:14] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :25 sat :5
Fused 30 Parikh solutions to 5 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=9 )
Parikh walk visited 5 properties in 3 ms.
Successfully simplified 25 atomic propositions for a total of 9 simplifications.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 13 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 7 ms
[2023-03-24 10:31:14] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 37 out of 85 places (down from 57) after GAL structural reductions.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 85 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 3 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 5 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 56
Applied a total of 6 rules in 2 ms. Remains 79 /85 variables (removed 6) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/85 places, 56/56 transitions.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 5 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 1 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 5 ms
[2023-03-24 10:31:14] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 165 edges and 85 vertex of which 63 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 48
Applied a total of 3 rules in 9 ms. Remains 62 /85 variables (removed 23) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 62/85 places, 48/56 transitions.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 3 ms
[2023-03-24 10:31:14] [INFO ] Input system was already deterministic with 48 transitions.
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Flatten gal took : 4 ms
[2023-03-24 10:31:14] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-24 10:31:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 56 transitions and 205 arcs took 2 ms.
Total runtime 4282 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/477/ctl_0_ --ctl=/tmp/477/ctl_1_ --ctl=/tmp/477/ctl_2_ --ctl=/tmp/477/ctl_3_ --ctl=/tmp/477/ctl_4_ --mu-par --mu-opt
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679653876934

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-03
ctl formula formula --ctl=/tmp/477/ctl_0_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-05
ctl formula formula --ctl=/tmp/477/ctl_1_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-09
ctl formula formula --ctl=/tmp/477/ctl_2_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-10
ctl formula formula --ctl=/tmp/477/ctl_3_
ctl formula name QuasiCertifProtocol-COL-02-CTLCardinality-13
ctl formula formula --ctl=/tmp/477/ctl_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 85 places, 56 transitions and 205 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 56->56 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 85; there are 56 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 2929 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.070 real 0.210 user 0.080 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 1029 states, 2569 nodes
pnml2lts-sym: Formula /tmp/477/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/477/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/477/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/477/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/477/ctl_0_ does not hold for the initial state
pnml2lts-sym: group_next: 466 nodes total
pnml2lts-sym: group_explored: 549 nodes, 525 short vectors total
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950900801"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;