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-167873951000850.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-32, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951000850
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679664178275

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 13:23:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 13:23:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 13:23:00] [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 13:23:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 13:23:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2023-03-24 13:23:00] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
[2023-03-24 13:23:00] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 13:23:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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 11 formulas.
FORMULA QuasiCertifProtocol-COL-32-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 10 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 10007 steps, including 234 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 13:23:01] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-24 13:23:02] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-24 13:23:02] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:8
[2023-03-24 13:23:02] [INFO ] After 162ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-24 13:23:02] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:8
[2023-03-24 13:23:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 13:23:02] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-24 13:23:02] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-24 13:23:02] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 5 different solutions.
Finished Parikh walk after 94 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 9 properties in 3 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2023-03-24 13:23:02] [INFO ] Flatten gal took : 56 ms
[2023-03-24 13:23:02] [INFO ] Flatten gal took : 4 ms
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2023-03-24 13:23:02] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 33 ms.
[2023-03-24 13:23:02] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Support contains 3736 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 33 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 13:23:03] [INFO ] Computed 3232 place invariants in 230 ms
[2023-03-24 13:23:03] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-24 13:23:03] [INFO ] Invariant cache hit.
[2023-03-24 13:23:05] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
[2023-03-24 13:23:05] [INFO ] Invariant cache hit.
[2023-03-24 13:23:07] [INFO ] Dead Transitions using invariants and state equation in 1667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4185 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3736 out of 3736 places after structural reductions.
[2023-03-24 13:23:07] [INFO ] Flatten gal took : 254 ms
[2023-03-24 13:23:08] [INFO ] Flatten gal took : 181 ms
[2023-03-24 13:23:08] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 267 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 39) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-24 13:23:09] [INFO ] Invariant cache hit.
[2023-03-24 13:23:14] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 838 ms returned sat
[2023-03-24 13:23:15] [INFO ] After 4135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-24 13:23:18] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 769 ms returned sat
[2023-03-24 13:23:40] [INFO ] After 19688ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :28
[2023-03-24 13:23:40] [INFO ] After 19697ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :28
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 13:23:40] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :28
Fused 31 Parikh solutions to 21 different solutions.
Parikh walk visited 27 properties in 100 ms.
Support contains 3502 out of 3736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 3736 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 3735 transition count 503
Applied a total of 4 rules in 128 ms. Remains 3735 /3736 variables (removed 1) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 3735/3736 places, 503/506 transitions.
Incomplete random walk after 10000 steps, including 268 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 850 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 427957 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427957 steps, saw 77549 distinct states, run finished after 3005 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 503 rows 3735 cols
[2023-03-24 13:23:44] [INFO ] Computed 3233 place invariants in 57 ms
[2023-03-24 13:23:46] [INFO ] [Real]Absence check using 0 positive and 3233 generalized place invariants in 761 ms returned sat
[2023-03-24 13:23:47] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 13:23:48] [INFO ] [Nat]Absence check using 0 positive and 3233 generalized place invariants in 818 ms returned sat
[2023-03-24 13:23:57] [INFO ] After 10905ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2023-03-24 13:23:58] [INFO ] Flatten gal took : 261 ms
[2023-03-24 13:23:58] [INFO ] Flatten gal took : 128 ms
[2023-03-24 13:23:59] [INFO ] Input system was already deterministic with 506 transitions.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
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 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 251 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:23:59] [INFO ] Flatten gal took : 89 ms
[2023-03-24 13:23:59] [INFO ] Flatten gal took : 93 ms
[2023-03-24 13:23:59] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 266 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:00] [INFO ] Flatten gal took : 81 ms
[2023-03-24 13:24:00] [INFO ] Flatten gal took : 84 ms
[2023-03-24 13:24:00] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3735 transition count 505
Applied a total of 2 rules in 742 ms. Remains 3735 /3736 variables (removed 1) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 743 ms. Remains : 3735/3736 places, 505/506 transitions.
[2023-03-24 13:24:01] [INFO ] Flatten gal took : 78 ms
[2023-03-24 13:24:01] [INFO ] Flatten gal took : 81 ms
[2023-03-24 13:24:01] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3701 transition count 503
Applied a total of 2 rules in 580 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 586 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 13:24:02] [INFO ] Flatten gal took : 77 ms
[2023-03-24 13:24:02] [INFO ] Flatten gal took : 78 ms
[2023-03-24 13:24:02] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:02] [INFO ] Flatten gal took : 77 ms
[2023-03-24 13:24:02] [INFO ] Flatten gal took : 79 ms
[2023-03-24 13:24:02] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 131 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:02] [INFO ] Flatten gal took : 80 ms
[2023-03-24 13:24:03] [INFO ] Flatten gal took : 85 ms
[2023-03-24 13:24:03] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 242 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:03] [INFO ] Flatten gal took : 75 ms
[2023-03-24 13:24:03] [INFO ] Flatten gal took : 77 ms
[2023-03-24 13:24:03] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 268 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:04] [INFO ] Flatten gal took : 78 ms
[2023-03-24 13:24:04] [INFO ] Flatten gal took : 82 ms
[2023-03-24 13:24:04] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3702 transition count 504
Applied a total of 2 rules in 302 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 302 ms. Remains : 3702/3736 places, 504/506 transitions.
[2023-03-24 13:24:04] [INFO ] Flatten gal took : 80 ms
[2023-03-24 13:24:04] [INFO ] Flatten gal took : 80 ms
[2023-03-24 13:24:04] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 282 ms. Remains 3702 /3736 variables (removed 34) and now considering 504/506 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 286 ms. Remains : 3702/3736 places, 504/506 transitions.
[2023-03-24 13:24:05] [INFO ] Flatten gal took : 76 ms
[2023-03-24 13:24:05] [INFO ] Flatten gal took : 78 ms
[2023-03-24 13:24:05] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3736 transition count 506
Applied a total of 1 rules in 568 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 569 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:06] [INFO ] Flatten gal took : 78 ms
[2023-03-24 13:24:06] [INFO ] Flatten gal took : 80 ms
[2023-03-24 13:24:06] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 244 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:06] [INFO ] Flatten gal took : 75 ms
[2023-03-24 13:24:06] [INFO ] Flatten gal took : 76 ms
[2023-03-24 13:24:06] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.8 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3701 transition count 503
Applied a total of 2 rules in 539 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 539 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 13:24:07] [INFO ] Flatten gal took : 74 ms
[2023-03-24 13:24:07] [INFO ] Flatten gal took : 77 ms
[2023-03-24 13:24:07] [INFO ] Input system was already deterministic with 503 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 120 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 3736/3736 places, 506/506 transitions.
[2023-03-24 13:24:07] [INFO ] Flatten gal took : 78 ms
[2023-03-24 13:24:07] [INFO ] Flatten gal took : 81 ms
[2023-03-24 13:24:08] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.8 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 276 ms. Remains 3701 /3736 variables (removed 35) and now considering 503/506 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 276 ms. Remains : 3701/3736 places, 503/506 transitions.
[2023-03-24 13:24:08] [INFO ] Flatten gal took : 68 ms
[2023-03-24 13:24:08] [INFO ] Flatten gal took : 70 ms
[2023-03-24 13:24:08] [INFO ] Input system was already deterministic with 503 transitions.
Incomplete random walk after 10000 steps, including 247 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3609 steps, run visited all 1 properties in 21 ms. (steps per millisecond=171 )
Probabilistic random walk after 3609 steps, saw 3541 distinct states, run finished after 22 ms. (steps per millisecond=164 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-32-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2023-03-24 13:24:08] [INFO ] Flatten gal took : 105 ms
[2023-03-24 13:24:09] [INFO ] Flatten gal took : 106 ms
[2023-03-24 13:24:09] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 26 ms.
[2023-03-24 13:24:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 11 ms.
Total runtime 69198 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/491/ctl_0_ --ctl=/tmp/491/ctl_1_ --ctl=/tmp/491/ctl_2_ --ctl=/tmp/491/ctl_3_ --ctl=/tmp/491/ctl_4_ --ctl=/tmp/491/ctl_5_ --ctl=/tmp/491/ctl_6_ --ctl=/tmp/491/ctl_7_ --ctl=/tmp/491/ctl_8_ --ctl=/tmp/491/ctl_9_ --ctl=/tmp/491/ctl_10_ --ctl=/tmp/491/ctl_11_ --ctl=/tmp/491/ctl_12_ --ctl=/tmp/491/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13492960 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092604 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="CTLFireability"
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-32, examination is CTLFireability"
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-167873951000850"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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