Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.6K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 7 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 119K Jun 6 12:11 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-d0m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654775120576

Running Version 202205111006
[2022-06-09 11:45:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 11:45:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:45:21] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2022-06-09 11:45:21] [INFO ] Transformed 553 places.
[2022-06-09 11:45:21] [INFO ] Transformed 150 transitions.
[2022-06-09 11:45:21] [INFO ] Parsed PT model containing 553 places and 150 transitions in 189 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 5 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 120
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 120
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 84 transition count 116
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 84 transition count 116
Applied a total of 54 rules in 26 ms. Remains 84 /109 variables (removed 25) and now considering 116/150 (removed 34) transitions.
// Phase 1: matrix 116 rows 84 cols
[2022-06-09 11:45:22] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 11:45:22] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 116 rows 84 cols
[2022-06-09 11:45:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 11:45:22] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 84 cols
[2022-06-09 11:45:22] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 11:45:22] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/109 places, 116/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/109 places, 116/150 transitions.
Support contains 25 out of 84 places after structural reductions.
[2022-06-09 11:45:22] [INFO ] Flatten gal took : 30 ms
[2022-06-09 11:45:22] [INFO ] Flatten gal took : 14 ms
[2022-06-09 11:45:22] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 24 out of 84 places (down from 25) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 689 ms. (steps per millisecond=14 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 10000 steps, including 523 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1046 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 979 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1035 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 116 rows 84 cols
[2022-06-09 11:45:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:45:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:45:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:45:24] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-06-09 11:45:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:45:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:24] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-06-09 11:45:24] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 11:45:25] [INFO ] After 132ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2022-06-09 11:45:25] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 142 ms.
[2022-06-09 11:45:25] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 13 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 82 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 110
Applied a total of 4 rules in 13 ms. Remains 82 /84 variables (removed 2) and now considering 110/116 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/84 places, 110/116 transitions.
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 528 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 519 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 110 rows 82 cols
[2022-06-09 11:45:26] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 11:45:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:45:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:45:26] [INFO ] After 105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2022-06-09 11:45:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 11:45:26] [INFO ] After 24ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-09 11:45:26] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-09 11:45:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:45:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 11:45:26] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-09 11:45:26] [INFO ] After 88ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-09 11:45:26] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 122 ms.
[2022-06-09 11:45:26] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 76 ms.
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 108
Applied a total of 4 rules in 20 ms. Remains 80 /82 variables (removed 2) and now considering 108/110 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/82 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1047 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Finished probabilistic random walk after 4783 steps, run visited all 8 properties in 43 ms. (steps per millisecond=111 )
Probabilistic random walk after 4783 steps, saw 2268 distinct states, run finished after 43 ms. (steps per millisecond=111 ) properties seen :8
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F((G(p0)&&p1)))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 99
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 75 transition count 98
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 69 transition count 92
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 66 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 66 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 66 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 64 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 64 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 62 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 62 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 62 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 61 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 61 transition count 75
Applied a total of 52 rules in 22 ms. Remains 61 /84 variables (removed 23) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:45:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:27] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:45:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:27] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:45:27] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-06-09 11:45:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:45:27] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 11:45:28] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/84 places, 75/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/84 places, 75/116 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s55 1)), p0:(OR (LT s1 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22981 reset in 247 ms.
Product exploration explored 100000 steps with 22993 reset in 259 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 9011 steps, including 2036 resets, run visited all 3 properties in 147 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 75/75 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:45:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:29] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:45:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:45:29] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-06-09 11:45:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:45:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:29] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 3114 steps, including 721 resets, run visited all 3 properties in 60 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 22959 reset in 107 ms.
Product exploration explored 100000 steps with 22958 reset in 164 ms.
Built C files in :
/tmp/ltsmin1148813650361667920
[2022-06-09 11:45:31] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2022-06-09 11:45:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:45:31] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2022-06-09 11:45:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:45:31] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2022-06-09 11:45:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:45:31] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1148813650361667920
Running compilation step : cd /tmp/ltsmin1148813650361667920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin1148813650361667920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1148813650361667920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13737543449228003438.hoa' '--buchi-type=spotba'
LTSmin run took 68 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-00 finished in 3934 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((F((p0 U X(p0))) U X(p0))))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 74 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 68 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 65 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 64 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 64 transition count 75
Applied a total of 46 rules in 29 ms. Remains 64 /84 variables (removed 20) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:45:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:31] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:45:31] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 11:45:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:45:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-06-09 11:45:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 64 cols
[2022-06-09 11:45:31] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:45:31] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/84 places, 75/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/84 places, 75/116 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-01 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(F(G(p0)) U (p1 U G(p0))) U (F(p1)&&p2))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 97
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 75 transition count 96
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 68 transition count 89
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 65 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 60 transition count 70
Applied a total of 56 rules in 18 ms. Remains 60 /84 variables (removed 24) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:32] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:45:32] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-06-09 11:45:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/84 places, 70/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/84 places, 70/116 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p1)), p0, p0, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s43 1)), p0:(AND (GEQ s1 1) (GEQ s28 1)), p1:(AND (GEQ s6 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-02 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||X(p1)||p2))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 70 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 70 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 68 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 68 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 67 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 66 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 65 transition count 77
Applied a total of 43 rules in 10 ms. Remains 65 /84 variables (removed 19) and now considering 77/116 (removed 39) transitions.
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:32] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:45:32] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/84 places, 77/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/84 places, 77/116 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s61 1)), p2:(AND (GEQ s1 1) (GEQ s64 1)), p0:(AND (OR (LT s1 1) (LT s60 1)) (GEQ s1 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, 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-d0m10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-05 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U F(!(!X(p1) U !p0)))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 74 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 74 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 74 transition count 95
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 67 transition count 88
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 59 transition count 69
Applied a total of 58 rules in 6 ms. Remains 59 /84 variables (removed 25) and now considering 69/116 (removed 47) transitions.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:45:32] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:45:32] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:45:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/84 places, 69/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/84 places, 69/116 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s41 1)), p1:(AND (GEQ s4 1) (GEQ s21 1))], 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]]
Product exploration explored 100000 steps with 23821 reset in 117 ms.
Product exploration explored 100000 steps with 23802 reset in 127 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 7956 steps, including 1825 resets, run visited all 3 properties in 79 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:45:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:34] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:45:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:45:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:45:34] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 69 rows 59 cols
[2022-06-09 11:45:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:45:34] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :1
Finished Best-First random walk after 5575 steps, including 254 resets, run visited all 2 properties in 15 ms. (steps per millisecond=371 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23749 reset in 94 ms.
Product exploration explored 100000 steps with 23782 reset in 112 ms.
Built C files in :
/tmp/ltsmin5129134072156923030
[2022-06-09 11:45:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5129134072156923030
Running compilation step : cd /tmp/ltsmin5129134072156923030;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin5129134072156923030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5129134072156923030;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4845161543995072373.hoa' '--buchi-type=spotba'
LTSmin run took 36 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-06 finished in 3016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U !p2)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 76 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 76 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 76 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 71 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 71 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 71 transition count 92
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 68 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 66 transition count 82
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 66 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 64 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 63 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 63 transition count 75
Applied a total of 50 rules in 20 ms. Remains 63 /84 variables (removed 21) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 63 cols
[2022-06-09 11:45:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:35] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 75 rows 63 cols
[2022-06-09 11:45:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:45:35] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-09 11:45:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 75 rows 63 cols
[2022-06-09 11:45:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/84 places, 75/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/84 places, 75/116 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, p2, (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(OR (LT s1 1) (LT s43 1)), p1:(AND (GEQ s1 1) (GEQ s59 1)), p0:(OR (LT s1 1) (LT s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 82571 steps with 18861 reset in 82 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-07 finished in 387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0))&&F(p1)) U !X(!p2)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 97
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 75 transition count 96
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 70 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 70 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 68 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 67 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 65 transition count 79
Applied a total of 44 rules in 9 ms. Remains 65 /84 variables (removed 19) and now considering 79/116 (removed 37) transitions.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:45:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:45:36] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:45:36] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:45:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:45:36] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 65 cols
[2022-06-09 11:45:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:36] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/84 places, 79/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/84 places, 79/116 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s61 1)), p2:(OR (LT s1 1) (LT s44 1)), p0:(AND (GEQ s1 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p2 (NOT p0))
Knowledge based reduction with 12 factoid took 341 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-11 finished in 1040 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 66 transition count 83
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 60 place count 58 transition count 64
Applied a total of 60 rules in 3 ms. Remains 58 /84 variables (removed 26) and now considering 64/116 (removed 52) transitions.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:37] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:45:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 58 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/84 places, 64/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/84 places, 64/116 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-12 finished in 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))&&F((F(X(G(p1))) U p2)))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 74 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 68 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 70
Applied a total of 54 rules in 11 ms. Remains 60 /84 variables (removed 24) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:37] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:45:37] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 70 rows 60 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:37] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/84 places, 70/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/84 places, 70/116 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s37 1)), p0:(AND (GEQ s1 1) (GEQ s54 1)), p2:(AND (GEQ s1 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-14 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(X(p0))&&F(p1)))&&F(p2))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 75 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 72 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 72 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 72 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 70 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 70 transition count 84
Applied a total of 32 rules in 12 ms. Remains 70 /84 variables (removed 14) and now considering 84/116 (removed 32) transitions.
// Phase 1: matrix 84 rows 70 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:45:37] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 84 rows 70 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:45:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:45:37] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-06-09 11:45:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 70 cols
[2022-06-09 11:45:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:45:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/84 places, 84/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 70/84 places, 84/116 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p0), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={0, 1} source=4 dest: 3}, { cond=p0, acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s64 1)), p1:(AND (GEQ s5 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s66 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-15 finished in 407 ms.
All properties solved by simple procedures.
Total runtime 16393 ms.

BK_STOP 1654775138158

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d0m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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