Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361400022.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is QuasiCertifProtocol-COL-22, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716762466826

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-26 22:27:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 22:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:27:48] [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.
[2024-05-26 22:27:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 22:27:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 814 ms
[2024-05-26 22:27:49] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 22:27:49] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 6 ms.
[2024-05-26 22:27:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-15 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).
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 10005 steps, including 309 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 18) seen :6
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10008 steps, including 105 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 26 rows 30 cols
[2024-05-26 22:27:50] [INFO ] Computed 5 invariants in 4 ms
[2024-05-26 22:27:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-26 22:27:50] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2024-05-26 22:27:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-26 22:27:50] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :9
[2024-05-26 22:27:50] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :9
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-26 22:27:50] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :9
Fused 12 Parikh solutions to 9 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 7 properties in 17 ms.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 26/26 transitions.
Graph (complete) has 50 edges and 30 vertex of which 24 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 24 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 22 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 21 transition count 11
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 20 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 19 transition count 10
Applied a total of 19 rules in 14 ms. Remains 19 /30 variables (removed 11) and now considering 10/26 (removed 16) transitions.
// Phase 1: matrix 10 rows 19 cols
[2024-05-26 22:27:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-26 22:27:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 19/30 places, 10/26 transitions.
Finished random walk after 124 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:27:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-26 22:27:50] [INFO ] Flatten gal took : 19 ms
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:27:50] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-26 22:27:51] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 22 ms.
[2024-05-26 22:27:51] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 1798 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1941 transition count 356
Applied a total of 25 rules in 17 ms. Remains 1941 /1966 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1941 cols
[2024-05-26 22:27:51] [INFO ] Computed 1586 invariants in 42 ms
[2024-05-26 22:27:51] [INFO ] Implicit Places using invariants in 827 ms returned []
[2024-05-26 22:27:51] [INFO ] Invariant cache hit.
[2024-05-26 22:27:53] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned [1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 2409 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1918/1966 places, 356/356 transitions.
Applied a total of 0 rules in 11 ms. Remains 1918 /1918 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2437 ms. Remains : 1918/1966 places, 356/356 transitions.
Support contains 1798 out of 1918 places after structural reductions.
[2024-05-26 22:27:53] [INFO ] Flatten gal took : 180 ms
[2024-05-26 22:27:53] [INFO ] Flatten gal took : 151 ms
[2024-05-26 22:27:54] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 372 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 390637 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1}
Probabilistic random walk after 390637 steps, saw 63611 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :12
Running SMT prover for 2 properties.
// Phase 1: matrix 356 rows 1918 cols
[2024-05-26 22:27:58] [INFO ] Computed 1563 invariants in 47 ms
[2024-05-26 22:27:59] [INFO ] [Real]Absence check using 0 positive and 1563 generalized place invariants in 295 ms returned sat
[2024-05-26 22:27:59] [INFO ] After 1130ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-26 22:28:00] [INFO ] [Nat]Absence check using 0 positive and 1563 generalized place invariants in 285 ms returned sat
[2024-05-26 22:28:03] [INFO ] After 3942ms 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.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1918 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1918 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 23 out of 1918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1893 transition count 356
Applied a total of 25 rules in 242 ms. Remains 1893 /1918 variables (removed 25) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-26 22:28:04] [INFO ] Computed 1540 invariants in 142 ms
[2024-05-26 22:28:06] [INFO ] Implicit Places using invariants in 2420 ms returned []
[2024-05-26 22:28:06] [INFO ] Invariant cache hit.
[2024-05-26 22:28:11] [INFO ] Implicit Places using invariants and state equation in 4363 ms returned []
Implicit Place search using SMT with State Equation took 6792 ms to find 0 implicit places.
[2024-05-26 22:28:11] [INFO ] Invariant cache hit.
[2024-05-26 22:28:11] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1893/1918 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7676 ms. Remains : 1893/1918 places, 356/356 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s1611 s1612 s1613 s1614 s1615 s1616 s1617 s1618 s1619 s1620 s1621 s1622 s1623 s1624 s1625 s1626 s1627 s1628 s1629 s1630 s1631 s1632 s1633))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-01 finished in 7948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1895 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.21 ms
Discarding 23 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1893 transition count 354
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1893 transition count 354
Applied a total of 4 rules in 463 ms. Remains 1893 /1918 variables (removed 25) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1893 cols
[2024-05-26 22:28:12] [INFO ] Computed 1540 invariants in 34 ms
[2024-05-26 22:28:14] [INFO ] Implicit Places using invariants in 2236 ms returned []
[2024-05-26 22:28:14] [INFO ] Invariant cache hit.
[2024-05-26 22:28:18] [INFO ] Implicit Places using invariants and state equation in 3921 ms returned [1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6161 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1870/1918 places, 354/356 transitions.
Applied a total of 0 rules in 102 ms. Remains 1870 /1870 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6726 ms. Remains : 1870/1918 places, 354/356 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s1869 (ADD s1727 s1728 s1729 s1730 s1731 s1732 s1733 s1734 s1735 s1736 s1737 s1738 s1739 s1740 s1741 s1742 s1743 s1744 s1745 s1746 s1747 s1748 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 9 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-05 finished in 6832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 529 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1294 are kept as prefixes of interest. Removing 624 places using SCC suffix rule.7 ms
Discarding 624 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 1293 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 1291 transition count 260
Applied a total of 50 rules in 75 ms. Remains 1291 /1918 variables (removed 627) and now considering 260/356 (removed 96) transitions.
// Phase 1: matrix 260 rows 1291 cols
[2024-05-26 22:28:18] [INFO ] Computed 1034 invariants in 5 ms
[2024-05-26 22:28:19] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-26 22:28:19] [INFO ] Invariant cache hit.
[2024-05-26 22:28:20] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned [1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 2031 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1268/1918 places, 260/356 transitions.
Applied a total of 0 rules in 28 ms. Remains 1268 /1268 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2142 ms. Remains : 1268/1918 places, 260/356 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-07 finished in 2192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (p1||G(p0)))))'
Support contains 69 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1869 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.4 ms
Discarding 49 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 1866 transition count 351
Applied a total of 5 rules in 160 ms. Remains 1866 /1918 variables (removed 52) and now considering 351/356 (removed 5) transitions.
// Phase 1: matrix 351 rows 1866 cols
[2024-05-26 22:28:21] [INFO ] Computed 1518 invariants in 148 ms
[2024-05-26 22:28:23] [INFO ] Implicit Places using invariants in 2133 ms returned []
[2024-05-26 22:28:23] [INFO ] Invariant cache hit.
[2024-05-26 22:28:27] [INFO ] Implicit Places using invariants and state equation in 3981 ms returned [1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6118 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1843/1918 places, 351/356 transitions.
Applied a total of 0 rules in 76 ms. Remains 1843 /1843 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6355 ms. Remains : 1843/1918 places, 351/356 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GT 2 (ADD s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-09 finished in 6407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((p0 U X(p1))&&X(p0)))&&X(G(p0))))'
Support contains 576 out of 1918 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1917 transition count 356
Applied a total of 1 rules in 36 ms. Remains 1917 /1918 variables (removed 1) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1917 cols
[2024-05-26 22:28:27] [INFO ] Computed 1563 invariants in 17 ms
[2024-05-26 22:28:29] [INFO ] Implicit Places using invariants in 1840 ms returned []
[2024-05-26 22:28:29] [INFO ] Invariant cache hit.
[2024-05-26 22:28:36] [INFO ] Implicit Places using invariants and state equation in 7622 ms returned []
Implicit Place search using SMT with State Equation took 9466 ms to find 0 implicit places.
[2024-05-26 22:28:36] [INFO ] Invariant cache hit.
[2024-05-26 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1917/1918 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10184 ms. Remains : 1917/1918 places, 356/356 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s1865 s1866 s1867 s1868 s1869 s1870 s1871 s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1884 s1885 s1886 s1887) s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3711 reset in 451 ms.
Product exploration explored 100000 steps with 3712 reset in 411 ms.
Computed a total of 1917 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1917 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 158 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 371 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4686 steps, run visited all 1 properties in 34 ms. (steps per millisecond=137 )
Probabilistic random walk after 4686 steps, saw 4567 distinct states, run finished after 35 ms. (steps per millisecond=133 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 10 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-10 finished in 12121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 48 out of 1918 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1918/1918 places, 356/356 transitions.
Graph (complete) has 14796 edges and 1918 vertex of which 1894 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Discarding 24 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1892 transition count 354
Applied a total of 3 rules in 150 ms. Remains 1892 /1918 variables (removed 26) and now considering 354/356 (removed 2) transitions.
// Phase 1: matrix 354 rows 1892 cols
[2024-05-26 22:28:39] [INFO ] Computed 1540 invariants in 31 ms
[2024-05-26 22:28:41] [INFO ] Implicit Places using invariants in 2214 ms returned []
[2024-05-26 22:28:41] [INFO ] Invariant cache hit.
[2024-05-26 22:28:45] [INFO ] Implicit Places using invariants and state equation in 3815 ms returned [1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6032 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1869/1918 places, 354/356 transitions.
Applied a total of 0 rules in 77 ms. Remains 1869 /1869 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6259 ms. Remains : 1869/1918 places, 354/356 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-COL-22-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1868 (ADD s1841 s1842 s1843 s1844 s1845 s1846 s1847 s1848 s1849 s1850 s1851 s1852 s1853 s1854 s1855 s1856 s1857 s1858 s1859 s1860 s1861 s1862 s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3473 reset in 381 ms.
Product exploration explored 100000 steps with 3473 reset in 309 ms.
Computed a total of 1869 stabilizing places and 354 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1869 transition count 354
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-22-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-22-LTLCardinality-11 finished in 7327 ms.
All properties solved by simple procedures.
Total runtime 58563 ms.

BK_STOP 1716762528308

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-COL-22, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662361400022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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