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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 24K 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 17K 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.0K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K 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-d0m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654774763942

Running Version 202205111006
[2022-06-09 11:39:25] [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:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:39:25] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-06-09 11:39:25] [INFO ] Transformed 553 places.
[2022-06-09 11:39:25] [INFO ] Transformed 150 transitions.
[2022-06-09 11:39:25] [INFO ] Parsed PT model containing 553 places and 150 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 123
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 123
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 53 place count 81 transition count 116
Iterating global reduction 1 with 7 rules applied. Total rules applied 60 place count 81 transition count 116
Applied a total of 60 rules in 32 ms. Remains 81 /109 variables (removed 28) and now considering 116/150 (removed 34) transitions.
// Phase 1: matrix 116 rows 81 cols
[2022-06-09 11:39:25] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 11:39:25] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 116 rows 81 cols
[2022-06-09 11:39:25] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 11:39:25] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-09 11:39:25] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 81 cols
[2022-06-09 11:39:25] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 11:39:25] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/109 places, 116/150 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/109 places, 116/150 transitions.
Support contains 28 out of 81 places after structural reductions.
[2022-06-09 11:39:26] [INFO ] Flatten gal took : 38 ms
[2022-06-09 11:39:26] [INFO ] Flatten gal took : 17 ms
[2022-06-09 11:39:26] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 502 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1039 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1007 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :3
Running SMT prover for 8 properties.
// Phase 1: matrix 116 rows 81 cols
[2022-06-09 11:39:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:39:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:39:28] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-06-09 11:39:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:28] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-06-09 11:39:28] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-06-09 11:39:28] [INFO ] After 86ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2022-06-09 11:39:28] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-06-09 11:39:28] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 12 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 116/116 transitions.
Graph (complete) has 242 edges and 81 vertex of which 80 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 80 transition count 114
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 74 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 74 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 74 transition count 101
Applied a total of 17 rules in 20 ms. Remains 74 /81 variables (removed 7) and now considering 101/116 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 74/81 places, 101/116 transitions.
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 509 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1012 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Finished probabilistic random walk after 48700 steps, run visited all 7 properties in 251 ms. (steps per millisecond=194 )
Probabilistic random walk after 48700 steps, saw 19855 distinct states, run finished after 251 ms. (steps per millisecond=194 ) properties seen :7
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 FALSE 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' '!((X(X(!(p0 U !p1)))&&!(X(p1) U p2)))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 69 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 65 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Applied a total of 46 rules in 15 ms. Remains 61 /81 variables (removed 20) and now considering 71/116 (removed 45) transitions.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:39:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:30] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:39:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:39:30] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:39:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:39:30] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 71/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/81 places, 71/116 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) p2), true, (OR (NOT p1) p2), (NOT p1), (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s0 1) (GEQ s22 1)), p0:(AND (GEQ s1 1) (GEQ s54 1) (GEQ s1 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, 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 3 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-00 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(p0)||F(p1)))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 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 22 place count 71 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 67 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 67 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 65 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 65 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 63 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 63 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 75
Applied a total of 46 rules in 19 ms. Remains 61 /81 variables (removed 20) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:39:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:30] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:39:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:39:30] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 61 cols
[2022-06-09 11:39:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/81 places, 75/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/81 places, 75/116 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01 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=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s55 1)), p1:(OR (LT s1 1) (LT s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 166 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0 U !p1)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 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 22 place count 71 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 68 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 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 30 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 67 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 64 transition count 80
Applied a total of 40 rules in 22 ms. Remains 64 /81 variables (removed 17) and now considering 80/116 (removed 36) transitions.
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:39:31] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:39:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:39:31] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-06-09 11:39:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:39:31] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/81 places, 80/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/81 places, 80/116 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s42 1)) (AND (GEQ s1 1) (GEQ s62 1))), p0:(AND (GEQ s1 1) (GEQ s60 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22904 reset in 196 ms.
Product exploration explored 100000 steps with 22894 reset in 211 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) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 514 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:32] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:39:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:32] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:39:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:39:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:32] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:39:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:39:32] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:39:32] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-09 11:39:32] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 80/80 transitions.
Graph (complete) has 189 edges and 64 vertex of which 63 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 61 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 60 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 60 transition count 72
Applied a total of 10 rules in 10 ms. Remains 60 /64 variables (removed 4) and now considering 72/80 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/64 places, 72/80 transitions.
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20799 steps, run visited all 1 properties in 71 ms. (steps per millisecond=292 )
Probabilistic random walk after 20799 steps, saw 8929 distinct states, run finished after 71 ms. (steps per millisecond=292 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Stuttering acceptance computed with spot in 97 ms :[p1, p1]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:33] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:39:33] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-06-09 11:39:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:33] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 80/80 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 64 cols
[2022-06-09 11:39:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:39:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:33] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:39:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:34] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:39:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 11:39:34] [INFO ] After 17ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:39:34] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-09 11:39:34] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 80/80 transitions.
Graph (complete) has 189 edges and 64 vertex of which 63 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 61 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 60 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 60 transition count 72
Applied a total of 10 rules in 12 ms. Remains 60 /64 variables (removed 4) and now considering 72/80 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/64 places, 72/80 transitions.
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20799 steps, run visited all 1 properties in 25 ms. (steps per millisecond=831 )
Probabilistic random walk after 20799 steps, saw 8929 distinct states, run finished after 25 ms. (steps per millisecond=831 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 318 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[p1, p1]
Stuttering acceptance computed with spot in 59 ms :[p1, p1]
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
Product exploration explored 100000 steps with 22916 reset in 152 ms.
Product exploration explored 100000 steps with 22994 reset in 154 ms.
Built C files in :
/tmp/ltsmin18428345232897413087
[2022-06-09 11:39:34] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-06-09 11:39:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:39:34] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-06-09 11:39:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:39:34] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-06-09 11:39:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:39:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18428345232897413087
Running compilation step : cd /tmp/ltsmin18428345232897413087;'/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 272 ms.
Running link step : cd /tmp/ltsmin18428345232897413087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18428345232897413087;'/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/stateBased15527019584491886973.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-02 finished in 4034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(X(p0))))||(F(X(p1))&&F(!p0))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 89
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 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 24 place count 70 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 65 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 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 52 place count 59 transition count 67
Applied a total of 52 rules in 9 ms. Remains 59 /81 variables (removed 22) and now considering 67/116 (removed 49) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:39:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:39:35] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:39:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:39:35] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:39:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:39:35] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 67/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/81 places, 67/116 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s31 1)), p0:(OR (LT s1 1) (LT s26 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 527 steps with 131 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-03 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!(G(p0) U p1)))||X(G(p2))))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 91
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 91
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 72 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 69 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 69 transition count 86
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 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 67 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Applied a total of 37 rules in 6 ms. Remains 65 /81 variables (removed 16) and now considering 78/116 (removed 38) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:39:35] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:39:35] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:35] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/81 places, 78/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/81 places, 78/116 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s23 1) (LT s43 1)), p1:(AND (GEQ s16 1) (GEQ s24 1)), p0:(AND (GEQ s1 1) (GEQ s61 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 22868 reset in 188 ms.
Product exploration explored 100000 steps with 22937 reset in 155 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 277 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 1047 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 987 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 503 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 519 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:37] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2022-06-09 11:39:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:39:37] [INFO ] After 6ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-09 11:39:37] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-09 11:39:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:37] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-09 11:39:37] [INFO ] After 17ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-09 11:39:37] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-09 11:39:37] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 78/78 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 77
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 77/78 transitions.
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1357 steps, run visited all 2 properties in 11 ms. (steps per millisecond=123 )
Probabilistic random walk after 1357 steps, saw 706 distinct states, run finished after 11 ms. (steps per millisecond=123 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p2)), (F p1)]
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Support contains 4 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:39:38] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:39:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:39:38] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 78/78 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 p2 (NOT p1)), (X p2), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2323 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:39:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:39:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:39] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 11:39:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:39:39] [INFO ] After 10ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:39:39] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 11:39:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:39:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:39:39] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 11:39:39] [INFO ] After 7ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 11:39:39] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 11:39:39] [INFO ] After 63ms 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 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 78/78 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 61 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 61 transition count 71
Applied a total of 9 rules in 9 ms. Remains 61 /65 variables (removed 4) and now considering 71/78 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/65 places, 71/78 transitions.
Incomplete random walk after 10000 steps, including 2233 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1040 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1325 steps, run visited all 1 properties in 5 ms. (steps per millisecond=265 )
Probabilistic random walk after 1325 steps, saw 688 distinct states, run finished after 5 ms. (steps per millisecond=265 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Product exploration explored 100000 steps with 22847 reset in 98 ms.
Product exploration explored 100000 steps with 22819 reset in 99 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 74
Applied a total of 4 rules in 16 ms. Remains 63 /65 variables (removed 2) and now considering 74/78 (removed 4) transitions.
[2022-06-09 11:39:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:39:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:40] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/65 places, 74/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 74/78 transitions.
Product exploration explored 100000 steps with 22892 reset in 196 ms.
Product exploration explored 100000 steps with 22946 reset in 192 ms.
Built C files in :
/tmp/ltsmin10709675789077284171
[2022-06-09 11:39:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10709675789077284171
Running compilation step : cd /tmp/ltsmin10709675789077284171;'/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 165 ms.
Running link step : cd /tmp/ltsmin10709675789077284171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10709675789077284171;'/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/stateBased11120005923821779512.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 74
Applied a total of 4 rules in 8 ms. Remains 63 /65 variables (removed 2) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:39:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:39:56] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:39:56] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 11:39:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:39:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:39:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:39:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 74/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 74/78 transitions.
Built C files in :
/tmp/ltsmin4663047996184555565
[2022-06-09 11:39:56] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4663047996184555565
Running compilation step : cd /tmp/ltsmin4663047996184555565;'/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 145 ms.
Running link step : cd /tmp/ltsmin4663047996184555565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4663047996184555565;'/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/stateBased4980684025216908896.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 11:40:11] [INFO ] Flatten gal took : 7 ms
[2022-06-09 11:40:11] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:40:11] [INFO ] Time to serialize gal into /tmp/LTL16592176601669847487.gal : 2 ms
[2022-06-09 11:40:11] [INFO ] Time to serialize properties into /tmp/LTL9013229419301309764.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16592176601669847487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9013229419301309764.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1659217...267
Read 1 LTL properties
Checking formula 0 : !(((G(F(!((G("((s1>=1)&&(l491>=1))"))U("((p23>=1)&&(l0>=1))")))))||(X(G("((p39<1)||(l137<1))")))))
Formula 0 simplified : !(GF!(G"((s1>=1)&&(l491>=1))" U "((p23>=1)&&(l0>=1))") | XG"((p39<1)||(l137<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t65, t70, t71, t72, t89, t91, t92, t93, t94, t95, t96, t97, t98, t9...328
Detected timeout of ITS tools.
[2022-06-09 11:40:26] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:40:26] [INFO ] Applying decomposition
[2022-06-09 11:40:26] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3323499594242645350.txt' '-o' '/tmp/graph3323499594242645350.bin' '-w' '/tmp/graph3323499594242645350.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3323499594242645350.bin' '-l' '-1' '-v' '-w' '/tmp/graph3323499594242645350.weights' '-q' '0' '-e' '0.001'
[2022-06-09 11:40:26] [INFO ] Decomposing Gal with order
[2022-06-09 11:40:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:40:26] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-09 11:40:26] [INFO ] Flatten gal took : 47 ms
[2022-06-09 11:40:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 6 ms.
[2022-06-09 11:40:26] [INFO ] Time to serialize gal into /tmp/LTL14188278562127218997.gal : 2 ms
[2022-06-09 11:40:26] [INFO ] Time to serialize properties into /tmp/LTL8588814503192135883.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14188278562127218997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8588814503192135883.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1418827...246
Read 1 LTL properties
Checking formula 0 : !(((G(F(!((G("((i2.u2.s1>=1)&&(i6.u13.l491>=1))"))U("((i6.u9.p23>=1)&&(i2.u2.l0>=1))")))))||(X(G("((i2.u2.p39<1)||(i6.u13.l137<1))")))...157
Formula 0 simplified : !(GF!(G"((i2.u2.s1>=1)&&(i6.u13.l491>=1))" U "((i6.u9.p23>=1)&&(i2.u2.l0>=1))") | XG"((i2.u2.p39<1)||(i6.u13.l137<1))")
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t28, t65, t70, t71, t72, t89, t91, t92, t93, t94, t95, t96, t97, t98, t99, t100, t101...319
Computing Next relation with stutter on 2.27012e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10368643910366001122
[2022-06-09 11:40:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10368643910366001122
Running compilation step : cd /tmp/ltsmin10368643910366001122;'/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 161 ms.
Running link step : cd /tmp/ltsmin10368643910366001122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10368643910366001122;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>(!([]((LTLAPp0==true)) U (LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-04 finished in 80967 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(F(p1)))||p0)))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 93
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 71 transition count 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 66 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 64 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 64 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 62 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 62 transition count 78
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 62 transition count 76
Applied a total of 43 rules in 13 ms. Remains 62 /81 variables (removed 19) and now considering 76/116 (removed 40) transitions.
// Phase 1: matrix 76 rows 62 cols
[2022-06-09 11:40:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:40:56] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 76 rows 62 cols
[2022-06-09 11:40:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:40:56] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:40:56] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 76 rows 62 cols
[2022-06-09 11:40:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:40:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/81 places, 76/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/81 places, 76/116 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s54 1)) (AND (GEQ s1 1) (GEQ s42 1))), p1:(OR (LT s1 1) (LT s53 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][false, false, false, false]]
Product exploration explored 100000 steps with 22963 reset in 98 ms.
Product exploration explored 100000 steps with 22856 reset in 107 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 p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4149 steps, run visited all 1 properties in 7 ms. (steps per millisecond=592 )
Probabilistic random walk after 4149 steps, saw 1880 distinct states, run finished after 7 ms. (steps per millisecond=592 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 62 cols
[2022-06-09 11:40:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:40:57] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 76 rows 62 cols
[2022-06-09 11:40:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:40:58] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:40:58] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-06-09 11:40:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 62 cols
[2022-06-09 11:40:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:40:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 76/76 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Finished random walk after 5654 steps, including 1242 resets, run visited all 1 properties in 11 ms. (steps per millisecond=514 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22869 reset in 97 ms.
Product exploration explored 100000 steps with 22866 reset in 104 ms.
Built C files in :
/tmp/ltsmin325131850453598543
[2022-06-09 11:40:58] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2022-06-09 11:40:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:40:58] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2022-06-09 11:40:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:40:58] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2022-06-09 11:40:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:40:58] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin325131850453598543
Running compilation step : cd /tmp/ltsmin325131850453598543;'/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 172 ms.
Running link step : cd /tmp/ltsmin325131850453598543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin325131850453598543;'/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/stateBased3944816636074855572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 71
Applied a total of 2 rules in 15 ms. Remains 61 /62 variables (removed 1) and now considering 71/76 (removed 5) transitions.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:41:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:41:13] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:41:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:41:14] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-06-09 11:41:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:41:14] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 71/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 71/76 transitions.
Built C files in :
/tmp/ltsmin13697196172881257293
[2022-06-09 11:41:14] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2022-06-09 11:41:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:41:14] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2022-06-09 11:41:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:41:14] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2022-06-09 11:41:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:41:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13697196172881257293
Running compilation step : cd /tmp/ltsmin13697196172881257293;'/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 168 ms.
Running link step : cd /tmp/ltsmin13697196172881257293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13697196172881257293;'/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/stateBased6280968156219315631.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 11:41:29] [INFO ] Flatten gal took : 7 ms
[2022-06-09 11:41:29] [INFO ] Flatten gal took : 5 ms
[2022-06-09 11:41:29] [INFO ] Time to serialize gal into /tmp/LTL15406967455163481313.gal : 1 ms
[2022-06-09 11:41:29] [INFO ] Time to serialize properties into /tmp/LTL12819712273678798835.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15406967455163481313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12819712273678798835.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1540696...268
Read 1 LTL properties
Checking formula 0 : !((X(((F(G(F("((s1<1)||(l337<1))"))))||("((s1>=1)&&(l339>=1))"))||("((s1>=1)&&(l149>=1))"))))
Formula 0 simplified : !X("((s1>=1)&&(l149>=1))" | "((s1>=1)&&(l339>=1))" | FGF"((s1<1)||(l337<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t65, t89, t91, t92, t9...346
Computing Next relation with stutter on 1.1961e+07 deadlock states
10 unique states visited
0 strongly connected components in search stack
16 transitions explored
10 items max in DFS search stack
1176 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.7762,276792,1,0,193,1.0564e+06,192,95,2339,1.29218e+06,298
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-06 finished in 45565 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 68 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 66 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 62 transition count 74
Applied a total of 44 rules in 11 ms. Remains 62 /81 variables (removed 19) and now considering 74/116 (removed 42) transitions.
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:42] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:41:42] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/81 places, 74/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/81 places, 74/116 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s6 1) (LT s43 1) (LT s1 1) (LT s54 1)) (OR (LT s1 1) (LT s58 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][false, false, false]]
Product exploration explored 100000 steps with 23075 reset in 124 ms.
Product exploration explored 100000 steps with 22912 reset in 110 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3016 steps, run visited all 1 properties in 7 ms. (steps per millisecond=430 )
Probabilistic random walk after 3016 steps, saw 1442 distinct states, run finished after 7 ms. (steps per millisecond=430 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:43] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:43] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-09 11:41:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:43] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 74/74 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2318 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 504 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3016 steps, run visited all 1 properties in 12 ms. (steps per millisecond=251 )
Probabilistic random walk after 3016 steps, saw 1442 distinct states, run finished after 12 ms. (steps per millisecond=251 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22846 reset in 98 ms.
Product exploration explored 100000 steps with 22913 reset in 105 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2022-06-09 11:41:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 74 rows 62 cols
[2022-06-09 11:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:44] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 74/74 transitions.
Product exploration explored 100000 steps with 22971 reset in 276 ms.
Product exploration explored 100000 steps with 22889 reset in 252 ms.
Built C files in :
/tmp/ltsmin9621792852385370290
[2022-06-09 11:41:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9621792852385370290
Running compilation step : cd /tmp/ltsmin9621792852385370290;'/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 151 ms.
Running link step : cd /tmp/ltsmin9621792852385370290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9621792852385370290;'/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/stateBased13267942497917240656.hoa' '--buchi-type=spotba'
LTSmin run took 339 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-08 finished in 3574 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U !p1))&&((G(p3)&&p2) U p0)))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 66 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 78
Applied a total of 36 rules in 8 ms. Remains 65 /81 variables (removed 16) and now considering 78/116 (removed 38) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:41:45] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-06-09 11:41:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/81 places, 78/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/81 places, 78/116 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) p1), true, p1, (NOT p3), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR p0 (AND p2 p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s23 1) (LT s43 1)), p2:(AND (GEQ s23 1) (GEQ s43 1)), p3:(AND (GEQ s1 1) (GEQ s33 1)), p1:(AND (GEQ s1 1) (GEQ s52 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]]
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 139 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 p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (NOT p3)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 12 factoid took 236 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-09 finished in 919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 88
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 70 transition count 87
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 65 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 63 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 61 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 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 51 place count 59 transition count 67
Applied a total of 51 rules in 10 ms. Remains 59 /81 variables (removed 22) and now considering 67/116 (removed 49) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:41:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:46] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:41:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 11:41:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:41:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 67/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/81 places, 67/116 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s56 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Product exploration explored 100000 steps with 33333 reset in 92 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 45 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-10 finished in 491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(p0))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 69 transition count 84
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 65 transition count 80
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 71
Applied a total of 46 rules in 16 ms. Remains 61 /81 variables (removed 20) and now considering 71/116 (removed 45) transitions.
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:41:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-06-09 11:41:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 71 rows 61 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/81 places, 71/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/81 places, 71/116 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-11 finished in 219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U !p1))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 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 21 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 67 transition count 84
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 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 66 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 65 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 37 place count 65 transition count 78
Applied a total of 37 rules in 13 ms. Remains 65 /81 variables (removed 16) and now considering 78/116 (removed 38) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:47] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 11:41:47] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-09 11:41:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/81 places, 78/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/81 places, 78/116 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s60 1)), p0:(AND (GEQ s1 1) (GEQ s63 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, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-12 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 65 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 60 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 59 transition count 66
Applied a total of 51 rules in 6 ms. Remains 59 /81 variables (removed 22) and now considering 66/116 (removed 50) transitions.
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:41:47] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:41:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:47] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/81 places, 66/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/81 places, 66/116 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-13 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 65 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 65 transition count 78
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 65 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 61 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 60 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 59 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 59 transition count 66
Applied a total of 51 rules in 14 ms. Remains 59 /81 variables (removed 22) and now considering 66/116 (removed 50) transitions.
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:41:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:48] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:41:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 11:41:48] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2022-06-09 11:41:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 59 cols
[2022-06-09 11:41:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:48] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/81 places, 66/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/81 places, 66/116 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-14 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 s18 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][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-14 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!(G(p0) U p1)))||X(G(p2))))'
Found a SL insensitive property : DBSingleClientW-PT-d0m09-LTLFireability-04
Stuttering acceptance computed with spot in 194 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, (AND p1 p0)]
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 81/81 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 91
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 91
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 72 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 69 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 69 transition count 86
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 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 67 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Applied a total of 37 rules in 11 ms. Remains 65 /81 variables (removed 16) and now considering 78/116 (removed 38) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:48] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:41:48] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:48] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 65/81 places, 78/116 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/81 places, 78/116 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s23 1) (LT s43 1)), p1:(AND (GEQ s16 1) (GEQ s24 1)), p0:(AND (GEQ s1 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22845 reset in 95 ms.
Product exploration explored 100000 steps with 22840 reset in 113 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 387 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 1025 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1030 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:41:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:41:49] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:1
[2022-06-09 11:41:49] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:41:49] [INFO ] After 5ms SMT Verify possible using 25 Read/Feed constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-09 11:41:49] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-06-09 11:41:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:41:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:41:49] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-09 11:41:49] [INFO ] After 16ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2022-06-09 11:41:49] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-09 11:41:49] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 78/78 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 77
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/65 places, 77/78 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1357 steps, run visited all 2 properties in 6 ms. (steps per millisecond=226 )
Probabilistic random walk after 1357 steps, saw 706 distinct states, run finished after 6 ms. (steps per millisecond=226 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND p0 p1))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p2)), (F p1)]
Knowledge based reduction with 10 factoid took 405 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Support contains 4 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:41:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 65 cols
[2022-06-09 11:41:50] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:41:50] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 78/78 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 p2 (NOT p1)), (X p2), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Finished Best-First random walk after 6747 steps, including 665 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1686 )
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (X p2)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Product exploration explored 100000 steps with 23074 reset in 102 ms.
Product exploration explored 100000 steps with 22816 reset in 99 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), p1, p1]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 74
Applied a total of 4 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 74/78 (removed 4) transitions.
[2022-06-09 11:41:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:41:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:41:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/65 places, 74/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 74/78 transitions.
Product exploration explored 100000 steps with 22893 reset in 140 ms.
Product exploration explored 100000 steps with 22903 reset in 154 ms.
Built C files in :
/tmp/ltsmin15072749691246452237
[2022-06-09 11:41:52] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15072749691246452237
Running compilation step : cd /tmp/ltsmin15072749691246452237;'/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 152 ms.
Running link step : cd /tmp/ltsmin15072749691246452237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15072749691246452237;'/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/stateBased1835123432444374801.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 74
Applied a total of 4 rules in 5 ms. Remains 63 /65 variables (removed 2) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:42:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:42:07] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:42:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:42:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:42:07] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 63 cols
[2022-06-09 11:42:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:42:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/65 places, 74/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 74/78 transitions.
Built C files in :
/tmp/ltsmin7517519206019926666
[2022-06-09 11:42:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7517519206019926666
Running compilation step : cd /tmp/ltsmin7517519206019926666;'/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 139 ms.
Running link step : cd /tmp/ltsmin7517519206019926666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7517519206019926666;'/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/stateBased6839035925336567414.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 11:42:23] [INFO ] Flatten gal took : 10 ms
[2022-06-09 11:42:23] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:42:23] [INFO ] Time to serialize gal into /tmp/LTL12090347289633125773.gal : 4 ms
[2022-06-09 11:42:23] [INFO ] Time to serialize properties into /tmp/LTL16605635561903745444.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12090347289633125773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16605635561903745444.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1209034...268
Read 1 LTL properties
Checking formula 0 : !(((G(F(!((G("((s1>=1)&&(l491>=1))"))U("((p23>=1)&&(l0>=1))")))))||(X(G("((p39<1)||(l137<1))")))))
Formula 0 simplified : !(GF!(G"((s1>=1)&&(l491>=1))" U "((p23>=1)&&(l0>=1))") | XG"((p39<1)||(l137<1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t65, t70, t71, t72, t89, t91, t92, t93, t94, t95, t96, t97, t98, t9...328
Computing Next relation with stutter on 2.27012e+07 deadlock states
Detected timeout of ITS tools.
[2022-06-09 11:42:38] [INFO ] Flatten gal took : 6 ms
[2022-06-09 11:42:38] [INFO ] Applying decomposition
[2022-06-09 11:42:38] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3097075432256227502.txt' '-o' '/tmp/graph3097075432256227502.bin' '-w' '/tmp/graph3097075432256227502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3097075432256227502.bin' '-l' '-1' '-v' '-w' '/tmp/graph3097075432256227502.weights' '-q' '0' '-e' '0.001'
[2022-06-09 11:42:38] [INFO ] Decomposing Gal with order
[2022-06-09 11:42:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:42:38] [INFO ] Removed a total of 79 redundant transitions.
[2022-06-09 11:42:38] [INFO ] Flatten gal took : 11 ms
[2022-06-09 11:42:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2022-06-09 11:42:38] [INFO ] Time to serialize gal into /tmp/LTL17490667798070696796.gal : 1 ms
[2022-06-09 11:42:38] [INFO ] Time to serialize properties into /tmp/LTL18372976930233799067.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17490667798070696796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18372976930233799067.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1749066...247
Read 1 LTL properties
Checking formula 0 : !(((G(F(!((G("((i0.u0.s1>=1)&&(i4.u7.l491>=1))"))U("((i5.u8.p23>=1)&&(i0.u0.l0>=1))")))))||(X(G("((i4.u9.p39<1)||(i4.u7.l137<1))")))))
Formula 0 simplified : !(GF!(G"((i0.u0.s1>=1)&&(i4.u7.l491>=1))" U "((i5.u8.p23>=1)&&(i0.u0.l0>=1))") | XG"((i4.u9.p39<1)||(i4.u7.l137<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5716157940050533989
[2022-06-09 11:42:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5716157940050533989
Running compilation step : cd /tmp/ltsmin5716157940050533989;'/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 154 ms.
Running link step : cd /tmp/ltsmin5716157940050533989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5716157940050533989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>(!([]((LTLAPp0==true)) U (LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-04 finished in 80066 ms.
[2022-06-09 11:43:08] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
[2022-06-09 11:43:08] [INFO ] Applying decomposition
[2022-06-09 11:43:08] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin17607793319439003710
[2022-06-09 11:43:08] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2022-06-09 11:43:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:43:08] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2022-06-09 11:43:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:43:08] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2022-06-09 11:43:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 11:43:08] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17607793319439003710
Running compilation step : cd /tmp/ltsmin17607793319439003710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1142527636055262973.txt' '-o' '/tmp/graph1142527636055262973.bin' '-w' '/tmp/graph1142527636055262973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1142527636055262973.bin' '-l' '-1' '-v' '-w' '/tmp/graph1142527636055262973.weights' '-q' '0' '-e' '0.001'
[2022-06-09 11:43:08] [INFO ] Decomposing Gal with order
[2022-06-09 11:43:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:43:08] [INFO ] Removed a total of 123 redundant transitions.
[2022-06-09 11:43:08] [INFO ] Flatten gal took : 12 ms
[2022-06-09 11:43:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 3 ms.
[2022-06-09 11:43:08] [INFO ] Time to serialize gal into /tmp/LTLFireability3851055326250011758.gal : 1 ms
[2022-06-09 11:43:08] [INFO ] Time to serialize properties into /tmp/LTLFireability9972491337098177479.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3851055326250011758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9972491337098177479.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !(((G(F(!((G("((i0.u0.s1>=1)&&(i6.u7.l491>=1))"))U("((i0.u0.p23>=1)&&(i0.u0.l0>=1))")))))||(X(G("((i6.u1.p39<1)||(i6.u7.l137<1))")))))
Formula 0 simplified : !(GF!(G"((i0.u0.s1>=1)&&(i6.u7.l491>=1))" U "((i0.u0.p23>=1)&&(i0.u0.l0>=1))") | XG"((i6.u1.p39<1)||(i6.u7.l137<1))")
Compilation finished in 240 ms.
Running link step : cd /tmp/ltsmin17607793319439003710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17607793319439003710;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>(!([]((LTLAPp0==true)) U (LTLAPp1==true))))||X([]((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t9, t30, t53, t54, t55, t70, t71, t72, t75, t76, t77, t78, t89, t91, t93, t94, t9...370
Computing Next relation with stutter on 2.7156e+08 deadlock states
32 unique states visited
0 strongly connected components in search stack
60 transitions explored
32 items max in DFS search stack
5861 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,58.6262,681084,1,0,642138,103804,1355,4.79682e+06,595,741753,740189
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 366534 ms.

BK_STOP 1654775131728

--------------------
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-d0m09"
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-d0m09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472281900172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m09.tgz
mv DBSingleClientW-PT-d0m09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;