Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 15:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678282510823

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 13:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 13:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 13:35:12] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-08 13:35:12] [INFO ] Transformed 4763 places.
[2023-03-08 13:35:12] [INFO ] Transformed 2478 transitions.
[2023-03-08 13:35:12] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 370 places :
Symmetric choice reduction at 1 with 370 rule applications. Total rules 615 place count 767 transition count 1499
Iterating global reduction 1 with 370 rules applied. Total rules applied 985 place count 767 transition count 1499
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 1057 place count 767 transition count 1427
Discarding 293 places :
Symmetric choice reduction at 2 with 293 rule applications. Total rules 1350 place count 474 transition count 1134
Iterating global reduction 2 with 293 rules applied. Total rules applied 1643 place count 474 transition count 1134
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1650 place count 474 transition count 1127
Discarding 216 places :
Symmetric choice reduction at 3 with 216 rule applications. Total rules 1866 place count 258 transition count 830
Iterating global reduction 3 with 216 rules applied. Total rules applied 2082 place count 258 transition count 830
Ensure Unique test removed 283 transitions
Reduce isomorphic transitions removed 283 transitions.
Iterating post reduction 3 with 283 rules applied. Total rules applied 2365 place count 258 transition count 547
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2378 place count 245 transition count 528
Iterating global reduction 4 with 13 rules applied. Total rules applied 2391 place count 245 transition count 528
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2407 place count 245 transition count 512
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2414 place count 238 transition count 505
Iterating global reduction 5 with 7 rules applied. Total rules applied 2421 place count 238 transition count 505
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2424 place count 238 transition count 502
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2429 place count 233 transition count 497
Iterating global reduction 6 with 5 rules applied. Total rules applied 2434 place count 233 transition count 497
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2438 place count 233 transition count 493
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2440 place count 231 transition count 489
Iterating global reduction 7 with 2 rules applied. Total rules applied 2442 place count 231 transition count 489
Applied a total of 2442 rules in 201 ms. Remains 231 /1183 variables (removed 952) and now considering 489/2478 (removed 1989) transitions.
// Phase 1: matrix 489 rows 231 cols
[2023-03-08 13:35:13] [INFO ] Computed 2 place invariants in 25 ms
[2023-03-08 13:35:13] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-08 13:35:13] [INFO ] Invariant cache hit.
[2023-03-08 13:35:13] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-08 13:35:14] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2023-03-08 13:35:14] [INFO ] Invariant cache hit.
[2023-03-08 13:35:14] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/1183 places, 489/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 231/1183 places, 489/2478 transitions.
Support contains 46 out of 231 places after structural reductions.
[2023-03-08 13:35:15] [INFO ] Flatten gal took : 57 ms
[2023-03-08 13:35:15] [INFO ] Flatten gal took : 32 ms
[2023-03-08 13:35:15] [INFO ] Input system was already deterministic with 489 transitions.
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :2
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) 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 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2023-03-08 13:35:16] [INFO ] Invariant cache hit.
[2023-03-08 13:35:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:35:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:17] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:29
[2023-03-08 13:35:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:35:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:19] [INFO ] After 1986ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :28
[2023-03-08 13:35:19] [INFO ] State equation strengthened by 266 read => feed constraints.
[2023-03-08 13:35:22] [INFO ] After 3218ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :2 sat :28
[2023-03-08 13:35:25] [INFO ] After 6042ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :28
Attempting to minimize the solution found.
Minimization took 4395 ms.
[2023-03-08 13:35:30] [INFO ] After 12942ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :28
Fused 30 Parikh solutions to 28 different solutions.
Parikh walk visited 1 properties in 901 ms.
Support contains 38 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 489/489 transitions.
Graph (complete) has 876 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 230 transition count 482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 228 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 228 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 226 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 226 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 224 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 224 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 224 transition count 467
Applied a total of 22 rules in 87 ms. Remains 224 /231 variables (removed 7) and now considering 467/489 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 224/231 places, 467/489 transitions.
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Finished probabilistic random walk after 81398 steps, run visited all 27 properties in 625 ms. (steps per millisecond=130 )
Probabilistic random walk after 81398 steps, saw 35356 distinct states, run finished after 625 ms. (steps per millisecond=130 ) properties seen :27
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 951 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(G(p1))))||G(p2))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 364
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 204 transition count 361
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 80 place count 181 transition count 333
Iterating global reduction 1 with 23 rules applied. Total rules applied 103 place count 181 transition count 333
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 111 place count 181 transition count 325
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 131 place count 161 transition count 291
Iterating global reduction 2 with 20 rules applied. Total rules applied 151 place count 161 transition count 291
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 160 place count 161 transition count 282
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 173 place count 148 transition count 257
Iterating global reduction 3 with 13 rules applied. Total rules applied 186 place count 148 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 189 place count 148 transition count 254
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 198 place count 139 transition count 245
Iterating global reduction 4 with 9 rules applied. Total rules applied 207 place count 139 transition count 245
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 214 place count 139 transition count 238
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 219 place count 134 transition count 223
Iterating global reduction 5 with 5 rules applied. Total rules applied 224 place count 134 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 228 place count 134 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 231 place count 131 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 234 place count 131 transition count 199
Applied a total of 234 rules in 24 ms. Remains 131 /231 variables (removed 100) and now considering 199/489 (removed 290) transitions.
// Phase 1: matrix 199 rows 131 cols
[2023-03-08 13:35:33] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 13:35:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 13:35:33] [INFO ] Invariant cache hit.
[2023-03-08 13:35:33] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 13:35:33] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 13:35:33] [INFO ] Invariant cache hit.
[2023-03-08 13:35:33] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/231 places, 199/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 131/231 places, 199/489 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s71 1)), p0:(AND (GEQ s1 1) (GEQ s95 1)), p1:(AND (GEQ s48 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(F(p2)&&p1)))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 367
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 204 transition count 363
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 183 transition count 333
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 183 transition count 333
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 107 place count 183 transition count 326
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 126 place count 164 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 145 place count 164 transition count 295
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 164 transition count 286
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 167 place count 151 transition count 261
Iterating global reduction 3 with 13 rules applied. Total rules applied 180 place count 151 transition count 261
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 190 place count 151 transition count 251
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 198 place count 143 transition count 243
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 143 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 212 place count 143 transition count 237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 217 place count 138 transition count 222
Iterating global reduction 5 with 5 rules applied. Total rules applied 222 place count 138 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 138 transition count 219
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 228 place count 135 transition count 199
Iterating global reduction 6 with 3 rules applied. Total rules applied 231 place count 135 transition count 199
Applied a total of 231 rules in 29 ms. Remains 135 /231 variables (removed 96) and now considering 199/489 (removed 290) transitions.
// Phase 1: matrix 199 rows 135 cols
[2023-03-08 13:35:33] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 13:35:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 13:35:33] [INFO ] Invariant cache hit.
[2023-03-08 13:35:34] [INFO ] State equation strengthened by 70 read => feed constraints.
[2023-03-08 13:35:34] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 13:35:34] [INFO ] Invariant cache hit.
[2023-03-08 13:35:34] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/231 places, 199/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 135/231 places, 199/489 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s128 1) (OR (LT s8 1) (LT s56 1))), p2:(AND (GEQ s1 1) (GEQ s129 1)), p0:(AND (GEQ s1 1) (GEQ s128 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, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-01 finished in 676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 205 transition count 377
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 205 transition count 377
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 205 transition count 373
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 77 place count 184 transition count 346
Iterating global reduction 1 with 21 rules applied. Total rules applied 98 place count 184 transition count 346
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 107 place count 184 transition count 337
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 125 place count 166 transition count 306
Iterating global reduction 2 with 18 rules applied. Total rules applied 143 place count 166 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 153 place count 166 transition count 296
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 164 place count 155 transition count 277
Iterating global reduction 3 with 11 rules applied. Total rules applied 175 place count 155 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 182 place count 155 transition count 270
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 188 place count 149 transition count 264
Iterating global reduction 4 with 6 rules applied. Total rules applied 194 place count 149 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 149 transition count 262
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 147 transition count 260
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 147 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 203 place count 147 transition count 257
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 206 place count 144 transition count 237
Iterating global reduction 6 with 3 rules applied. Total rules applied 209 place count 144 transition count 237
Applied a total of 209 rules in 54 ms. Remains 144 /231 variables (removed 87) and now considering 237/489 (removed 252) transitions.
// Phase 1: matrix 237 rows 144 cols
[2023-03-08 13:35:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 13:35:34] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 13:35:34] [INFO ] Invariant cache hit.
[2023-03-08 13:35:34] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 13:35:35] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-08 13:35:35] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 13:35:35] [INFO ] Invariant cache hit.
[2023-03-08 13:35:35] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/231 places, 237/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 144/231 places, 237/489 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s135 1)) (AND (GEQ s26 1) (GEQ s116 1) (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s1 1) (GEQ s138 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-d2m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-02 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p2)&&p1)||p0))))'
Support contains 7 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 203 transition count 360
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 203 transition count 360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 203 transition count 356
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 181 transition count 325
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 181 transition count 325
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 111 place count 181 transition count 318
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 130 place count 162 transition count 286
Iterating global reduction 2 with 19 rules applied. Total rules applied 149 place count 162 transition count 286
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 157 place count 162 transition count 278
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 170 place count 149 transition count 254
Iterating global reduction 3 with 13 rules applied. Total rules applied 183 place count 149 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 149 transition count 251
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 195 place count 140 transition count 242
Iterating global reduction 4 with 9 rules applied. Total rules applied 204 place count 140 transition count 242
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 211 place count 140 transition count 235
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 216 place count 135 transition count 220
Iterating global reduction 5 with 5 rules applied. Total rules applied 221 place count 135 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 224 place count 135 transition count 217
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 227 place count 132 transition count 197
Iterating global reduction 6 with 3 rules applied. Total rules applied 230 place count 132 transition count 197
Applied a total of 230 rules in 18 ms. Remains 132 /231 variables (removed 99) and now considering 197/489 (removed 292) transitions.
// Phase 1: matrix 197 rows 132 cols
[2023-03-08 13:35:35] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 13:35:35] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 13:35:35] [INFO ] Invariant cache hit.
[2023-03-08 13:35:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 13:35:35] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-08 13:35:35] [INFO ] Invariant cache hit.
[2023-03-08 13:35:35] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/231 places, 197/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 132/231 places, 197/489 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s92 1)) (AND (GEQ s42 1) (GEQ s106 1))), p1:(AND (GEQ s10 1) (GEQ s100 1)), p2:(AND (GEQ s1 1) (GEQ s92 1) (GEQ s1 1) (GEQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-03 finished in 578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!(p0 U p1)&&X((F(p0)||G(p2)))) U p2))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 372
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 204 transition count 368
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 182 transition count 338
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 182 transition count 338
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 110 place count 182 transition count 330
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 129 place count 163 transition count 297
Iterating global reduction 2 with 19 rules applied. Total rules applied 148 place count 163 transition count 297
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 158 place count 163 transition count 287
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 170 place count 151 transition count 267
Iterating global reduction 3 with 12 rules applied. Total rules applied 182 place count 151 transition count 267
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 186 place count 151 transition count 263
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 193 place count 144 transition count 256
Iterating global reduction 4 with 7 rules applied. Total rules applied 200 place count 144 transition count 256
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 207 place count 144 transition count 249
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 211 place count 140 transition count 234
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 140 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 140 transition count 231
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 221 place count 137 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 224 place count 137 transition count 211
Applied a total of 224 rules in 16 ms. Remains 137 /231 variables (removed 94) and now considering 211/489 (removed 278) transitions.
// Phase 1: matrix 211 rows 137 cols
[2023-03-08 13:35:35] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 13:35:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 13:35:35] [INFO ] Invariant cache hit.
[2023-03-08 13:35:35] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 13:35:36] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-08 13:35:36] [INFO ] Invariant cache hit.
[2023-03-08 13:35:36] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/231 places, 211/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 137/231 places, 211/489 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), true, p1, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s117 1)), p1:(OR (AND (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s1 1) (GEQ s131 1))), p0:(AND (GEQ s1 1) (GEQ s67 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]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-08 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&(X(p1)||F(p2)))))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 204 transition count 361
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 204 transition count 361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 204 transition count 357
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 183 transition count 328
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 183 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 106 place count 183 transition count 322
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 126 place count 163 transition count 288
Iterating global reduction 2 with 20 rules applied. Total rules applied 146 place count 163 transition count 288
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 155 place count 163 transition count 279
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 168 place count 150 transition count 258
Iterating global reduction 3 with 13 rules applied. Total rules applied 181 place count 150 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 185 place count 150 transition count 254
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 193 place count 142 transition count 246
Iterating global reduction 4 with 8 rules applied. Total rules applied 201 place count 142 transition count 246
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 208 place count 142 transition count 239
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 212 place count 138 transition count 225
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 138 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 138 transition count 222
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 221 place count 136 transition count 209
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 136 transition count 209
Applied a total of 223 rules in 16 ms. Remains 136 /231 variables (removed 95) and now considering 209/489 (removed 280) transitions.
// Phase 1: matrix 209 rows 136 cols
[2023-03-08 13:35:36] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 13:35:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 13:35:36] [INFO ] Invariant cache hit.
[2023-03-08 13:35:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 13:35:36] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 13:35:36] [INFO ] Invariant cache hit.
[2023-03-08 13:35:36] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/231 places, 209/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 136/231 places, 209/489 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s130 1)), p0:(AND (GEQ s8 1) (GEQ s56 1)), p1:(OR (LT s9 1) (LT s56 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-10 finished in 681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p1&&X(p2)))))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 359
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 355
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 323
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 179 transition count 315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 135 place count 160 transition count 283
Iterating global reduction 2 with 19 rules applied. Total rules applied 154 place count 160 transition count 283
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 163 place count 160 transition count 274
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 175 place count 148 transition count 250
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 148 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 148 transition count 244
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 201 place count 140 transition count 236
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 140 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 215 place count 140 transition count 230
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 221 place count 134 transition count 207
Iterating global reduction 5 with 6 rules applied. Total rules applied 227 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 230 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 232 place count 132 transition count 189
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 132 transition count 189
Applied a total of 234 rules in 24 ms. Remains 132 /231 variables (removed 99) and now considering 189/489 (removed 300) transitions.
// Phase 1: matrix 189 rows 132 cols
[2023-03-08 13:35:37] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 13:35:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 13:35:37] [INFO ] Invariant cache hit.
[2023-03-08 13:35:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:35:37] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-08 13:35:37] [INFO ] Invariant cache hit.
[2023-03-08 13:35:37] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/231 places, 189/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 132/231 places, 189/489 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s126 1)), p1:(OR (LT s1 1) (LT s97 1)), p2:(OR (LT s1 1) (LT s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28568 reset in 256 ms.
Product exploration explored 100000 steps with 28572 reset in 249 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 477 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 431 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 431 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 13:35:39] [INFO ] Invariant cache hit.
[2023-03-08 13:35:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 13:35:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:40] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-08 13:35:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:35:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:40] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-08 13:35:40] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:35:41] [INFO ] After 154ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-08 13:35:41] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-08 13:35:41] [INFO ] After 1366ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 189/189 transitions.
Graph (complete) has 446 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 186
Applied a total of 4 rules in 6 ms. Remains 131 /132 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 131/132 places, 186/189 transitions.
Incomplete random walk after 10000 steps, including 2340 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 431 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Finished probabilistic random walk after 62757 steps, run visited all 5 properties in 417 ms. (steps per millisecond=150 )
Probabilistic random walk after 62757 steps, saw 28492 distinct states, run finished after 418 ms. (steps per millisecond=150 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 490 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 189/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2023-03-08 13:35:43] [INFO ] Invariant cache hit.
[2023-03-08 13:35:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 13:35:43] [INFO ] Invariant cache hit.
[2023-03-08 13:35:43] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:35:43] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 13:35:43] [INFO ] Invariant cache hit.
[2023-03-08 13:35:43] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 132/132 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 477 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (AND p0 p1))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 459 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 13:35:44] [INFO ] Invariant cache hit.
[2023-03-08 13:35:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:35:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 13:35:44] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 13:35:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-08 13:35:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:44] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 13:35:44] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:35:44] [INFO ] After 154ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 13:35:44] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-08 13:35:45] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 189/189 transitions.
Graph (complete) has 446 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 186
Applied a total of 4 rules in 5 ms. Remains 131 /132 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 131/132 places, 186/189 transitions.
Incomplete random walk after 10000 steps, including 2321 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 435 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 419 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Finished probabilistic random walk after 62757 steps, run visited all 5 properties in 341 ms. (steps per millisecond=184 )
Probabilistic random walk after 62757 steps, saw 28492 distinct states, run finished after 341 ms. (steps per millisecond=184 ) properties seen :5
Knowledge obtained : [(AND p1 p0 p2), (X (X (AND p0 p1))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 4 factoid took 374 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28600 reset in 178 ms.
Product exploration explored 100000 steps with 28553 reset in 228 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 189/189 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2023-03-08 13:35:47] [INFO ] Invariant cache hit.
[2023-03-08 13:35:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 13:35:47] [INFO ] Invariant cache hit.
[2023-03-08 13:35:47] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:35:47] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 13:35:47] [INFO ] Invariant cache hit.
[2023-03-08 13:35:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 132/132 places, 189/189 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-11 finished in 10593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U (F(p1) U p2)))||G(p3)))'
Support contains 5 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 205 transition count 368
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 205 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 205 transition count 364
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 185 transition count 335
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 185 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 185 transition count 329
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 119 place count 168 transition count 303
Iterating global reduction 2 with 17 rules applied. Total rules applied 136 place count 168 transition count 303
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 145 place count 168 transition count 294
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 155 place count 158 transition count 274
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 158 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 170 place count 158 transition count 269
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 177 place count 151 transition count 262
Iterating global reduction 4 with 7 rules applied. Total rules applied 184 place count 151 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 189 place count 151 transition count 257
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 194 place count 146 transition count 235
Iterating global reduction 5 with 5 rules applied. Total rules applied 199 place count 146 transition count 235
Applied a total of 199 rules in 15 ms. Remains 146 /231 variables (removed 85) and now considering 235/489 (removed 254) transitions.
// Phase 1: matrix 235 rows 146 cols
[2023-03-08 13:35:47] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 13:35:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-08 13:35:48] [INFO ] Invariant cache hit.
[2023-03-08 13:35:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-08 13:35:48] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-08 13:35:48] [INFO ] Invariant cache hit.
[2023-03-08 13:35:48] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/231 places, 235/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 146/231 places, 235/489 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s83 1)), p2:(AND (GEQ s1 1) (GEQ s139 1)), p1:(AND (GEQ s1 1) (GEQ s136 1)), p0:(AND (GEQ s1 1) (GEQ s94 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-12 finished in 980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 353
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 349
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 318
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 115 place count 179 transition count 311
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 158 transition count 276
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 158 transition count 276
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 158 transition count 267
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 179 place count 145 transition count 242
Iterating global reduction 3 with 13 rules applied. Total rules applied 192 place count 145 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 204 place count 137 transition count 230
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 137 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 218 place count 137 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 224 place count 131 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 230 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 233 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 236 place count 128 transition count 178
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 128 transition count 178
Applied a total of 239 rules in 15 ms. Remains 128 /231 variables (removed 103) and now considering 178/489 (removed 311) transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 13:35:48] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 13:35:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 13:35:48] [INFO ] Invariant cache hit.
[2023-03-08 13:35:48] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:35:49] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-08 13:35:49] [INFO ] Invariant cache hit.
[2023-03-08 13:35:49] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/231 places, 178/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 128/231 places, 178/489 transitions.
Stuttering acceptance computed with spot in 197 ms :[p0, p0, false, false, false]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s45 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37288 reset in 244 ms.
Product exploration explored 100000 steps with 37335 reset in 242 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[p0, p0, false, false, false]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 13:35:50] [INFO ] Invariant cache hit.
[2023-03-08 13:35:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 13:35:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:50] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 13:35:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 13:35:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:35:50] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 13:35:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:35:50] [INFO ] After 26ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 13:35:50] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 13:35:50] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2335 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 44 ms. (steps per millisecond=479 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 45 ms. (steps per millisecond=468 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 483 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 13:35:51] [INFO ] Invariant cache hit.
[2023-03-08 13:35:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 13:35:51] [INFO ] Invariant cache hit.
[2023-03-08 13:35:51] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:35:51] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 13:35:51] [INFO ] Invariant cache hit.
[2023-03-08 13:35:51] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2330 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 13:35:52] [INFO ] Invariant cache hit.
[2023-03-08 13:35:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:35:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 13:35:52] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 13:35:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:35:52] [INFO ] After 12ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:35:52] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:35:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:35:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 13:35:52] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:35:52] [INFO ] After 12ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:35:52] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 13:35:52] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 7 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 35 ms. (steps per millisecond=602 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 35 ms. (steps per millisecond=602 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 205 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 178 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37227 reset in 217 ms.
Product exploration explored 100000 steps with 37366 reset in 205 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 13:35:54] [INFO ] Invariant cache hit.
[2023-03-08 13:35:54] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 13:35:54] [INFO ] Invariant cache hit.
[2023-03-08 13:35:54] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:35:54] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 13:35:54] [INFO ] Invariant cache hit.
[2023-03-08 13:35:54] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 128/128 places, 178/178 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 5819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||X(F(p1)))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 359
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 355
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 323
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 179 transition count 315
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 136 place count 159 transition count 281
Iterating global reduction 2 with 20 rules applied. Total rules applied 156 place count 159 transition count 281
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 165 place count 159 transition count 272
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 177 place count 147 transition count 252
Iterating global reduction 3 with 12 rules applied. Total rules applied 189 place count 147 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 193 place count 147 transition count 248
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 200 place count 140 transition count 241
Iterating global reduction 4 with 7 rules applied. Total rules applied 207 place count 140 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 213 place count 140 transition count 235
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 218 place count 135 transition count 213
Iterating global reduction 5 with 5 rules applied. Total rules applied 223 place count 135 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 135 transition count 210
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 229 place count 132 transition count 190
Iterating global reduction 6 with 3 rules applied. Total rules applied 232 place count 132 transition count 190
Applied a total of 232 rules in 29 ms. Remains 132 /231 variables (removed 99) and now considering 190/489 (removed 299) transitions.
// Phase 1: matrix 190 rows 132 cols
[2023-03-08 13:35:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 13:35:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 13:35:54] [INFO ] Invariant cache hit.
[2023-03-08 13:35:54] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 13:35:54] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-08 13:35:54] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 13:35:54] [INFO ] Invariant cache hit.
[2023-03-08 13:35:55] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/231 places, 190/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 132/231 places, 190/489 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s126 1)), p1:(AND (GEQ s1 1) (GEQ s112 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]]
Product exploration explored 100000 steps with 23010 reset in 151 ms.
Product exploration explored 100000 steps with 22931 reset in 159 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2317 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 448 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 19 ms. (steps per millisecond=89 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 19 ms. (steps per millisecond=89 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-08 13:35:56] [INFO ] Invariant cache hit.
[2023-03-08 13:35:56] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 13:35:56] [INFO ] Invariant cache hit.
[2023-03-08 13:35:56] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 13:35:56] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 13:35:56] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 13:35:56] [INFO ] Invariant cache hit.
[2023-03-08 13:35:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 132/132 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 10 ms. (steps per millisecond=169 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 10 ms. (steps per millisecond=169 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23097 reset in 155 ms.
Product exploration explored 100000 steps with 23009 reset in 152 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2023-03-08 13:35:57] [INFO ] Invariant cache hit.
[2023-03-08 13:35:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 13:35:57] [INFO ] Invariant cache hit.
[2023-03-08 13:35:57] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 13:35:57] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-08 13:35:57] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 13:35:57] [INFO ] Invariant cache hit.
[2023-03-08 13:35:58] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 132/132 places, 190/190 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-14 finished in 3492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 201 transition count 352
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 201 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 201 transition count 348
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 88 place count 177 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 177 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 120 place count 177 transition count 307
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 156 transition count 272
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 156 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 171 place count 156 transition count 263
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 185 place count 142 transition count 237
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 142 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 142 transition count 233
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 212 place count 133 transition count 224
Iterating global reduction 4 with 9 rules applied. Total rules applied 221 place count 133 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 228 place count 133 transition count 217
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 233 place count 128 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 238 place count 128 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 241 place count 128 transition count 196
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 244 place count 125 transition count 176
Iterating global reduction 6 with 3 rules applied. Total rules applied 247 place count 125 transition count 176
Applied a total of 247 rules in 12 ms. Remains 125 /231 variables (removed 106) and now considering 176/489 (removed 313) transitions.
// Phase 1: matrix 176 rows 125 cols
[2023-03-08 13:35:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 13:35:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 13:35:58] [INFO ] Invariant cache hit.
[2023-03-08 13:35:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:35:58] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-08 13:35:58] [INFO ] Invariant cache hit.
[2023-03-08 13:35:58] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/231 places, 176/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 125/231 places, 176/489 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22886 reset in 145 ms.
Product exploration explored 100000 steps with 22951 reset in 156 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2335 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 78 ms. (steps per millisecond=576 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 78 ms. (steps per millisecond=576 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 13:35:59] [INFO ] Invariant cache hit.
[2023-03-08 13:35:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 13:35:59] [INFO ] Invariant cache hit.
[2023-03-08 13:35:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:35:59] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-08 13:35:59] [INFO ] Invariant cache hit.
[2023-03-08 13:35:59] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 125/125 places, 176/176 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 425 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 78 ms. (steps per millisecond=576 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 78 ms. (steps per millisecond=576 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23133 reset in 144 ms.
Product exploration explored 100000 steps with 22958 reset in 143 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 22 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 13:36:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:36:01] [INFO ] Invariant cache hit.
[2023-03-08 13:36:01] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 125/125 places, 176/176 transitions.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 13:36:01] [INFO ] Invariant cache hit.
[2023-03-08 13:36:01] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 13:36:01] [INFO ] Invariant cache hit.
[2023-03-08 13:36:01] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:36:01] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-08 13:36:01] [INFO ] Invariant cache hit.
[2023-03-08 13:36:02] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 125/125 places, 176/176 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-15 finished in 4041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p1&&X(p2)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-11
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 359
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 355
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 323
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 323
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 116 place count 179 transition count 315
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 135 place count 160 transition count 283
Iterating global reduction 2 with 19 rules applied. Total rules applied 154 place count 160 transition count 283
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 163 place count 160 transition count 274
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 175 place count 148 transition count 250
Iterating global reduction 3 with 12 rules applied. Total rules applied 187 place count 148 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 148 transition count 244
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 201 place count 140 transition count 236
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 140 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 215 place count 140 transition count 230
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 221 place count 134 transition count 207
Iterating global reduction 5 with 6 rules applied. Total rules applied 227 place count 134 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 230 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 232 place count 132 transition count 189
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 132 transition count 189
Applied a total of 234 rules in 29 ms. Remains 132 /231 variables (removed 99) and now considering 189/489 (removed 300) transitions.
// Phase 1: matrix 189 rows 132 cols
[2023-03-08 13:36:02] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 13:36:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 13:36:02] [INFO ] Invariant cache hit.
[2023-03-08 13:36:02] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:36:02] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 13:36:02] [INFO ] Invariant cache hit.
[2023-03-08 13:36:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/231 places, 189/489 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 419 ms. Remains : 132/231 places, 189/489 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s126 1)), p1:(OR (LT s1 1) (LT s97 1)), p2:(OR (LT s1 1) (LT s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28576 reset in 169 ms.
Product exploration explored 100000 steps with 28613 reset in 194 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 477 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 451 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 13:36:04] [INFO ] Invariant cache hit.
[2023-03-08 13:36:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 13:36:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:04] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-08 13:36:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:36:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:04] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-08 13:36:04] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:36:04] [INFO ] After 159ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-08 13:36:04] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-08 13:36:04] [INFO ] After 705ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 189/189 transitions.
Graph (complete) has 446 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 186
Applied a total of 4 rules in 11 ms. Remains 131 /132 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 131/132 places, 186/189 transitions.
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 431 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Finished probabilistic random walk after 62757 steps, run visited all 5 properties in 363 ms. (steps per millisecond=172 )
Probabilistic random walk after 62757 steps, saw 28492 distinct states, run finished after 363 ms. (steps per millisecond=172 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 472 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 189/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2023-03-08 13:36:06] [INFO ] Invariant cache hit.
[2023-03-08 13:36:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 13:36:06] [INFO ] Invariant cache hit.
[2023-03-08 13:36:06] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:36:06] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 13:36:06] [INFO ] Invariant cache hit.
[2023-03-08 13:36:06] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 132/132 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 477 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (AND p0 p1))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 438 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 420 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 454 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 438 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 13:36:07] [INFO ] Invariant cache hit.
[2023-03-08 13:36:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:36:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:07] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 13:36:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 13:36:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:08] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 13:36:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:36:08] [INFO ] After 154ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 13:36:08] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-08 13:36:08] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 189/189 transitions.
Graph (complete) has 446 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 186
Applied a total of 4 rules in 5 ms. Remains 131 /132 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 131/132 places, 186/189 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 422 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 444 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Finished probabilistic random walk after 62757 steps, run visited all 5 properties in 372 ms. (steps per millisecond=168 )
Probabilistic random walk after 62757 steps, saw 28492 distinct states, run finished after 373 ms. (steps per millisecond=168 ) properties seen :5
Knowledge obtained : [(AND p1 p0 p2), (X (X (AND p0 p1))), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28606 reset in 183 ms.
Product exploration explored 100000 steps with 28563 reset in 180 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 189/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2023-03-08 13:36:10] [INFO ] Invariant cache hit.
[2023-03-08 13:36:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 13:36:10] [INFO ] Invariant cache hit.
[2023-03-08 13:36:10] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 13:36:10] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-08 13:36:10] [INFO ] Invariant cache hit.
[2023-03-08 13:36:10] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 132/132 places, 189/189 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-11 finished in 8808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-13
Stuttering acceptance computed with spot in 180 ms :[p0, p0, false, false, false]
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 202 transition count 353
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 202 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 202 transition count 349
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 179 transition count 318
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 179 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 115 place count 179 transition count 311
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 136 place count 158 transition count 276
Iterating global reduction 2 with 21 rules applied. Total rules applied 157 place count 158 transition count 276
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 166 place count 158 transition count 267
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 179 place count 145 transition count 242
Iterating global reduction 3 with 13 rules applied. Total rules applied 192 place count 145 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 145 transition count 238
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 204 place count 137 transition count 230
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 137 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 218 place count 137 transition count 224
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 224 place count 131 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 230 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 233 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 236 place count 128 transition count 178
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 128 transition count 178
Applied a total of 239 rules in 40 ms. Remains 128 /231 variables (removed 103) and now considering 178/489 (removed 311) transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 13:36:11] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 13:36:11] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 13:36:11] [INFO ] Invariant cache hit.
[2023-03-08 13:36:11] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:36:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-08 13:36:11] [INFO ] Invariant cache hit.
[2023-03-08 13:36:11] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 128/231 places, 178/489 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 533 ms. Remains : 128/231 places, 178/489 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p1:(AND (GEQ s45 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37334 reset in 208 ms.
Product exploration explored 100000 steps with 37203 reset in 221 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p0, p0, false, false, false]
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 13:36:12] [INFO ] Invariant cache hit.
[2023-03-08 13:36:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:36:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:12] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 13:36:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 13:36:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:13] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 13:36:13] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:36:13] [INFO ] After 24ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 13:36:13] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 13:36:13] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 10 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 34 ms. (steps per millisecond=620 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 35 ms. (steps per millisecond=602 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 351 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 165 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 13:36:13] [INFO ] Invariant cache hit.
[2023-03-08 13:36:13] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 13:36:13] [INFO ] Invariant cache hit.
[2023-03-08 13:36:13] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:36:14] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-08 13:36:14] [INFO ] Invariant cache hit.
[2023-03-08 13:36:14] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2301 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 13:36:14] [INFO ] Invariant cache hit.
[2023-03-08 13:36:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:36:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:14] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 13:36:14] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:36:14] [INFO ] After 11ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:36:14] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:36:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 13:36:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 13:36:14] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:36:14] [INFO ] After 12ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:36:14] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 13:36:14] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 7 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/128 places, 175/178 transitions.
Incomplete random walk after 10000 steps, including 2330 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 35 ms. (steps per millisecond=602 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 35 ms. (steps per millisecond=602 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 183 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 167 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37335 reset in 202 ms.
Product exploration explored 100000 steps with 37378 reset in 208 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 13:36:16] [INFO ] Invariant cache hit.
[2023-03-08 13:36:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 13:36:16] [INFO ] Invariant cache hit.
[2023-03-08 13:36:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 13:36:16] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 13:36:16] [INFO ] Invariant cache hit.
[2023-03-08 13:36:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 128/128 places, 178/178 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 5774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-15
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 231/231 places, 489/489 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 201 transition count 352
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 201 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 201 transition count 348
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 88 place count 177 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 112 place count 177 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 120 place count 177 transition count 307
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 156 transition count 272
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 156 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 171 place count 156 transition count 263
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 185 place count 142 transition count 237
Iterating global reduction 3 with 14 rules applied. Total rules applied 199 place count 142 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 203 place count 142 transition count 233
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 212 place count 133 transition count 224
Iterating global reduction 4 with 9 rules applied. Total rules applied 221 place count 133 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 228 place count 133 transition count 217
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 233 place count 128 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 238 place count 128 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 241 place count 128 transition count 196
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 244 place count 125 transition count 176
Iterating global reduction 6 with 3 rules applied. Total rules applied 247 place count 125 transition count 176
Applied a total of 247 rules in 24 ms. Remains 125 /231 variables (removed 106) and now considering 176/489 (removed 313) transitions.
// Phase 1: matrix 176 rows 125 cols
[2023-03-08 13:36:17] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 13:36:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 13:36:17] [INFO ] Invariant cache hit.
[2023-03-08 13:36:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:36:17] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 13:36:17] [INFO ] Invariant cache hit.
[2023-03-08 13:36:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 125/231 places, 176/489 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 391 ms. Remains : 125/231 places, 176/489 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s1 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22981 reset in 145 ms.
Product exploration explored 100000 steps with 23114 reset in 143 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 72 ms. (steps per millisecond=625 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 73 ms. (steps per millisecond=616 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 13:36:18] [INFO ] Invariant cache hit.
[2023-03-08 13:36:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 13:36:18] [INFO ] Invariant cache hit.
[2023-03-08 13:36:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:36:18] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-08 13:36:18] [INFO ] Invariant cache hit.
[2023-03-08 13:36:18] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 125/125 places, 176/176 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 426 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45002 steps, run visited all 1 properties in 70 ms. (steps per millisecond=642 )
Probabilistic random walk after 45002 steps, saw 21034 distinct states, run finished after 70 ms. (steps per millisecond=642 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22915 reset in 138 ms.
Product exploration explored 100000 steps with 23010 reset in 143 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 13:36:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:36:20] [INFO ] Invariant cache hit.
[2023-03-08 13:36:20] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 125/125 places, 176/176 transitions.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 0 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 13:36:20] [INFO ] Invariant cache hit.
[2023-03-08 13:36:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 13:36:20] [INFO ] Invariant cache hit.
[2023-03-08 13:36:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:36:20] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-08 13:36:20] [INFO ] Invariant cache hit.
[2023-03-08 13:36:20] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 125/125 places, 176/176 transitions.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-15 finished in 4099 ms.
[2023-03-08 13:36:20] [INFO ] Flatten gal took : 26 ms
[2023-03-08 13:36:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 13:36:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 489 transitions and 1926 arcs took 4 ms.
Total runtime 68596 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2478/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2478/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2478/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2478/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d2m10-LTLFireability-11
Could not compute solution for formula : DBSingleClientW-PT-d2m10-LTLFireability-13
Could not compute solution for formula : DBSingleClientW-PT-d2m10-LTLFireability-14
Could not compute solution for formula : DBSingleClientW-PT-d2m10-LTLFireability-15

BK_STOP 1678282582612

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DBSingleClientW-PT-d2m10-LTLFireability-11
ltl formula formula --ltl=/tmp/2478/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 231 places, 489 transitions and 1926 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2478/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2478/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2478/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2478/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m10-LTLFireability-13
ltl formula formula --ltl=/tmp/2478/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 231 places, 489 transitions and 1926 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2478/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2478/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2478/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2478/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m10-LTLFireability-14
ltl formula formula --ltl=/tmp/2478/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 231 places, 489 transitions and 1926 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2478/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2478/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2478/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2478/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d2m10-LTLFireability-15
ltl formula formula --ltl=/tmp/2478/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 231 places, 489 transitions and 1926 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2478/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2478/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2478/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2478/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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