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-171624208300298.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-d0m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208300298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 7.8K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 119K 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-d0m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716324826001

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:53:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:53:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:53:47] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-21 20:53:47] [INFO ] Transformed 553 places.
[2024-05-21 20:53:47] [INFO ] Transformed 150 transitions.
[2024-05-21 20:53:47] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 89 transition count 124
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 89 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 122
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 82 transition count 115
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 82 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 81 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 81 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 81 transition count 112
Applied a total of 63 rules in 24 ms. Remains 81 /109 variables (removed 28) and now considering 112/150 (removed 38) transitions.
// Phase 1: matrix 112 rows 81 cols
[2024-05-21 20:53:47] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 20:53:48] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-21 20:53:48] [INFO ] Invariant cache hit.
[2024-05-21 20:53:48] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 20:53:48] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-21 20:53:48] [INFO ] Invariant cache hit.
[2024-05-21 20:53:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/109 places, 112/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 81/109 places, 112/150 transitions.
Support contains 30 out of 81 places after structural reductions.
[2024-05-21 20:53:48] [INFO ] Flatten gal took : 27 ms
[2024-05-21 20:53:48] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:53:48] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 27 out of 81 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 61 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-21 20:53:49] [INFO ] Invariant cache hit.
[2024-05-21 20:53:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:53:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:49] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2024-05-21 20:53:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:53:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 20:53:50] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2024-05-21 20:53:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 20:53:50] [INFO ] After 147ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2024-05-21 20:53:50] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-21 20:53:50] [INFO ] After 1081ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 13 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 112/112 transitions.
Graph (complete) has 240 edges and 81 vertex of which 80 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 75 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 75 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 73 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 72 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 72 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 72 transition count 91
Applied a total of 20 rules in 27 ms. Remains 72 /81 variables (removed 9) and now considering 91/112 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 72/81 places, 91/112 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 998 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 541 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 91 rows 72 cols
[2024-05-21 20:53:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:53:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-21 20:53:51] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-21 20:53:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:51] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-21 20:53:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 20:53:51] [INFO ] After 88ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-21 20:53:52] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-21 20:53:52] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 45 ms.
Support contains 12 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 72/72 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 540 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 504 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 515 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-21 20:53:52] [INFO ] Invariant cache hit.
[2024-05-21 20:53:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:53:53] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-21 20:53:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-21 20:53:53] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-21 20:53:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 20:53:53] [INFO ] After 80ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-21 20:53:53] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-21 20:53:53] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 57 ms.
Support contains 11 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 90
Applied a total of 2 rules in 7 ms. Remains 71 /72 variables (removed 1) and now considering 90/91 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 71/72 places, 90/91 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 517 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 1003 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 538 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Finished probabilistic random walk after 34140 steps, run visited all 9 properties in 74 ms. (steps per millisecond=461 )
Probabilistic random walk after 34140 steps, saw 14578 distinct states, run finished after 74 ms. (steps per millisecond=461 ) properties seen :9
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 269 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||X(p2)||p0)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 87
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 64 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 64 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 62 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 62 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 59 transition count 69
Applied a total of 50 rules in 15 ms. Remains 59 /81 variables (removed 22) and now considering 69/112 (removed 43) transitions.
// Phase 1: matrix 69 rows 59 cols
[2024-05-21 20:53:54] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:53:54] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 20:53:54] [INFO ] Invariant cache hit.
[2024-05-21 20:53:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:53:54] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-21 20:53:54] [INFO ] Invariant cache hit.
[2024-05-21 20:53:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 69/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 59/81 places, 69/112 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 442 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (LT s1 1) (LT s25 1)), p0:(OR (LT s1 1) (LT s32 1)), p1:(AND (GEQ s1 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 1127 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(G(p1))&&p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 64 transition count 75
Applied a total of 38 rules in 12 ms. Remains 64 /81 variables (removed 17) and now considering 75/112 (removed 37) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 20:53:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:53:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:53:55] [INFO ] Invariant cache hit.
[2024-05-21 20:53:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:53:55] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-21 20:53:55] [INFO ] Invariant cache hit.
[2024-05-21 20:53:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/81 places, 75/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 64/81 places, 75/112 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-02 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 82
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 61 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 60 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 60 transition count 68
Applied a total of 46 rules in 18 ms. Remains 60 /81 variables (removed 21) and now considering 68/112 (removed 44) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 20:53:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-21 20:53:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/81 places, 68/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 60/81 places, 68/112 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-03 finished in 274 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 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 82
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 63 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 62 transition count 71
Applied a total of 42 rules in 14 ms. Remains 62 /81 variables (removed 19) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 62 cols
[2024-05-21 20:53:56] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 20:53:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/81 places, 71/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 62/81 places, 71/112 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s35 1))], 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 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-05 finished in 231 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 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 83
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 64 transition count 77
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 61 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 60 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 59 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 59 transition count 66
Applied a total of 49 rules in 9 ms. Remains 59 /81 variables (removed 22) and now considering 66/112 (removed 46) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 20:53:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 66/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 59/81 places, 66/112 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-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:(AND (GEQ s18 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-06 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((p0||G((p1 U p0)))))&&F(p2)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 66 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 66 transition count 83
Applied a total of 30 rules in 14 ms. Remains 66 /81 variables (removed 15) and now considering 83/112 (removed 29) transitions.
// Phase 1: matrix 83 rows 66 cols
[2024-05-21 20:53:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:53:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:53:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:53:56] [INFO ] Invariant cache hit.
[2024-05-21 20:53:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/81 places, 83/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 66/81 places, 83/112 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s59 1) (GEQ s1 1) (GEQ s52 1)), p0:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-07 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 91
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 67 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 65 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 62 transition count 74
Applied a total of 44 rules in 7 ms. Remains 62 /81 variables (removed 19) and now considering 74/112 (removed 38) transitions.
// Phase 1: matrix 74 rows 62 cols
[2024-05-21 20:53:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:53:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:53:57] [INFO ] Invariant cache hit.
[2024-05-21 20:53:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 20:53:57] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-21 20:53:57] [INFO ] Invariant cache hit.
[2024-05-21 20:53:57] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/81 places, 74/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 62/81 places, 74/112 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s43 1)) (AND (GEQ s1 1) (GEQ s59 1))), p1:(OR (LT s6 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-08 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!F(p0) U X(F(p1))) U p2)||G(!p0)))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Applied a total of 44 rules in 13 ms. Remains 61 /81 variables (removed 20) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 20:53:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:53:57] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:53:57] [INFO ] Invariant cache hit.
[2024-05-21 20:53:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:53:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 20:53:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:53:57] [INFO ] Invariant cache hit.
[2024-05-21 20:53:57] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/81 places, 71/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 61/81 places, 71/112 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) p0), (OR (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s60 1)), p2:(AND (GEQ s9 1) (GEQ s46 1)), p0:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1038 steps with 236 reset in 10 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-09 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 63 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 72
Applied a total of 40 rules in 12 ms. Remains 63 /81 variables (removed 18) and now considering 72/112 (removed 40) transitions.
// Phase 1: matrix 72 rows 63 cols
[2024-05-21 20:53:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:53:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 20:53:57] [INFO ] Invariant cache hit.
[2024-05-21 20:53:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:53:58] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 20:53:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:53:58] [INFO ] Invariant cache hit.
[2024-05-21 20:53:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/81 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 63/81 places, 72/112 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s58 1))], 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 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-10 finished in 236 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 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Applied a total of 44 rules in 5 ms. Remains 61 /81 variables (removed 20) and now considering 71/112 (removed 41) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 20:53:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:53:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:53:58] [INFO ] Invariant cache hit.
[2024-05-21 20:53:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:53:58] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-21 20:53:58] [INFO ] Invariant cache hit.
[2024-05-21 20:53:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 71/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 61/81 places, 71/112 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s59 1))], 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 122 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 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 18 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-d0m09-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-11 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 65 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 63 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 63 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 60 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 60 transition count 72
Applied a total of 48 rules in 17 ms. Remains 60 /81 variables (removed 21) and now considering 72/112 (removed 40) transitions.
// Phase 1: matrix 72 rows 60 cols
[2024-05-21 20:53:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:53:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:53:58] [INFO ] Invariant cache hit.
[2024-05-21 20:53:58] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 20:53:58] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-21 20:53:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:53:58] [INFO ] Invariant cache hit.
[2024-05-21 20:53:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/81 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 60/81 places, 72/112 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s26 1)), p0:(AND (GEQ s1 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-12 finished in 265 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' '!((p0 U (G((G(p1) U p2))||X(G(p3)))))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 66 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 62 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 61 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 61 transition count 70
Applied a total of 45 rules in 10 ms. Remains 61 /81 variables (removed 20) and now considering 70/112 (removed 42) transitions.
// Phase 1: matrix 70 rows 61 cols
[2024-05-21 20:53:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:53:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:53:59] [INFO ] Invariant cache hit.
[2024-05-21 20:53:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 20:53:59] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-21 20:53:59] [INFO ] Invariant cache hit.
[2024-05-21 20:53:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 70/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 61/81 places, 70/112 transitions.
Stuttering acceptance computed with spot in 540 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 p0 p3) (AND p1 p0 p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p1 p0 (NOT p3))), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={0, 1} source=1 dest: 6}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0, 1, 2} source=1 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 0}, { cond=(AND p1 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=4 dest: 2}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 p0 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=5 dest: 5}, { cond=(AND p2 p1 p0 (NOT p3)), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={1, 2} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0 p3), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 6}], [{ cond=true, acceptance={0, 1, 2} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 9}, { cond=(OR p2 p1), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 2}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p2 p1 p3), acceptance={} source=11 dest: 11}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=12 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p2 p1), acceptance={} source=12 dest: 12}]], initial=1, aps=[p3:(AND (GEQ s1 1) (GEQ s51 1)), p2:(AND (GEQ s17 1) (GEQ s22 1)), p1:(AND (GEQ s1 1) (GEQ s58 1)), p0:(AND (GEQ s1 1) (GEQ s33 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-13 finished in 731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(p1))) U X(X(X(!p0))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 85
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 63 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 63 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 60 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 60 transition count 70
Applied a total of 46 rules in 10 ms. Remains 60 /81 variables (removed 21) and now considering 70/112 (removed 42) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 20:53:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:53:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:53:59] [INFO ] Invariant cache hit.
[2024-05-21 20:53:59] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:53:59] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-21 20:53:59] [INFO ] Invariant cache hit.
[2024-05-21 20:53:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/81 places, 70/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 60/81 places, 70/112 transitions.
Stuttering acceptance computed with spot in 647 ms :[p0, p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, true, p0, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 9}, { cond=p0, acceptance={} source=4 dest: 10}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=p0, acceptance={0} source=9 dest: 9}, { cond=p0, acceptance={0} source=9 dest: 11}, { cond=p0, acceptance={0} source=9 dest: 12}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 8}], [{ cond=(NOT p1), acceptance={} source=11 dest: 8}], [{ cond=p0, acceptance={} source=12 dest: 11}, { cond=true, acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s23 1)), p1:(AND (GEQ s1 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26662 reset in 86 ms.
Product exploration explored 100000 steps with 26728 reset in 98 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 13 states, 19 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p0, p0, p0, p0, true, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, p0, true, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 20:54:01] [INFO ] Invariant cache hit.
[2024-05-21 20:54:01] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:54:01] [INFO ] Invariant cache hit.
[2024-05-21 20:54:01] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:54:01] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 20:54:01] [INFO ] Invariant cache hit.
[2024-05-21 20:54:01] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p0, p0, p0, p0, true, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 26677 reset in 85 ms.
Product exploration explored 100000 steps with 26619 reset in 89 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 205 ms :[p0, p0, p0, p0, true, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 58 transition count 64
Applied a total of 6 rules in 11 ms. Remains 58 /60 variables (removed 2) and now considering 64/70 (removed 6) transitions.
[2024-05-21 20:54:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 20:54:03] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:54:03] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/60 places, 64/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 58/60 places, 64/70 transitions.
Built C files in :
/tmp/ltsmin7051047731816709685
[2024-05-21 20:54:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7051047731816709685
Running compilation step : cd /tmp/ltsmin7051047731816709685;'/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 250 ms.
Running link step : cd /tmp/ltsmin7051047731816709685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7051047731816709685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10666327802212650067.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-15 finished in 4016 ms.
All properties solved by simple procedures.
Total runtime 16251 ms.

BK_STOP 1716324844595

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-d0m09"
export BK_EXAMINATION="LTLFireability"
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-d0m09, examination is LTLFireability"
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-171624208300298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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