Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716324875942

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:54:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:54:37] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-21 20:54:37] [INFO ] Transformed 553 places.
[2024-05-21 20:54:37] [INFO ] Transformed 150 transitions.
[2024-05-21 20:54:37] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 115
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 88 transition count 113
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 82 transition count 107
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 82 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 82 transition count 106
Applied a total of 61 rules in 22 ms. Remains 82 /109 variables (removed 27) and now considering 106/150 (removed 44) transitions.
// Phase 1: matrix 106 rows 82 cols
[2024-05-21 20:54:37] [INFO ] Computed 2 invariants in 13 ms
[2024-05-21 20:54:38] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-21 20:54:38] [INFO ] Invariant cache hit.
[2024-05-21 20:54:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:54:38] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-21 20:54:38] [INFO ] Invariant cache hit.
[2024-05-21 20:54:38] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 106/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 82/109 places, 106/150 transitions.
Support contains 24 out of 82 places after structural reductions.
[2024-05-21 20:54:38] [INFO ] Flatten gal took : 26 ms
[2024-05-21 20:54:38] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:54:38] [INFO ] Input system was already deterministic with 106 transitions.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10000 steps, including 629 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1022 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-21 20:54:39] [INFO ] Invariant cache hit.
[2024-05-21 20:54:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:39] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-21 20:54:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:39] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-21 20:54:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:54:39] [INFO ] After 79ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2024-05-21 20:54:39] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-21 20:54:40] [INFO ] After 420ms 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 44 ms.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 106/106 transitions.
Graph (complete) has 248 edges and 82 vertex of which 81 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 81 transition count 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 74 transition count 92
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 74 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 72 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 72 transition count 90
Applied a total of 20 rules in 16 ms. Remains 72 /82 variables (removed 10) and now considering 90/106 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 72/82 places, 90/106 transitions.
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1007 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Finished probabilistic random walk after 10002 steps, run visited all 7 properties in 88 ms. (steps per millisecond=113 )
Probabilistic random walk after 10002 steps, saw 4385 distinct states, run finished after 88 ms. (steps per millisecond=113 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 273 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 65 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 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 13 ms. Remains 61 /82 variables (removed 21) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 20:54:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:54:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 20:54:41] [INFO ] Invariant cache hit.
[2024-05-21 20:54:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:54:41] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-21 20:54:41] [INFO ] Invariant cache hit.
[2024-05-21 20:54:41] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 71/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 61/82 places, 71/106 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 325 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s1 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-00 finished in 603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 87
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 71 transition count 86
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 66 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 64 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 62 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 60 transition count 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 26 ms. Remains 59 /82 variables (removed 23) and now considering 66/106 (removed 40) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 20:54:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:54:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 20:54:41] [INFO ] Invariant cache hit.
[2024-05-21 20:54:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:54:41] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-21 20:54:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:54:41] [INFO ] Invariant cache hit.
[2024-05-21 20:54:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/82 places, 66/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 59/82 places, 66/106 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-02 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 85
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 66 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 64 transition count 78
Applied a total of 37 rules in 15 ms. Remains 64 /82 variables (removed 18) and now considering 78/106 (removed 28) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 20:54:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:54:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:54:41] [INFO ] Invariant cache hit.
[2024-05-21 20:54:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:54:41] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 20:54:41] [INFO ] Invariant cache hit.
[2024-05-21 20:54:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 78/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 64/82 places, 78/106 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s57 1) (GEQ s1 1) (GEQ s53 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]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-04 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1&&X(p1))||p0)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 92
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 72 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 69 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 68 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 66 transition count 81
Applied a total of 35 rules in 8 ms. Remains 66 /82 variables (removed 16) and now considering 81/106 (removed 25) transitions.
// Phase 1: matrix 81 rows 66 cols
[2024-05-21 20:54:42] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 20:54:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:54:42] [INFO ] Invariant cache hit.
[2024-05-21 20:54:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 20:54:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-21 20:54:42] [INFO ] Invariant cache hit.
[2024-05-21 20:54:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/82 places, 81/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 66/82 places, 81/106 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s28 1)) (AND (GEQ s1 1) (GEQ s64 1))), p1:(OR (LT s1 1) (LT s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 216 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-05 finished in 866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 87
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 71 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 81
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 79
Iterating global reduction 2 with 1 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 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 64 transition count 76
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
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 63 transition count 73
Applied a total of 42 rules in 13 ms. Remains 63 /82 variables (removed 19) and now considering 73/106 (removed 33) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 20:54:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:54:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:54:43] [INFO ] Invariant cache hit.
[2024-05-21 20:54:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:54:43] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 20:54:43] [INFO ] Invariant cache hit.
[2024-05-21 20:54:43] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 73/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 63/82 places, 73/106 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-06 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 (GEQ s1 1) (GEQ 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-06 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0)&&G(F(p1)))||(X(!p0)&&G(p2)))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 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 21 place count 72 transition count 87
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 68 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 66 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 63 transition count 74
Applied a total of 40 rules in 11 ms. Remains 63 /82 variables (removed 19) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 20:54:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:54:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 20:54:43] [INFO ] Invariant cache hit.
[2024-05-21 20:54:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:54:43] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-21 20:54:43] [INFO ] Invariant cache hit.
[2024-05-21 20:54:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 74/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 63/82 places, 74/106 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={1} source=0 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(OR (LT s15 1) (LT s36 1)), p0:(AND (GEQ s1 1) (GEQ s39 1)), p1:(AND (GEQ s19 1) (GEQ s24 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31541 reset in 182 ms.
Product exploration explored 100000 steps with 31199 reset in 197 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 187 ms. Reduced automaton from 6 states, 29 edges and 3 AP (stutter sensitive) to 6 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1001 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 510 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 502 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-21 20:54:45] [INFO ] Invariant cache hit.
[2024-05-21 20:54:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:54:45] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-21 20:54:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:54:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:45] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-21 20:54:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:54:45] [INFO ] After 40ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2024-05-21 20:54:45] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 20:54:45] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 73
Applied a total of 2 rules in 5 ms. Remains 62 /63 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 62/63 places, 73/74 transitions.
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 494 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Finished probabilistic random walk after 6232 steps, run visited all 5 properties in 43 ms. (steps per millisecond=144 )
Probabilistic random walk after 6232 steps, saw 2819 distinct states, run finished after 43 ms. (steps per millisecond=144 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (NOT (AND p0 (NOT p2)))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND p0 p2)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 19 factoid took 586 ms. Reduced automaton from 6 states, 29 edges and 3 AP (stutter sensitive) to 6 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:54:47] [INFO ] Invariant cache hit.
[2024-05-21 20:54:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:54:47] [INFO ] Invariant cache hit.
[2024-05-21 20:54:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:54:47] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-21 20:54:47] [INFO ] Invariant cache hit.
[2024-05-21 20:54:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 63/63 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 205 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (AND (NOT p0) p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 153 ms. Reduced automaton from 6 states, 22 edges and 3 AP (stutter sensitive) to 6 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 1030 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 529 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :4
Running SMT prover for 2 properties.
[2024-05-21 20:54:48] [INFO ] Invariant cache hit.
[2024-05-21 20:54:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:48] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-21 20:54:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 20:54:48] [INFO ] After 6ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:54:48] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:54:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:54:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:54:48] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:54:48] [INFO ] After 11ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:54:48] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 20:54:48] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 73
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 62/63 places, 73/74 transitions.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1054 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 6232 steps, run visited all 2 properties in 24 ms. (steps per millisecond=259 )
Probabilistic random walk after 6232 steps, saw 2819 distinct states, run finished after 24 ms. (steps per millisecond=259 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X p2), (X (AND (NOT p0) p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND (NOT p0) p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (AND p0 p2))]
Knowledge based reduction with 15 factoid took 422 ms. Reduced automaton from 6 states, 22 edges and 3 AP (stutter sensitive) to 6 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 31281 reset in 201 ms.
Product exploration explored 100000 steps with 31346 reset in 150 ms.
Built C files in :
/tmp/ltsmin10093262402664456027
[2024-05-21 20:54:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10093262402664456027
Running compilation step : cd /tmp/ltsmin10093262402664456027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin10093262402664456027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10093262402664456027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9871859792046546983.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-07 finished in 7294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((!p0 U (p1||G(!p0)))))||(F((!p0 U (p1||G(!p0))))&&G(!p2)))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 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 21 place count 72 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 69 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 69 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 67 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 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 38 place count 65 transition count 74
Applied a total of 38 rules in 11 ms. Remains 65 /82 variables (removed 17) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 65 cols
[2024-05-21 20:54:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:54:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 20:54:50] [INFO ] Invariant cache hit.
[2024-05-21 20:54:50] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:54:50] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-21 20:54:50] [INFO ] Invariant cache hit.
[2024-05-21 20:54:50] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/82 places, 74/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 65/82 places, 74/106 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s60 1))) (NOT (AND (GEQ s1 1) (GEQ s58 1)))), p0:(AND (GEQ s1 1) (GEQ s58 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 22960 reset in 102 ms.
Product exploration explored 100000 steps with 22819 reset in 97 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 524 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 526 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 20:54:51] [INFO ] Invariant cache hit.
[2024-05-21 20:54:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:54:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:51] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 20:54:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:54:51] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 20:54:51] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:54:51] [INFO ] After 26ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 20:54:51] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 20:54:51] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 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 73
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 64/65 places, 73/74 transitions.
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 503 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7757 steps, run visited all 3 properties in 30 ms. (steps per millisecond=258 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 30 ms. (steps per millisecond=258 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 211 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:54:52] [INFO ] Invariant cache hit.
[2024-05-21 20:54:52] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:54:52] [INFO ] Invariant cache hit.
[2024-05-21 20:54:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:54:53] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 20:54:53] [INFO ] Invariant cache hit.
[2024-05-21 20:54:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 65/65 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 522 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:54:53] [INFO ] Invariant cache hit.
[2024-05-21 20:54:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:54:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:54:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:54:53] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:54:53] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:54:53] [INFO ] After 16ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:54:53] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-21 20:54:53] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 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 73
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 64/65 places, 73/74 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 531 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7757 steps, run visited all 2 properties in 16 ms. (steps per millisecond=484 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 16 ms. (steps per millisecond=484 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 215 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Product exploration explored 100000 steps with 22902 reset in 93 ms.
Product exploration explored 100000 steps with 22958 reset in 91 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:54:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:54:55] [INFO ] Invariant cache hit.
[2024-05-21 20:54:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin3423593369589733433
[2024-05-21 20:54:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3423593369589733433
Running compilation step : cd /tmp/ltsmin3423593369589733433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin3423593369589733433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3423593369589733433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased723926446901703092.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, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:55:10] [INFO ] Invariant cache hit.
[2024-05-21 20:55:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 20:55:10] [INFO ] Invariant cache hit.
[2024-05-21 20:55:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:55:10] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-21 20:55:10] [INFO ] Invariant cache hit.
[2024-05-21 20:55:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin1509972188710472458
[2024-05-21 20:55:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1509972188710472458
Running compilation step : cd /tmp/ltsmin1509972188710472458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin1509972188710472458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1509972188710472458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12525185605089722513.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:55:25] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:55:25] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:55:25] [INFO ] Time to serialize gal into /tmp/LTL2106032919677540906.gal : 1 ms
[2024-05-21 20:55:25] [INFO ] Time to serialize properties into /tmp/LTL11408994378806103313.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2106032919677540906.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7597943663628606159.hoa' '-atoms' '/tmp/LTL11408994378806103313.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11408994378806103313.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7597943663628606159.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Computing Next relation with stutter on 4.68705e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:55:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:55:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:55:40] [INFO ] Time to serialize gal into /tmp/LTL5261169521233816614.gal : 1 ms
[2024-05-21 20:55:40] [INFO ] Time to serialize properties into /tmp/LTL5330651526359619587.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5261169521233816614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5330651526359619587.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...311
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F!"((s1<1)||(l133<1))" | G("((s1>=1)&&(l34...221
Detected timeout of ITS tools.
[2024-05-21 20:55:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:55:55] [INFO ] Applying decomposition
[2024-05-21 20:55:55] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph336673644863396265.txt' '-o' '/tmp/graph336673644863396265.bin' '-w' '/tmp/graph336673644863396265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph336673644863396265.bin' '-l' '-1' '-v' '-w' '/tmp/graph336673644863396265.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:55:55] [INFO ] Decomposing Gal with order
[2024-05-21 20:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:55:55] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 20:55:55] [INFO ] Flatten gal took : 33 ms
[2024-05-21 20:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 5 ms.
[2024-05-21 20:55:56] [INFO ] Time to serialize gal into /tmp/LTL15685398949775761966.gal : 97 ms
[2024-05-21 20:55:56] [INFO ] Time to serialize properties into /tmp/LTL15717337397729345397.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15685398949775761966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15717337397729345397.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((i2.u1.s1>=1)&&(i5.u0.l345>=1))"))U(("((!((i2.u1.s1>=1)&&(i0.u13.l484>=1)))&&(!((i2.u1.s1>=1)&&(i5.u0.l345>=1))))")...421
Formula 0 simplified : XXG(FG("((i2.u1.s1>=1)&&(i5.u0.l345>=1))" M !"((!((i2.u1.s1>=1)&&(i0.u13.l484>=1)))&&(!((i2.u1.s1>=1)&&(i5.u0.l345>=1))))") & (F!"((...307
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8911949280718725671
[2024-05-21 20:56:11] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8911949280718725671
Running compilation step : cd /tmp/ltsmin8911949280718725671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin8911949280718725671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8911949280718725671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-08 finished in 95615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&X((G(!p0)||F((!p0&&F(p1))))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 90
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 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 67 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 65 transition count 78
Iterating global reduction 2 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 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 75
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
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 60 transition count 69
Applied a total of 49 rules in 13 ms. Remains 60 /82 variables (removed 22) and now considering 69/106 (removed 37) transitions.
// Phase 1: matrix 69 rows 60 cols
[2024-05-21 20:56:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:56:26] [INFO ] Invariant cache hit.
[2024-05-21 20:56:26] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:56:26] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 20:56:26] [INFO ] Invariant cache hit.
[2024-05-21 20:56:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 69/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 60/82 places, 69/106 transitions.
Stuttering acceptance computed with spot in 144 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s27 1)), p1:(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], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22970 reset in 100 ms.
Product exploration explored 100000 steps with 22784 reset in 98 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2284 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 302 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:56:27] [INFO ] Invariant cache hit.
[2024-05-21 20:56:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:56:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:56:27] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 180 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0, false]
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, false]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 20:56:27] [INFO ] Invariant cache hit.
[2024-05-21 20:56:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:56:27] [INFO ] Invariant cache hit.
[2024-05-21 20:56:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:56:27] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-21 20:56:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:27] [INFO ] Invariant cache hit.
[2024-05-21 20:56:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 72 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, false]
Finished random walk after 599 steps, including 143 resets, run visited all 3 properties in 11 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, false]
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, false]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0, false]
Product exploration explored 100000 steps with 22987 reset in 98 ms.
Product exploration explored 100000 steps with 22792 reset in 106 ms.
Built C files in :
/tmp/ltsmin9997455450121629767
[2024-05-21 20:56:28] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2024-05-21 20:56:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:28] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2024-05-21 20:56:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:28] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2024-05-21 20:56:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9997455450121629767
Running compilation step : cd /tmp/ltsmin9997455450121629767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 154 ms.
Running link step : cd /tmp/ltsmin9997455450121629767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9997455450121629767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11626961170889822958.hoa' '--buchi-type=spotba'
LTSmin run took 497 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-10 finished in 3417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 92
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 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 67 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 65 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 61 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 60 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 60 transition count 71
Applied a total of 49 rules in 16 ms. Remains 60 /82 variables (removed 22) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 60 cols
[2024-05-21 20:56:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:56:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:56:29] [INFO ] Invariant cache hit.
[2024-05-21 20:56:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:56:29] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-21 20:56:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:29] [INFO ] Invariant cache hit.
[2024-05-21 20:56:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/82 places, 71/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 60/82 places, 71/106 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s17 1) (GEQ s22 1))) (GEQ s1 1) (GEQ s43 1)), p0:(AND (GEQ s17 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22827 reset in 121 ms.
Product exploration explored 100000 steps with 22840 reset in 121 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND p0 (NOT p1))]
Finished random walk after 844 steps, including 196 resets, run visited all 2 properties in 20 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND p0 (NOT p1))]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 20:56:30] [INFO ] Invariant cache hit.
[2024-05-21 20:56:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 20:56:30] [INFO ] Invariant cache hit.
[2024-05-21 20:56:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:56:30] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-21 20:56:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:56:30] [INFO ] Invariant cache hit.
[2024-05-21 20:56:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 60/60 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 195 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND p0 (NOT p1))]
Finished random walk after 2804 steps, including 662 resets, run visited all 2 properties in 42 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22816 reset in 105 ms.
Product exploration explored 100000 steps with 22858 reset in 107 ms.
Built C files in :
/tmp/ltsmin8140995584228951167
[2024-05-21 20:56:31] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 20:56:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:31] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 20:56:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:31] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 20:56:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8140995584228951167
Running compilation step : cd /tmp/ltsmin8140995584228951167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin8140995584228951167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8140995584228951167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4779457612426575480.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-11 finished in 2029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 70 transition count 86
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 70 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 65 transition count 79
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 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 10 ms. Remains 61 /82 variables (removed 21) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 61 cols
[2024-05-21 20:56:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:56:31] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 20:56:31] [INFO ] Invariant cache hit.
[2024-05-21 20:56:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:56:31] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-21 20:56:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:31] [INFO ] Invariant cache hit.
[2024-05-21 20:56:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/82 places, 71/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 61/82 places, 71/106 transitions.
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s60 1)), p0:(AND (GEQ s1 1) (GEQ s60 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 23016 reset in 89 ms.
Product exploration explored 100000 steps with 22780 reset in 93 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Finished random walk after 908 steps, including 195 resets, run visited all 2 properties in 14 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 20:56:32] [INFO ] Invariant cache hit.
[2024-05-21 20:56:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 20:56:32] [INFO ] Invariant cache hit.
[2024-05-21 20:56:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:56:32] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 20:56:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:32] [INFO ] Invariant cache hit.
[2024-05-21 20:56:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 61/61 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Finished random walk after 2536 steps, including 554 resets, run visited all 2 properties in 33 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Product exploration explored 100000 steps with 22940 reset in 80 ms.
Product exploration explored 100000 steps with 22883 reset in 97 ms.
Built C files in :
/tmp/ltsmin12656278508234494712
[2024-05-21 20:56:33] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 20:56:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:33] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 20:56:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:33] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 20:56:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:33] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12656278508234494712
Running compilation step : cd /tmp/ltsmin12656278508234494712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin12656278508234494712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12656278508234494712;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8565468617856704990.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 71/71 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 20:56:48] [INFO ] Invariant cache hit.
[2024-05-21 20:56:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:56:48] [INFO ] Invariant cache hit.
[2024-05-21 20:56:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:56:48] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:56:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:56:48] [INFO ] Invariant cache hit.
[2024-05-21 20:56:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 61/61 places, 71/71 transitions.
Built C files in :
/tmp/ltsmin1595134439783503321
[2024-05-21 20:56:48] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-21 20:56:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:48] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-21 20:56:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:48] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-21 20:56:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:56:48] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1595134439783503321
Running compilation step : cd /tmp/ltsmin1595134439783503321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin1595134439783503321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1595134439783503321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11396621258513797634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:57:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:57:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:57:03] [INFO ] Time to serialize gal into /tmp/LTL3497907629859804016.gal : 4 ms
[2024-05-21 20:57:03] [INFO ] Time to serialize properties into /tmp/LTL7187582499393974875.prop : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3497907629859804016.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8665247514272200842.hoa' '-atoms' '/tmp/LTL7187582499393974875.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7187582499393974875.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8665247514272200842.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t62, t75, t76, t77, t78, t80, t81, t82, t83, t84, t85, t86, t87, t8...294
Detected timeout of ITS tools.
[2024-05-21 20:57:18] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:57:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:57:18] [INFO ] Time to serialize gal into /tmp/LTL485314174865370332.gal : 1 ms
[2024-05-21 20:57:18] [INFO ] Time to serialize properties into /tmp/LTL5949351239358455035.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL485314174865370332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5949351239358455035.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((s1<1)||(l510<1))")))||(("((s1>=1)&&(l510>=1))")&&(F("((s1<1)||(l510<1))"))))))
Formula 0 simplified : G(FG!"((s1<1)||(l510<1))" & (!"((s1>=1)&&(l510>=1))" | G!"((s1<1)||(l510<1))"))
Detected timeout of ITS tools.
[2024-05-21 20:57:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:57:33] [INFO ] Applying decomposition
[2024-05-21 20:57:33] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11388959343649590324.txt' '-o' '/tmp/graph11388959343649590324.bin' '-w' '/tmp/graph11388959343649590324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11388959343649590324.bin' '-l' '-1' '-v' '-w' '/tmp/graph11388959343649590324.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:57:33] [INFO ] Decomposing Gal with order
[2024-05-21 20:57:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:57:34] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-21 20:57:34] [INFO ] Flatten gal took : 22 ms
[2024-05-21 20:57:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 2 ms.
[2024-05-21 20:57:34] [INFO ] Time to serialize gal into /tmp/LTL15274067021841560414.gal : 1 ms
[2024-05-21 20:57:34] [INFO ] Time to serialize properties into /tmp/LTL18142893996675098061.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15274067021841560414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18142893996675098061.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((u3.s1<1)||(u3.l510<1))")))||(("((u3.s1>=1)&&(u3.l510>=1))")&&(F("((u3.s1<1)||(u3.l510<1))"))))))
Formula 0 simplified : G(FG!"((u3.s1<1)||(u3.l510<1))" & (!"((u3.s1>=1)&&(u3.l510>=1))" | G!"((u3.s1<1)||(u3.l510<1))"))
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t29, t62, t75, t76, t78, t80, t81, t82, t83, t84, t85, t86, t87, t88, t92, t96, t...287
Computing Next relation with stutter on 3.79408e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15093864890029071141
[2024-05-21 20:57:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15093864890029071141
Running compilation step : cd /tmp/ltsmin15093864890029071141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin15093864890029071141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15093864890029071141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-13 finished in 92515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 89
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 89
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 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 83
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 79
Iterating global reduction 2 with 1 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
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
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 75
Applied a total of 40 rules in 13 ms. Remains 64 /82 variables (removed 18) and now considering 75/106 (removed 31) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 20:58:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:58:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
[2024-05-21 20:58:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:58:04] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-21 20:58:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
[2024-05-21 20:58:04] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 75/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 64/82 places, 75/106 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-14 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 s62 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-d0m10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-14 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (!F((F(p0)||F(G(p0))))||!p1)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 87
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 87
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 71 transition count 86
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 67 transition count 82
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 79
Applied a total of 35 rules in 8 ms. Remains 65 /82 variables (removed 17) and now considering 79/106 (removed 27) transitions.
// Phase 1: matrix 79 rows 65 cols
[2024-05-21 20:58:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:58:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
[2024-05-21 20:58:04] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:58:04] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-21 20:58:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:58:04] [INFO ] Invariant cache hit.
[2024-05-21 20:58:04] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/82 places, 79/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 65/82 places, 79/106 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s42 1)), p1:(OR (LT s1 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-15 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((!p0 U (p1||G(!p0)))))||(F((!p0 U (p1||G(!p0))))&&G(!p2)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m10-LTLFireability-08
Stuttering acceptance computed with spot in 183 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 106/106 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 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 21 place count 72 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 69 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 69 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 67 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 66 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 65 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 65 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 38 place count 65 transition count 74
Applied a total of 38 rules in 10 ms. Remains 65 /82 variables (removed 17) and now considering 74/106 (removed 32) transitions.
// Phase 1: matrix 74 rows 65 cols
[2024-05-21 20:58:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:58:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 20:58:05] [INFO ] Invariant cache hit.
[2024-05-21 20:58:05] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:58:05] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 20:58:05] [INFO ] Invariant cache hit.
[2024-05-21 20:58:05] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 65/82 places, 74/106 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 179 ms. Remains : 65/82 places, 74/106 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s60 1))) (NOT (AND (GEQ s1 1) (GEQ s58 1)))), p0:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22893 reset in 96 ms.
Product exploration explored 100000 steps with 22840 reset in 100 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 537 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 20:58:05] [INFO ] Invariant cache hit.
[2024-05-21 20:58:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:58:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:58:05] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 20:58:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:58:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:58:05] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 20:58:05] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:58:05] [INFO ] After 15ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 20:58:06] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-21 20:58:06] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 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 73
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 64/65 places, 73/74 transitions.
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 7757 steps, run visited all 2 properties in 19 ms. (steps per millisecond=408 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 19 ms. (steps per millisecond=408 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 189 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:58:06] [INFO ] Invariant cache hit.
[2024-05-21 20:58:06] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:58:06] [INFO ] Invariant cache hit.
[2024-05-21 20:58:06] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:58:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:58:06] [INFO ] Invariant cache hit.
[2024-05-21 20:58:06] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 65/65 places, 74/74 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 209 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2334 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 20:58:07] [INFO ] Invariant cache hit.
[2024-05-21 20:58:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:58:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:58:07] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 20:58:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:58:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:58:07] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 20:58:07] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:58:07] [INFO ] After 25ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 20:58:07] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 20:58:07] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 74/74 transitions.
Graph (complete) has 190 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 73
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 73/74 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 64/65 places, 73/74 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 526 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 530 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7757 steps, run visited all 3 properties in 17 ms. (steps per millisecond=456 )
Probabilistic random walk after 7757 steps, saw 3469 distinct states, run finished after 17 ms. (steps per millisecond=456 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 358 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0)]
Product exploration explored 100000 steps with 22879 reset in 104 ms.
Product exploration explored 100000 steps with 22916 reset in 100 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 198 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p2 (NOT p1) p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:58:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:58:09] [INFO ] Invariant cache hit.
[2024-05-21 20:58:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin8285420521554161089
[2024-05-21 20:58:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8285420521554161089
Running compilation step : cd /tmp/ltsmin8285420521554161089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin8285420521554161089;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8285420521554161089;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7902983177887500487.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, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 20:58:24] [INFO ] Invariant cache hit.
[2024-05-21 20:58:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 20:58:24] [INFO ] Invariant cache hit.
[2024-05-21 20:58:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:58:24] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-21 20:58:24] [INFO ] Invariant cache hit.
[2024-05-21 20:58:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 65/65 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin5033795885171872957
[2024-05-21 20:58:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5033795885171872957
Running compilation step : cd /tmp/ltsmin5033795885171872957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin5033795885171872957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5033795885171872957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5983725976022832091.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:58:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:58:39] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:58:39] [INFO ] Time to serialize gal into /tmp/LTL13056800062086701814.gal : 1 ms
[2024-05-21 20:58:39] [INFO ] Time to serialize properties into /tmp/LTL14352902677512237139.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13056800062086701814.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6866940444229395427.hoa' '-atoms' '/tmp/LTL14352902677512237139.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14352902677512237139.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6866940444229395427.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Computing Next relation with stutter on 4.68705e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:58:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:58:54] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:58:54] [INFO ] Time to serialize gal into /tmp/LTL11914025671052698174.gal : 1 ms
[2024-05-21 20:58:54] [INFO ] Time to serialize properties into /tmp/LTL8445220043928952773.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11914025671052698174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8445220043928952773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...311
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F!"((s1<1)||(l133<1))" | G("((s1>=1)&&(l34...221
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t62, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t8...314
Computing Next relation with stutter on 4.68705e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:59:09] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:59:09] [INFO ] Applying decomposition
[2024-05-21 20:59:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13279584215620508491.txt' '-o' '/tmp/graph13279584215620508491.bin' '-w' '/tmp/graph13279584215620508491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13279584215620508491.bin' '-l' '-1' '-v' '-w' '/tmp/graph13279584215620508491.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:59:09] [INFO ] Decomposing Gal with order
[2024-05-21 20:59:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:59:09] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 20:59:09] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:59:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 2 ms.
[2024-05-21 20:59:09] [INFO ] Time to serialize gal into /tmp/LTL12478294292499930393.gal : 2 ms
[2024-05-21 20:59:09] [INFO ] Time to serialize properties into /tmp/LTL1307230208801883144.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12478294292499930393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1307230208801883144.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((i0.u0.s1>=1)&&(i6.u10.l345>=1))"))U(("((!((i0.u0.s1>=1)&&(i5.u13.l484>=1)))&&(!((i0.u0.s1>=1)&&(i6.u10.l345>=1))))...427
Formula 0 simplified : XXG(FG("((i0.u0.s1>=1)&&(i6.u10.l345>=1))" M !"((!((i0.u0.s1>=1)&&(i5.u13.l484>=1)))&&(!((i0.u0.s1>=1)&&(i6.u10.l345>=1))))") & (F!"...311
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12702594245224995054
[2024-05-21 20:59:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12702594245224995054
Running compilation step : cd /tmp/ltsmin12702594245224995054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin12702594245224995054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12702594245224995054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d0m10-LTLFireability-08 finished in 95459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&p1))))'
[2024-05-21 20:59:40] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2130844934465205210
[2024-05-21 20:59:40] [INFO ] Computing symmetric may disable matrix : 106 transitions.
[2024-05-21 20:59:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:40] [INFO ] Computing symmetric may enable matrix : 106 transitions.
[2024-05-21 20:59:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:40] [INFO ] Applying decomposition
[2024-05-21 20:59:40] [INFO ] Computing Do-Not-Accords matrix : 106 transitions.
[2024-05-21 20:59:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:59:40] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:59:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2130844934465205210
Running compilation step : cd /tmp/ltsmin2130844934465205210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17021220367647730201.txt' '-o' '/tmp/graph17021220367647730201.bin' '-w' '/tmp/graph17021220367647730201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17021220367647730201.bin' '-l' '-1' '-v' '-w' '/tmp/graph17021220367647730201.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:59:40] [INFO ] Decomposing Gal with order
[2024-05-21 20:59:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:59:40] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-21 20:59:40] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 3 ms.
[2024-05-21 20:59:40] [INFO ] Time to serialize gal into /tmp/LTLFireability1911140195750601786.gal : 2 ms
[2024-05-21 20:59:40] [INFO ] Time to serialize properties into /tmp/LTLFireability1855212837193246915.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1911140195750601786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1855212837193246915.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((i7.u0.s1>=1)&&(i2.u14.l345>=1))"))U(("((!((i7.u0.s1>=1)&&(i6.u17.l484>=1)))&&(!((i7.u0.s1>=1)&&(i2.u14.l345>=1))))...432
Formula 0 simplified : XXG(FG("((i7.u0.s1>=1)&&(i2.u14.l345>=1))" M !"((!((i7.u0.s1>=1)&&(i6.u17.l484>=1)))&&(!((i7.u0.s1>=1)&&(i2.u14.l345>=1))))") & (F"(...312
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin2130844934465205210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin2130844934465205210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: LTL layer: formula: X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 4/ 8), 0.003: "X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: There are 112 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.029: State length is 83, there are 119 groups
pins2lts-mc-linux64( 0/ 8), 0.029: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.029: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.029: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.029: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.037: [Blue] ~40 levels ~960 states ~2504 transitions
pins2lts-mc-linux64( 1/ 8), 0.040: [Blue] ~46 levels ~1920 states ~4672 transitions
pins2lts-mc-linux64( 1/ 8), 0.059: [Blue] ~46 levels ~3840 states ~8520 transitions
pins2lts-mc-linux64( 1/ 8), 0.103: [Blue] ~46 levels ~7680 states ~16776 transitions
pins2lts-mc-linux64( 1/ 8), 0.269: [Blue] ~64 levels ~15360 states ~35200 transitions
pins2lts-mc-linux64( 1/ 8), 0.472: [Blue] ~133 levels ~30720 states ~68224 transitions
pins2lts-mc-linux64( 1/ 8), 0.878: [Blue] ~263 levels ~61440 states ~134472 transitions
pins2lts-mc-linux64( 1/ 8), 2.256: [Blue] ~438 levels ~122880 states ~280328 transitions
pins2lts-mc-linux64( 0/ 8), 4.170: [Blue] ~349 levels ~245760 states ~601328 transitions
pins2lts-mc-linux64( 7/ 8), 6.421: [Blue] ~91 levels ~491520 states ~1057808 transitions
pins2lts-mc-linux64( 5/ 8), 10.722: [Blue] ~84 levels ~983040 states ~2182544 transitions
pins2lts-mc-linux64( 7/ 8), 16.023: [Blue] ~91 levels ~1966080 states ~4338288 transitions
pins2lts-mc-linux64( 6/ 8), 22.328: [Blue] ~3978 levels ~3932160 states ~10582336 transitions
pins2lts-mc-linux64( 1/ 8), 31.622: [Blue] ~38705 levels ~7864320 states ~19661320 transitions
pins2lts-mc-linux64( 6/ 8), 49.587: [Blue] ~27491 levels ~15728640 states ~44081504 transitions
pins2lts-mc-linux64( 6/ 8), 77.503: [Blue] ~49380 levels ~31457280 states ~88878240 transitions
pins2lts-mc-linux64( 1/ 8), 138.690: [Blue] ~157460 levels ~62914560 states ~178515592 transitions
pins2lts-mc-linux64( 6/ 8), 252.907: [Blue] ~134679 levels ~125829120 states ~372393824 transitions
pins2lts-mc-linux64( 6/ 8), 311.234: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 311.288:
pins2lts-mc-linux64( 0/ 8), 311.288: Explored 141812689 states 438778984 transitions, fanout: 3.094
pins2lts-mc-linux64( 0/ 8), 311.288: Total exploration time 311.240 sec (311.180 sec minimum, 311.206 sec on average)
pins2lts-mc-linux64( 0/ 8), 311.288: States per second: 455638, Transitions per second: 1409777
pins2lts-mc-linux64( 0/ 8), 311.288:
pins2lts-mc-linux64( 0/ 8), 311.288: State space has 134217198 states, 6166499 are accepting
pins2lts-mc-linux64( 0/ 8), 311.288: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 311.288: blue states: 141812689 (105.66%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 311.288: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 311.288: all-red states: 6166499 (4.59%), bogus 618 (0.00%)
pins2lts-mc-linux64( 0/ 8), 311.288:
pins2lts-mc-linux64( 0/ 8), 311.288: Total memory used for local state coloring: 107.0MB
pins2lts-mc-linux64( 0/ 8), 311.288:
pins2lts-mc-linux64( 0/ 8), 311.288: Queue width: 8B, total height: 7015152, memory: 53.52MB
pins2lts-mc-linux64( 0/ 8), 311.288: Tree memory: 1219.8MB, 9.5 B/state, compr.: 2.9%
pins2lts-mc-linux64( 0/ 8), 311.288: Tree fill ratio (roots/leafs): 99.0%/76.0%
pins2lts-mc-linux64( 0/ 8), 311.288: Stored 106 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 311.288: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 311.289: Est. total memory use: 1273.3MB (~1077.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2130844934465205210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2130844934465205210;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(<>((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))&&[](!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t8, t9, t11, t25, t26, t27, t28, t29, t30, t31, t33, t34, t48, t54, t55, t56, t63, t6...431
Computing Next relation with stutter on 5.07298e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:21:20] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:21:20] [INFO ] Time to serialize gal into /tmp/LTLFireability16155969654179310774.gal : 1 ms
[2024-05-21 21:21:20] [INFO ] Time to serialize properties into /tmp/LTLFireability18148010422575441464.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16155969654179310774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18148010422575441464.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((X(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...316
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F"((s1>=1)&&(l133>=1))" | G("((s1>=1)&&(l3...222
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...451
Computing Next relation with stutter on 5.07298e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-21 21:43:00] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:43:00] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-21 21:43:00] [INFO ] Transformed 82 places.
[2024-05-21 21:43:00] [INFO ] Transformed 106 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 21:43:00] [INFO ] Time to serialize gal into /tmp/LTLFireability7700029548327035003.gal : 1 ms
[2024-05-21 21:43:00] [INFO ] Time to serialize properties into /tmp/LTLFireability3336722007405549672.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7700029548327035003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3336722007405549672.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F((G(F((!("((s1>=1)&&(l345>=1))"))U(("((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))")||(G(!("((s1>=1)&&(l345>=1))")))))))|...316
Formula 0 simplified : XXG(FG("((s1>=1)&&(l345>=1))" M !"((!((s1>=1)&&(l484>=1)))&&(!((s1>=1)&&(l345>=1))))") & (F"((s1>=1)&&(l133>=1))" | G("((s1>=1)&&(l3...222
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...451
Computing Next relation with stutter on 5.07298e+08 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12009388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038252 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d0m10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208300303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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