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.r571-tall-171734910100032.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 CO4-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 98K Jun 2 16:33 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 CO4-PT-07-LTLCardinality-00
FORMULA_NAME CO4-PT-07-LTLCardinality-01
FORMULA_NAME CO4-PT-07-LTLCardinality-02
FORMULA_NAME CO4-PT-07-LTLCardinality-03
FORMULA_NAME CO4-PT-07-LTLCardinality-04
FORMULA_NAME CO4-PT-07-LTLCardinality-05
FORMULA_NAME CO4-PT-07-LTLCardinality-06
FORMULA_NAME CO4-PT-07-LTLCardinality-07
FORMULA_NAME CO4-PT-07-LTLCardinality-08
FORMULA_NAME CO4-PT-07-LTLCardinality-09
FORMULA_NAME CO4-PT-07-LTLCardinality-10
FORMULA_NAME CO4-PT-07-LTLCardinality-11
FORMULA_NAME CO4-PT-07-LTLCardinality-12
FORMULA_NAME CO4-PT-07-LTLCardinality-13
FORMULA_NAME CO4-PT-07-LTLCardinality-14
FORMULA_NAME CO4-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717368625113

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=CO4-PT-07
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:50:26] [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-06-02 22:50:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:26] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-02 22:50:26] [INFO ] Transformed 384 places.
[2024-06-02 22:50:26] [INFO ] Transformed 456 transitions.
[2024-06-02 22:50:26] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:26] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 70 place count 215 transition count 274
Iterating global reduction 1 with 59 rules applied. Total rules applied 129 place count 215 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 215 transition count 271
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 160 place count 187 transition count 243
Iterating global reduction 2 with 28 rules applied. Total rules applied 188 place count 187 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 187 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 184 transition count 238
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 184 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 183 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 183 transition count 237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 182 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 182 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 182 transition count 235
Applied a total of 200 rules in 66 ms. Remains 182 /284 variables (removed 102) and now considering 235/336 (removed 101) transitions.
// Phase 1: matrix 235 rows 182 cols
[2024-06-02 22:50:27] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 22:50:27] [INFO ] Implicit Places using invariants in 184 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 181/284 places, 235/336 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 181/284 places, 235/336 transitions.
Support contains 9 out of 181 places after structural reductions.
[2024-06-02 22:50:27] [INFO ] Flatten gal took : 44 ms
[2024-06-02 22:50:27] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:50:27] [INFO ] Input system was already deterministic with 235 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 235 rows 181 cols
[2024-06-02 22:50:28] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:28] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:50:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:28] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:50:28] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-06-02 22:50:28] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 3 properties in 3 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 304 edges and 181 vertex of which 178 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 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' '!(X((G(p0)&&F(p1))))'
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 235/235 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 179 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 179 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 179 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 177 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 177 transition count 230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 175 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 175 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 174 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 174 transition count 226
Applied a total of 15 rules in 26 ms. Remains 174 /181 variables (removed 7) and now considering 226/235 (removed 9) transitions.
// Phase 1: matrix 226 rows 174 cols
[2024-06-02 22:50:28] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:50:28] [INFO ] Invariant cache hit.
[2024-06-02 22:50:29] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-02 22:50:29] [INFO ] Invariant cache hit.
[2024-06-02 22:50:29] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/181 places, 226/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 174/181 places, 226/235 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 272 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLCardinality-14 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:(OR (EQ s115 0) (EQ s100 1)), p1:(AND (OR (AND (EQ s91 0) (EQ s137 1)) (AND (EQ s48 0) (EQ s105 1))) (EQ s91 0) (EQ s137 1))], 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]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 3 ms.
FORMULA CO4-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLCardinality-14 finished in 703 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' '!(X((p0&&X(F(((p0&&(G(p0)||F(!p1)))||G(F(!p1))))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 235/235 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 178 transition count 232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 178 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 177 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 177 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 176 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 176 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 175 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 175 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 175 transition count 227
Applied a total of 13 rules in 13 ms. Remains 175 /181 variables (removed 6) and now considering 227/235 (removed 8) transitions.
// Phase 1: matrix 227 rows 175 cols
[2024-06-02 22:50:29] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:50:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:50:29] [INFO ] Invariant cache hit.
[2024-06-02 22:50:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-02 22:50:29] [INFO ] Invariant cache hit.
[2024-06-02 22:50:29] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/181 places, 227/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 175/181 places, 227/235 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s142 1), p1:(OR (EQ s12 0) (EQ s158 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 202 ms.
Product exploration explored 100000 steps with 1 reset in 121 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 296 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Finished probabilistic random walk after 12992 steps, run visited all 2 properties in 67 ms. (steps per millisecond=193 )
Probabilistic random walk after 12992 steps, saw 3023 distinct states, run finished after 67 ms. (steps per millisecond=193 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-02 22:50:31] [INFO ] Invariant cache hit.
[2024-06-02 22:50:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:50:31] [INFO ] Invariant cache hit.
[2024-06-02 22:50:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 22:50:31] [INFO ] Invariant cache hit.
[2024-06-02 22:50:31] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 175/175 places, 227/227 transitions.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 296 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished probabilistic random walk after 12992 steps, run visited all 2 properties in 37 ms. (steps per millisecond=351 )
Probabilistic random walk after 12992 steps, saw 3023 distinct states, run finished after 37 ms. (steps per millisecond=351 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 28 reset in 77 ms.
Product exploration explored 100000 steps with 34 reset in 174 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 227/227 transitions.
Graph (trivial) has 182 edges and 175 vertex of which 2 / 175 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 295 edges and 174 vertex of which 171 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 171 transition count 222
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 60 place count 171 transition count 241
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 79 place count 171 transition count 241
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 159 transition count 229
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 159 transition count 229
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 124 place count 159 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 159 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 149 transition count 236
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 149 transition count 236
Performed 25 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 172 place count 149 transition count 342
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 196 place count 149 transition count 318
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 244 place count 101 transition count 208
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 48 rules applied. Total rules applied 292 place count 101 transition count 208
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 309 place count 101 transition count 191
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 337 place count 73 transition count 140
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 365 place count 73 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 367 place count 73 transition count 138
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 371 place count 69 transition count 130
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 375 place count 69 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 69 transition count 144
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 68 transition count 142
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 68 transition count 142
Deduced a syphon composed of 35 places in 0 ms
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 404 place count 68 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 405 place count 67 transition count 115
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 406 place count 67 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 67 transition count 139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 408 place count 66 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 66 transition count 132
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 409 rules in 84 ms. Remains 66 /175 variables (removed 109) and now considering 132/227 (removed 95) transitions.
[2024-06-02 22:50:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:50:33] [INFO ] Flow matrix only has 130 transitions (discarded 2 similar events)
// Phase 1: matrix 130 rows 66 cols
[2024-06-02 22:50:33] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:33] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/175 places, 132/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 66/175 places, 132/227 transitions.
Built C files in :
/tmp/ltsmin10391205229384325045
[2024-06-02 22:50:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10391205229384325045
Running compilation step : cd /tmp/ltsmin10391205229384325045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 514 ms.
Running link step : cd /tmp/ltsmin10391205229384325045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10391205229384325045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3890631213712378557.hoa' '--buchi-type=spotba'
LTSmin run took 470 ms.
FORMULA CO4-PT-07-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLCardinality-15 finished in 5120 ms.
All properties solved by simple procedures.
Total runtime 7983 ms.

BK_STOP 1717368635859

--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r571-tall-171734910100032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-07.tgz
mv CO4-PT-07 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 ;