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.r109-tall-171624208400352.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 DBSingleClientW-PT-d2m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400352
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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 DBSingleClientW-PT-d2m06-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716328289954

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=DBSingleClientW-PT-d2m06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 21:51:31] [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-21 21:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:51:31] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-21 21:51:31] [INFO ] Transformed 4763 places.
[2024-05-21 21:51:31] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:51:31] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 634 place count 748 transition count 1211
Iterating global reduction 1 with 389 rules applied. Total rules applied 1023 place count 748 transition count 1211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1032 place count 748 transition count 1202
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1346 place count 434 transition count 888
Iterating global reduction 2 with 314 rules applied. Total rules applied 1660 place count 434 transition count 888
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1672 place count 434 transition count 876
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1910 place count 196 transition count 543
Iterating global reduction 3 with 238 rules applied. Total rules applied 2148 place count 196 transition count 543
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2359 place count 196 transition count 332
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2382 place count 173 transition count 288
Iterating global reduction 4 with 23 rules applied. Total rules applied 2405 place count 173 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2411 place count 173 transition count 282
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 2424 place count 160 transition count 269
Iterating global reduction 5 with 13 rules applied. Total rules applied 2437 place count 160 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2439 place count 160 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2450 place count 149 transition count 256
Iterating global reduction 6 with 11 rules applied. Total rules applied 2461 place count 149 transition count 256
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2471 place count 149 transition count 246
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2476 place count 144 transition count 216
Iterating global reduction 7 with 5 rules applied. Total rules applied 2481 place count 144 transition count 216
Applied a total of 2481 rules in 194 ms. Remains 144 /1183 variables (removed 1039) and now considering 216/2478 (removed 2262) transitions.
// Phase 1: matrix 216 rows 144 cols
[2024-05-21 21:51:32] [INFO ] Computed 2 invariants in 22 ms
[2024-05-21 21:51:32] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 21:51:32] [INFO ] Invariant cache hit.
[2024-05-21 21:51:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:51:32] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-21 21:51:32] [INFO ] Invariant cache hit.
[2024-05-21 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/1183 places, 216/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 144/1183 places, 216/2478 transitions.
Support contains 7 out of 144 places after structural reductions.
[2024-05-21 21:51:33] [INFO ] Flatten gal took : 41 ms
[2024-05-21 21:51:33] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:51:33] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 970 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 21:51:33] [INFO ] Invariant cache hit.
[2024-05-21 21:51:34] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 21:51:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:51:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 21:51:34] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-21 21:51:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:51:34] [INFO ] After 49ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-21 21:51:34] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 21:51:34] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 216/216 transitions.
Graph (complete) has 488 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 143 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 138 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 138 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 138 transition count 204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 134 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 134 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 134 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 28 place count 131 transition count 191
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 131 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 131 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 128 transition count 183
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 128 transition count 183
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 40 place count 126 transition count 180
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 126 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 126 transition count 179
Applied a total of 43 rules in 38 ms. Remains 126 /144 variables (removed 18) and now considering 179/216 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 126/144 places, 179/216 transitions.
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42992 steps, run visited all 1 properties in 178 ms. (steps per millisecond=241 )
Probabilistic random walk after 42992 steps, saw 20109 distinct states, run finished after 178 ms. (steps per millisecond=241 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 523 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 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(F(p0)))'
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 138 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 138 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 138 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 134 transition count 194
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 134 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 134 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 132 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 132 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 132 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 130 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 129 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 129 transition count 181
Applied a total of 36 rules in 17 ms. Remains 129 /144 variables (removed 15) and now considering 181/216 (removed 35) transitions.
// Phase 1: matrix 181 rows 129 cols
[2024-05-21 21:51:34] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 21:51:34] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 21:51:34] [INFO ] Invariant cache hit.
[2024-05-21 21:51:35] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 21:51:35] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-21 21:51:35] [INFO ] Invariant cache hit.
[2024-05-21 21:51:35] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/144 places, 181/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 129/144 places, 181/216 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 212 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-03 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 s123 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 465 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-03 finished in 1569 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 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 208
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 139 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 135 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 135 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 135 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 132 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 132 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 132 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 31 place count 129 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 129 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 127 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 127 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 127 transition count 182
Applied a total of 39 rules in 58 ms. Remains 127 /144 variables (removed 17) and now considering 182/216 (removed 34) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 21:51:36] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:51:36] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 21:51:36] [INFO ] Invariant cache hit.
[2024-05-21 21:51:36] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:51:36] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-21 21:51:36] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 21:51:36] [INFO ] Invariant cache hit.
[2024-05-21 21:51:36] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/144 places, 182/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 544 ms. Remains : 127/144 places, 182/216 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-06 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 s64 s45)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23024 reset in 221 ms.
Product exploration explored 100000 steps with 22985 reset in 176 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 43064 steps, run visited all 1 properties in 80 ms. (steps per millisecond=538 )
Probabilistic random walk after 43064 steps, saw 20127 distinct states, run finished after 81 ms. (steps per millisecond=531 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 16 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 21:51:37] [INFO ] Invariant cache hit.
[2024-05-21 21:51:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 21:51:37] [INFO ] Invariant cache hit.
[2024-05-21 21:51:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:51:38] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-21 21:51:38] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-21 21:51:38] [INFO ] Invariant cache hit.
[2024-05-21 21:51:38] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 460 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 43064 steps, run visited all 1 properties in 82 ms. (steps per millisecond=525 )
Probabilistic random walk after 43064 steps, saw 20127 distinct states, run finished after 83 ms. (steps per millisecond=518 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22992 reset in 138 ms.
Product exploration explored 100000 steps with 23062 reset in 142 ms.
Built C files in :
/tmp/ltsmin11992191905146314937
[2024-05-21 21:51:38] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2024-05-21 21:51:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:51:38] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2024-05-21 21:51:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:51:38] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2024-05-21 21:51:38] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:51:38] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11992191905146314937
Running compilation step : cd /tmp/ltsmin11992191905146314937;'/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 450 ms.
Running link step : cd /tmp/ltsmin11992191905146314937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11992191905146314937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11086883173867235508.hoa' '--buchi-type=spotba'
LTSmin run took 292 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-06 finished in 3566 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(F(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 139 transition count 208
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 139 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 139 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 136 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 136 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 134 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 134 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 132 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 132 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 130 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 130 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 130 transition count 184
Applied a total of 32 rules in 12 ms. Remains 130 /144 variables (removed 14) and now considering 184/216 (removed 32) transitions.
// Phase 1: matrix 184 rows 130 cols
[2024-05-21 21:51:39] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:51:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 21:51:39] [INFO ] Invariant cache hit.
[2024-05-21 21:51:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:51:40] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 21:51:40] [INFO ] Invariant cache hit.
[2024-05-21 21:51:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/144 places, 184/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 130/144 places, 184/216 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-08 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 s115 s77)], 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]]
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 467 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-08 finished in 906 ms.
All properties solved by simple procedures.
Total runtime 9279 ms.

BK_STOP 1716328301519

--------------------
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="DBSingleClientW-PT-d2m06"
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 DBSingleClientW-PT-d2m06, 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 r109-tall-171624208400352"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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