fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475200339
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
419.871 12076.00 22825.00 1229.90 FFTTFFTTFTTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475200339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DBSingleClientW-PT-d2m10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475200339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 15:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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-d2m10-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678256455893

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 06:20:57] [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]
[2023-03-08 06:20:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:20:57] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-08 06:20:57] [INFO ] Transformed 4763 places.
[2023-03-08 06:20:57] [INFO ] Transformed 2478 transitions.
[2023-03-08 06:20:57] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1138 transition count 2283
Discarding 386 places :
Symmetric choice reduction at 1 with 386 rule applications. Total rules 626 place count 752 transition count 1234
Iterating global reduction 1 with 386 rules applied. Total rules applied 1012 place count 752 transition count 1234
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1030 place count 752 transition count 1216
Discarding 311 places :
Symmetric choice reduction at 2 with 311 rule applications. Total rules 1341 place count 441 transition count 905
Iterating global reduction 2 with 311 rules applied. Total rules applied 1652 place count 441 transition count 905
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1664 place count 441 transition count 893
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 1898 place count 207 transition count 560
Iterating global reduction 3 with 234 rules applied. Total rules applied 2132 place count 207 transition count 560
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 2336 place count 207 transition count 356
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2358 place count 185 transition count 316
Iterating global reduction 4 with 22 rules applied. Total rules applied 2380 place count 185 transition count 316
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2390 place count 185 transition count 306
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2405 place count 170 transition count 291
Iterating global reduction 5 with 15 rules applied. Total rules applied 2420 place count 170 transition count 291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2424 place count 170 transition count 287
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2436 place count 158 transition count 275
Iterating global reduction 6 with 12 rules applied. Total rules applied 2448 place count 158 transition count 275
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2459 place count 158 transition count 264
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2461 place count 156 transition count 260
Iterating global reduction 7 with 2 rules applied. Total rules applied 2463 place count 156 transition count 260
Applied a total of 2463 rules in 188 ms. Remains 156 /1183 variables (removed 1027) and now considering 260/2478 (removed 2218) transitions.
// Phase 1: matrix 260 rows 156 cols
[2023-03-08 06:20:58] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-08 06:20:58] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-08 06:20:58] [INFO ] Invariant cache hit.
[2023-03-08 06:20:58] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-08 06:20:59] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-08 06:20:59] [INFO ] Invariant cache hit.
[2023-03-08 06:20:59] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/1183 places, 260/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1042 ms. Remains : 156/1183 places, 260/2478 transitions.
Support contains 10 out of 156 places after structural reductions.
[2023-03-08 06:21:00] [INFO ] Flatten gal took : 44 ms
[2023-03-08 06:21:00] [INFO ] Flatten gal took : 19 ms
[2023-03-08 06:21:00] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 946 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 990 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 06:21:01] [INFO ] Invariant cache hit.
[2023-03-08 06:21:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:21:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 06:21:01] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 06:21:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 06:21:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:21:01] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 06:21:01] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-08 06:21:01] [INFO ] After 66ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-08 06:21:01] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-08 06:21:01] [INFO ] After 421ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 260/260 transitions.
Graph (complete) has 543 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 154 transition count 253
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 149 transition count 243
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 149 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 146 transition count 239
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 146 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 146 transition count 236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 144 transition count 234
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 144 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 144 transition count 231
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 141 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 141 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 141 transition count 216
Applied a total of 41 rules in 47 ms. Remains 141 /156 variables (removed 15) and now considering 216/260 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 141/156 places, 216/260 transitions.
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 971 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 959 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Finished probabilistic random walk after 59430 steps, run visited all 4 properties in 415 ms. (steps per millisecond=143 )
Probabilistic random walk after 59430 steps, saw 26733 distinct states, run finished after 415 ms. (steps per millisecond=143 ) properties seen :4
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 22 stable transitions
Graph (complete) has 585 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 260/260 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 257
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 145 transition count 241
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 145 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 145 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 139 transition count 230
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 139 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 42 place count 139 transition count 226
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 47 place count 134 transition count 215
Iterating global reduction 3 with 5 rules applied. Total rules applied 52 place count 134 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 57 place count 134 transition count 210
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 62 place count 129 transition count 181
Iterating global reduction 4 with 5 rules applied. Total rules applied 67 place count 129 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 129 transition count 180
Applied a total of 68 rules in 14 ms. Remains 129 /156 variables (removed 27) and now considering 180/260 (removed 80) transitions.
// Phase 1: matrix 180 rows 129 cols
[2023-03-08 06:21:02] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 06:21:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 06:21:02] [INFO ] Invariant cache hit.
[2023-03-08 06:21:02] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 06:21:03] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 06:21:03] [INFO ] Invariant cache hit.
[2023-03-08 06:21:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/156 places, 180/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 129/156 places, 180/260 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLCardinality-06 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 337 ms.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 464 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 :(X p0)
Knowledge based reduction with 3 factoid took 69 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-d2m10-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLCardinality-06 finished in 1329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p0)))))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 260/260 transitions.
Graph (complete) has 585 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 155 transition count 257
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 13 place count 146 transition count 240
Iterating global reduction 1 with 9 rules applied. Total rules applied 22 place count 146 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 146 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 140 transition count 230
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 140 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 140 transition count 227
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 43 place count 135 transition count 215
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 135 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 52 place count 135 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 56 place count 131 transition count 196
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 131 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 131 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 130 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 130 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 64 place count 130 transition count 193
Applied a total of 64 rules in 44 ms. Remains 130 /156 variables (removed 26) and now considering 193/260 (removed 67) transitions.
// Phase 1: matrix 193 rows 130 cols
[2023-03-08 06:21:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 06:21:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 06:21:04] [INFO ] Invariant cache hit.
[2023-03-08 06:21:04] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 06:21:04] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 06:21:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 06:21:04] [INFO ] Invariant cache hit.
[2023-03-08 06:21:04] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/156 places, 193/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 470 ms. Remains : 130/156 places, 193/260 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s89 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLCardinality-08 finished in 519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 260/260 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 257
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 145 transition count 238
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 145 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 145 transition count 236
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 139 transition count 228
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 139 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 139 transition count 226
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 45 place count 134 transition count 214
Iterating global reduction 3 with 5 rules applied. Total rules applied 50 place count 134 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 55 place count 134 transition count 209
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 60 place count 129 transition count 180
Iterating global reduction 4 with 5 rules applied. Total rules applied 65 place count 129 transition count 180
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 128 transition count 179
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 128 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 128 transition count 178
Applied a total of 68 rules in 18 ms. Remains 128 /156 variables (removed 28) and now considering 178/260 (removed 82) transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 06:21:04] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 06:21:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 06:21:04] [INFO ] Invariant cache hit.
[2023-03-08 06:21:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 06:21:04] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-08 06:21:04] [INFO ] Invariant cache hit.
[2023-03-08 06:21:04] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/156 places, 178/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 128/156 places, 178/260 transitions.
Stuttering acceptance computed with spot in 404 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s44 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLCardinality-10 finished in 1213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 260/260 transitions.
Graph (complete) has 585 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 155 transition count 257
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 13 place count 146 transition count 239
Iterating global reduction 1 with 9 rules applied. Total rules applied 22 place count 146 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 146 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 141 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 141 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 141 transition count 228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 137 transition count 223
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 137 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 48 place count 137 transition count 219
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 53 place count 132 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 58 place count 132 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 132 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 131 transition count 195
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 131 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 131 transition count 194
Applied a total of 62 rules in 32 ms. Remains 131 /156 variables (removed 25) and now considering 194/260 (removed 66) transitions.
// Phase 1: matrix 194 rows 131 cols
[2023-03-08 06:21:05] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 06:21:05] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 06:21:05] [INFO ] Invariant cache hit.
[2023-03-08 06:21:05] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 06:21:06] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-08 06:21:06] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 06:21:06] [INFO ] Invariant cache hit.
[2023-03-08 06:21:06] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/156 places, 194/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 131/156 places, 194/260 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s9 s91)], 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 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLCardinality-13 finished in 531 ms.
All properties solved by simple procedures.
Total runtime 8935 ms.

BK_STOP 1678256467969

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-d2m10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m10, 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 r101-tall-167814475200339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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