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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.6K Feb 26 01:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:30 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 61K 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-06-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679654061147

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-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 10:34:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 10:34:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 10:34:23] [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:34:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 10:34:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 779 ms
[2023-03-24 10:34:24] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2023-03-24 10:34:24] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2023-03-24 10:34:24] [INFO ] Skeletonized 16 HLPN properties in 3 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 9 formulas.
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 11 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 10002 steps, including 766 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 264 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 265 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 264 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 345 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 10:34:25] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-24 10:34:25] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-24 10:34:25] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-24 10:34:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 10:34:25] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-24 10:34:25] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-24 10:34:25] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 7 properties in 10 ms.
[2023-03-24 10:34:25] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 10:34:25] [INFO ] Flatten gal took : 29 ms
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 10:34:25] [INFO ] Flatten gal took : 5 ms
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2023-03-24 10:34:25] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 11 ms.
[2023-03-24 10:34:25] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 252 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 8 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 252 cols
[2023-03-24 10:34:25] [INFO ] Computed 138 place invariants in 19 ms
[2023-03-24 10:34:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-24 10:34:25] [INFO ] Invariant cache hit.
[2023-03-24 10:34:25] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-24 10:34:25] [INFO ] Invariant cache hit.
[2023-03-24 10:34:25] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 252/270 places, 116/116 transitions.
Support contains 252 out of 252 places after structural reductions.
[2023-03-24 10:34:25] [INFO ] Flatten gal took : 26 ms
[2023-03-24 10:34:26] [INFO ] Flatten gal took : 29 ms
[2023-03-24 10:34:26] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 985 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 42) seen :6
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :2
Incomplete Best-First random walk after 1001 steps, including 18 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 16 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 11 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 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 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 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 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 10 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 18 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 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 19 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 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 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 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 10 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 10 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 18 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 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 16 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 18 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 16 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 11 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 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 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 11 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 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-24 10:34:27] [INFO ] Invariant cache hit.
[2023-03-24 10:34:27] [INFO ] [Real]Absence check using 0 positive and 138 generalized place invariants in 21 ms returned sat
[2023-03-24 10:34:27] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-24 10:34:27] [INFO ] [Nat]Absence check using 0 positive and 138 generalized place invariants in 20 ms returned sat
[2023-03-24 10:34:28] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :29
[2023-03-24 10:34:29] [INFO ] After 1557ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :29
Attempting to minimize the solution found.
Minimization took 585 ms.
[2023-03-24 10:34:30] [INFO ] After 2537ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :29
Fused 34 Parikh solutions to 27 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 14 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 29 properties in 7 ms.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 17 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 22 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Computed a total of 252 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 252 transition count 116
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 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 13 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 13 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 15 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 12 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 12 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 15 ms. Remains 243 /252 variables (removed 9) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 243/252 places, 113/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 15 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 10 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 10 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 11 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 10 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Graph (complete) has 733 edges and 252 vertex of which 244 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 10 ms. Remains 243 /252 variables (removed 9) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 243/252 places, 113/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 7 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 7 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 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 252 transition count 116
Applied a total of 1 rules in 19 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 8 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 8 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 252/252 places, 116/116 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 1 place count 251 transition count 115
Applied a total of 1 rules in 18 ms. Remains 251 /252 variables (removed 1) and now considering 115/116 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 251/252 places, 115/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 13 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 8 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 8 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 8 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 8 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 252 /252 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 252/252 places, 116/116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 7 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 9 ms
[2023-03-24 10:34:30] [INFO ] Input system was already deterministic with 116 transitions.
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 13 ms
[2023-03-24 10:34:30] [INFO ] Flatten gal took : 13 ms
[2023-03-24 10:34:30] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2023-03-24 10:34:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 252 places, 116 transitions and 590 arcs took 1 ms.
Total runtime 7771 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/479/ctl_0_ --ctl=/tmp/479/ctl_1_ --ctl=/tmp/479/ctl_2_ --ctl=/tmp/479/ctl_3_ --ctl=/tmp/479/ctl_4_ --ctl=/tmp/479/ctl_5_ --ctl=/tmp/479/ctl_6_ --ctl=/tmp/479/ctl_7_ --ctl=/tmp/479/ctl_8_ --ctl=/tmp/479/ctl_9_ --ctl=/tmp/479/ctl_10_ --ctl=/tmp/479/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 15157004 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16091692 kB
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-00
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-01
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-02
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-05
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-COL-06-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-10
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-12
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-13
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-14
Could not compute solution for formula : QuasiCertifProtocol-COL-06-CTLFireability-15

BK_STOP 1679657643162

--------------------
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
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-00
ctl formula formula --ctl=/tmp/479/ctl_0_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-01
ctl formula formula --ctl=/tmp/479/ctl_1_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-02
ctl formula formula --ctl=/tmp/479/ctl_2_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-03
ctl formula formula --ctl=/tmp/479/ctl_3_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-05
ctl formula formula --ctl=/tmp/479/ctl_4_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-07
ctl formula formula --ctl=/tmp/479/ctl_5_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-08
ctl formula formula --ctl=/tmp/479/ctl_6_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-10
ctl formula formula --ctl=/tmp/479/ctl_7_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-12
ctl formula formula --ctl=/tmp/479/ctl_8_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-13
ctl formula formula --ctl=/tmp/479/ctl_9_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-14
ctl formula formula --ctl=/tmp/479/ctl_10_
ctl formula name QuasiCertifProtocol-COL-06-CTLFireability-15
ctl formula formula --ctl=/tmp/479/ctl_11_
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 252 places, 116 transitions and 590 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: 116->111 groups
pnml2lts-sym: Regrouping took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 252; there are 111 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: 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: 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 133207 group checks and 0 next state calls
pnml2lts-sym: reachability took 3.950 real 12.740 user 2.970 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.120 user 0.000 sys
pnml2lts-sym: state space has 2271960 states, 136591 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/479/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/479/ctl_5_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/479/ctl_6_ does not hold for the initial state
Killing (15) : 485
Killing (9) : 485

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-06"
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-06, 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-167873951000810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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