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.r597-smll-171734926300018.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 MedleyA-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-LTLFireability-00
FORMULA_NAME MedleyA-PT-04-LTLFireability-01
FORMULA_NAME MedleyA-PT-04-LTLFireability-02
FORMULA_NAME MedleyA-PT-04-LTLFireability-03
FORMULA_NAME MedleyA-PT-04-LTLFireability-04
FORMULA_NAME MedleyA-PT-04-LTLFireability-05
FORMULA_NAME MedleyA-PT-04-LTLFireability-06
FORMULA_NAME MedleyA-PT-04-LTLFireability-07
FORMULA_NAME MedleyA-PT-04-LTLFireability-08
FORMULA_NAME MedleyA-PT-04-LTLFireability-09
FORMULA_NAME MedleyA-PT-04-LTLFireability-10
FORMULA_NAME MedleyA-PT-04-LTLFireability-11
FORMULA_NAME MedleyA-PT-04-LTLFireability-12
FORMULA_NAME MedleyA-PT-04-LTLFireability-13
FORMULA_NAME MedleyA-PT-04-LTLFireability-14
FORMULA_NAME MedleyA-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361601612

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=MedleyA-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:53:24] [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-06-02 20:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:53:24] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-02 20:53:24] [INFO ] Transformed 115 places.
[2024-06-02 20:53:24] [INFO ] Transformed 107 transitions.
[2024-06-02 20:53:24] [INFO ] Found NUPN structural information;
[2024-06-02 20:53:24] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 107 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 107 transition count 100
Applied a total of 15 rules in 40 ms. Remains 107 /115 variables (removed 8) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 107 cols
[2024-06-02 20:53:25] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 20:53:25] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-02 20:53:25] [INFO ] Invariant cache hit.
[2024-06-02 20:53:25] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-06-02 20:53:25] [INFO ] Invariant cache hit.
[2024-06-02 20:53:25] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/115 places, 100/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 107/115 places, 100/107 transitions.
Support contains 35 out of 107 places after structural reductions.
[2024-06-02 20:53:26] [INFO ] Flatten gal took : 45 ms
[2024-06-02 20:53:26] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:53:26] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 1075 ms. (steps per millisecond=9 ) properties (out of 32) seen :21
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 20:53:28] [INFO ] Invariant cache hit.
[2024-06-02 20:53:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:53:28] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 20:53:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:53:28] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 6 ms to minimize.
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:53:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:53:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:53:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-06-02 20:53:29] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-06-02 20:53:29] [INFO ] After 941ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 14 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 107 transition count 88
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 95 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 94 transition count 87
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 26 place count 94 transition count 77
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 84 transition count 77
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 80 transition count 73
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 80 transition count 73
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 84 place count 65 transition count 58
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 65 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 63 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 61 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 60 transition count 54
Applied a total of 93 rules in 53 ms. Remains 60 /107 variables (removed 47) and now considering 54/100 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 60/107 places, 54/100 transitions.
Incomplete random walk after 10000 steps, including 766 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 348 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 368 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 327 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 323 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 338 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 333 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 318 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 310 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 335 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Finished probabilistic random walk after 169146 steps, run visited all 9 properties in 648 ms. (steps per millisecond=261 )
Probabilistic random walk after 169146 steps, saw 48804 distinct states, run finished after 649 ms. (steps per millisecond=260 ) properties seen :9
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 107 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 107 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 21 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 20:53:32] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:53:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 20:53:32] [INFO ] Invariant cache hit.
[2024-06-02 20:53:32] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 20:53:32] [INFO ] Invariant cache hit.
[2024-06-02 20:53:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 331 ms. Remains : 98/107 places, 91/100 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 264 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-00 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:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2779 reset in 483 ms.
Product exploration explored 100000 steps with 2778 reset in 252 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 20:53:34] [INFO ] Invariant cache hit.
[2024-06-02 20:53:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:34] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 20:53:34] [INFO ] Computed and/alt/rep : 88/142/88 causal constraints (skipped 2 transitions) in 13 ms.
[2024-06-02 20:53:34] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-02 20:53:34] [INFO ] Invariant cache hit.
[2024-06-02 20:53:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:53:34] [INFO ] Invariant cache hit.
[2024-06-02 20:53:34] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-06-02 20:53:34] [INFO ] Invariant cache hit.
[2024-06-02 20:53:34] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 98/98 places, 91/91 transitions.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 20:53:35] [INFO ] Invariant cache hit.
[2024-06-02 20:53:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:53:35] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-02 20:53:35] [INFO ] Computed and/alt/rep : 88/142/88 causal constraints (skipped 2 transitions) in 13 ms.
[2024-06-02 20:53:35] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2787 reset in 134 ms.
Product exploration explored 100000 steps with 2783 reset in 209 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 98 transition count 91
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 9 place count 98 transition count 98
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 21 place count 98 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 97 transition count 96
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 97 transition count 96
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 97 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 94 transition count 93
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 94 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 94 transition count 117
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 51 rules in 27 ms. Remains 94 /98 variables (removed 4) and now considering 117/91 (removed -26) transitions.
[2024-06-02 20:53:36] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 117 rows 94 cols
[2024-06-02 20:53:36] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 20:53:36] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 117/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 94/98 places, 117/91 transitions.
Built C files in :
/tmp/ltsmin5249525512436265578
[2024-06-02 20:53:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5249525512436265578
Running compilation step : cd /tmp/ltsmin5249525512436265578;'/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 416 ms.
Running link step : cd /tmp/ltsmin5249525512436265578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5249525512436265578;'/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/stateBased7882023431776027416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 20:53:51] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:53:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
[2024-06-02 20:53:51] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 20:53:51] [INFO ] Invariant cache hit.
[2024-06-02 20:53:51] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 98/98 places, 91/91 transitions.
Built C files in :
/tmp/ltsmin11139005564037711292
[2024-06-02 20:53:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11139005564037711292
Running compilation step : cd /tmp/ltsmin11139005564037711292;'/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 265 ms.
Running link step : cd /tmp/ltsmin11139005564037711292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11139005564037711292;'/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/stateBased16479069367535891832.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 20:54:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 20:54:07] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:54:07] [INFO ] Time to serialize gal into /tmp/LTL9458137658058765989.gal : 4 ms
[2024-06-02 20:54:07] [INFO ] Time to serialize properties into /tmp/LTL7618023339095797454.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/LTL9458137658058765989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14514625876333938685.hoa' '-atoms' '/tmp/LTL7618023339095797454.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/LTL7618023339095797454.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14514625876333938685.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t12, t15, t20, t22, t28, t31, t36, t39, t44, t46, t53, t58, t85, t94, Intersecti...242
Computing Next relation with stutter on 8407 deadlock states
1000 unique states visited
0 strongly connected components in search stack
1000 transitions explored
1000 items max in DFS search stack
923 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.28384,237324,1,0,4976,1.11711e+06,205,5934,2864,1.86642e+06,12978
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-04-LTLFireability-00 finished in 46115 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((X(X(X(F(p1))))&&p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 7 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
[2024-06-02 20:54:18] [INFO ] Invariant cache hit.
[2024-06-02 20:54:18] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 20:54:18] [INFO ] Invariant cache hit.
[2024-06-02 20:54:18] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-02 20:54:18] [INFO ] Invariant cache hit.
[2024-06-02 20:54:18] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s69 1) (EQ s91 1)), p1:(OR (AND (EQ s69 1) (EQ s91 1)) (AND (EQ s69 1) (EQ s85 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-01 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p2)&&p1)))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 56 transition count 50
Applied a total of 98 rules in 26 ms. Remains 56 /107 variables (removed 51) and now considering 50/100 (removed 50) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 20:54:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:54:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:54:18] [INFO ] Invariant cache hit.
[2024-06-02 20:54:18] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-02 20:54:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:54:18] [INFO ] Invariant cache hit.
[2024-06-02 20:54:19] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/107 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 56/107 places, 50/100 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s3 1) (NEQ s15 1)), p0:(AND (EQ s2 1) (EQ s17 1)), p2:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-03 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||(X(F(p2))&&G(p3))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 90 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 58 transition count 52
Applied a total of 94 rules in 23 ms. Remains 58 /107 variables (removed 49) and now considering 52/100 (removed 48) transitions.
// Phase 1: matrix 52 rows 58 cols
[2024-06-02 20:54:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:54:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:54:19] [INFO ] Invariant cache hit.
[2024-06-02 20:54:19] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 20:54:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:54:19] [INFO ] Invariant cache hit.
[2024-06-02 20:54:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/107 places, 52/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 58/107 places, 52/100 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p0) (AND p3 p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p3 p0), acceptance={1} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 3}, { cond=(OR p1 p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p3 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p3 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s3 1), p0:(EQ s6 1), p3:(NEQ s1 1), p2:(NEQ s19 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 12825 reset in 267 ms.
Product exploration explored 100000 steps with 12858 reset in 274 ms.
Computed a total of 58 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p2), (X (NOT p3)), (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND p1 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (OR (AND p1 p0) (AND p3 p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p2)), (X (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND p3 p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR p1 p3))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G p1)), (F (G (NOT p0))), (F (G p3)), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3)))))]
Knowledge based reduction with 43 factoid took 1702 ms. Reduced automaton from 9 states, 34 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 546 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:54:22] [INFO ] Invariant cache hit.
[2024-06-02 20:54:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:54:22] [INFO ] After 33ms 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 p1 (NOT p0) p3 p2), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p2), (X (NOT p3)), (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND p1 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (OR (AND p1 p0) (AND p3 p0)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p2)), (X (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND p3 p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR p1 p3))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (G p1)), (F (G (NOT p0))), (F (G p3)), (F (G p2)), (G (NOT (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (F (NOT p1)), (F (NOT p3)), (F (AND (NOT p1) p3))]
Knowledge based reduction with 44 factoid took 2089 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Support contains 2 out of 58 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-06-02 20:54:24] [INFO ] Invariant cache hit.
[2024-06-02 20:54:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:54:24] [INFO ] Invariant cache hit.
[2024-06-02 20:54:24] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-02 20:54:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:54:24] [INFO ] Invariant cache hit.
[2024-06-02 20:54:24] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 58/58 places, 52/52 transitions.
Computed a total of 58 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p1) p3))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p1)), (F (G p3)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 11 factoid took 283 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 564 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:54:25] [INFO ] Invariant cache hit.
[2024-06-02 20:54:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 20:54:25] [INFO ] After 31ms 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 p3 p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X (NOT (AND (NOT p1) p3))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p1)), (F (G p3)), (F (G p1)), (G (NOT (AND (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p1)), (F (NOT p3)), (F (AND p3 (NOT p1)))]
Knowledge based reduction with 12 factoid took 528 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 12875 reset in 136 ms.
Product exploration explored 100000 steps with 12885 reset in 155 ms.
Built C files in :
/tmp/ltsmin9292392078234345826
[2024-06-02 20:54:26] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-06-02 20:54:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:26] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-06-02 20:54:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:26] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-06-02 20:54:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9292392078234345826
Running compilation step : cd /tmp/ltsmin9292392078234345826;'/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 225 ms.
Running link step : cd /tmp/ltsmin9292392078234345826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9292392078234345826;'/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/stateBased15363950276717192995.hoa' '--buchi-type=spotba'
LTSmin run took 1005 ms.
FORMULA MedleyA-PT-04-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-04 finished in 8681 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))&&(G(p1)||F(p2))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 3 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 20:54:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:54:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:54:27] [INFO ] Invariant cache hit.
[2024-06-02 20:54:28] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 20:54:28] [INFO ] Invariant cache hit.
[2024-06-02 20:54:28] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s22 1), p2:(AND (EQ s70 1) (EQ s82 1)), p1:(OR (EQ s70 0) (EQ s79 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-05 finished in 466 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 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 100 transition count 93
Applied a total of 14 rules in 6 ms. Remains 100 /107 variables (removed 7) and now considering 93/100 (removed 7) transitions.
// Phase 1: matrix 93 rows 100 cols
[2024-06-02 20:54:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:54:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 20:54:28] [INFO ] Invariant cache hit.
[2024-06-02 20:54:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 20:54:28] [INFO ] Invariant cache hit.
[2024-06-02 20:54:28] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/107 places, 93/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 100/107 places, 93/100 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-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:(OR (EQ s10 1) (AND (EQ s71 1) (EQ s80 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 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-06 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F((p1&&G(!p2))) U p3)))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 6 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 20:54:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:54:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:54:28] [INFO ] Invariant cache hit.
[2024-06-02 20:54:28] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 20:54:28] [INFO ] Invariant cache hit.
[2024-06-02 20:54:29] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p1) p2), p2]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s14 1), p3:(OR (EQ s71 1) (AND (EQ s69 1) (EQ s94 1))), p1:(EQ s22 1), p2:(AND (EQ s69 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-07 finished in 543 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 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 8 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
[2024-06-02 20:54:29] [INFO ] Invariant cache hit.
[2024-06-02 20:54:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:54:29] [INFO ] Invariant cache hit.
[2024-06-02 20:54:29] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-02 20:54:29] [INFO ] Invariant cache hit.
[2024-06-02 20:54:29] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s42 1) (NEQ s48 1) (NEQ s69 1) (NEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2828 reset in 119 ms.
Product exploration explored 100000 steps with 2771 reset in 138 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 278 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2375689 steps, run timeout after 3001 ms. (steps per millisecond=791 ) properties seen :{}
Probabilistic random walk after 2375689 steps, saw 412650 distinct states, run finished after 3005 ms. (steps per millisecond=790 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:54:33] [INFO ] Invariant cache hit.
[2024-06-02 20:54:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:54:33] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 20:54:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-02 20:54:33] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:54:33] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:54:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:54:33] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:54:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:54:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-02 20:54:33] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-06-02 20:54:33] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 91/91 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 98 transition count 82
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 89 transition count 82
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 89 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 79 transition count 72
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 80 place count 58 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 58 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 57 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 55 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 54 transition count 48
Applied a total of 86 rules in 20 ms. Remains 54 /98 variables (removed 44) and now considering 48/91 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 54/98 places, 48/91 transitions.
Incomplete random walk after 10000 steps, including 746 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 320 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 12130 steps, run visited all 1 properties in 21 ms. (steps per millisecond=577 )
Probabilistic random walk after 12130 steps, saw 4525 distinct states, run finished after 21 ms. (steps per millisecond=577 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-08 finished in 4434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 91 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 89 transition count 82
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 34 place count 89 transition count 71
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 56 place count 78 transition count 71
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 74 transition count 67
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 74 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 53 transition count 47
Applied a total of 104 rules in 18 ms. Remains 53 /107 variables (removed 54) and now considering 47/100 (removed 53) transitions.
// Phase 1: matrix 47 rows 53 cols
[2024-06-02 20:54:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:54:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:54:33] [INFO ] Invariant cache hit.
[2024-06-02 20:54:33] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-02 20:54:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:54:33] [INFO ] Invariant cache hit.
[2024-06-02 20:54:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/107 places, 47/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 53/107 places, 47/100 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s22 1) (NEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16931 reset in 111 ms.
Product exploration explored 100000 steps with 16749 reset in 230 ms.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-09 finished in 735 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 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 6 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 20:54:34] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 20:54:34] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:54:34] [INFO ] Invariant cache hit.
[2024-06-02 20:54:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 20:54:34] [INFO ] Invariant cache hit.
[2024-06-02 20:54:34] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-10 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:(EQ s34 1), p1:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4794 reset in 169 ms.
Product exploration explored 100000 steps with 4805 reset in 145 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
[2024-06-02 20:54:35] [INFO ] Invariant cache hit.
[2024-06-02 20:54:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:35] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 20:54:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:36] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 20:54:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:54:36] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:54:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-06-02 20:54:36] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 2 transitions) in 10 ms.
[2024-06-02 20:54:36] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:54:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-06-02 20:54:36] [INFO ] Added : 78 causal constraints over 17 iterations in 276 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 83
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 90 transition count 83
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 16 place count 90 transition count 71
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 40 place count 78 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 78 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 56 transition count 50
Applied a total of 83 rules in 16 ms. Remains 56 /99 variables (removed 43) and now considering 50/92 (removed 42) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 20:54:36] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 20:54:36] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:54:36] [INFO ] Invariant cache hit.
[2024-06-02 20:54:36] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-02 20:54:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 20:54:36] [INFO ] Invariant cache hit.
[2024-06-02 20:54:36] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 56/99 places, 50/92 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-02 20:54:37] [INFO ] Invariant cache hit.
[2024-06-02 20:54:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:37] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:37] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:54:37] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 20:54:37] [INFO ] Computed and/alt/rep : 46/70/46 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 20:54:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 20:54:37] [INFO ] Added : 27 causal constraints over 6 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 32274 reset in 122 ms.
Product exploration explored 100000 steps with 32175 reset in 136 ms.
Built C files in :
/tmp/ltsmin12538349339657308864
[2024-06-02 20:54:38] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-06-02 20:54:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:38] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-06-02 20:54:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:38] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-06-02 20:54:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12538349339657308864
Running compilation step : cd /tmp/ltsmin12538349339657308864;'/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 226 ms.
Running link step : cd /tmp/ltsmin12538349339657308864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12538349339657308864;'/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/stateBased16492140021044530194.hoa' '--buchi-type=spotba'
LTSmin run took 75 ms.
FORMULA MedleyA-PT-04-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-10 finished in 3939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0) U p1)&&p2) U !F((X(p1)||p1))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 4 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 20:54:38] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:54:38] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 20:54:38] [INFO ] Invariant cache hit.
[2024-06-02 20:54:38] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 20:54:38] [INFO ] Invariant cache hit.
[2024-06-02 20:54:38] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 189 ms :[p1, true, p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s8 1), p2:(EQ s32 1), p0:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-12 finished in 555 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(((G(p0)&&X(p1)) U p1))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 4 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 20:54:38] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:54:39] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 20:54:39] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (EQ s42 1) (EQ s48 1)), p1:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-13 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 107 transition count 85
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 92 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 34 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 54 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 77 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 98 place count 58 transition count 51
Applied a total of 98 rules in 12 ms. Remains 58 /107 variables (removed 49) and now considering 51/100 (removed 49) transitions.
// Phase 1: matrix 51 rows 58 cols
[2024-06-02 20:54:39] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants in 70 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/107 places, 51/100 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 50
Applied a total of 2 rules in 4 ms. Remains 56 /57 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 20:54:39] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:54:39] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/107 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 56/107 places, 50/100 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1 0), p0:(EQ s9 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 13598 reset in 126 ms.
Product exploration explored 100000 steps with 13613 reset in 130 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-14 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((F(p2)&&p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 4 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 20:54:40] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 20:54:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:54:40] [INFO ] Invariant cache hit.
[2024-06-02 20:54:40] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 20:54:40] [INFO ] Invariant cache hit.
[2024-06-02 20:54:40] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s52 0) (EQ s61 0)), p2:(OR (EQ s19 0) (EQ s27 0)), p0:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7096 reset in 133 ms.
Product exploration explored 100000 steps with 7097 reset in 139 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 597 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 166 steps, including 4 resets, run visited all 5 properties in 2 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 1476 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 83
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 89 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 89 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 78 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 56 transition count 50
Applied a total of 83 rules in 13 ms. Remains 56 /99 variables (removed 43) and now considering 50/92 (removed 42) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 20:54:43] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 20:54:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:54:43] [INFO ] Invariant cache hit.
[2024-06-02 20:54:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 20:54:43] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-02 20:54:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 20:54:43] [INFO ] Invariant cache hit.
[2024-06-02 20:54:43] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 56/99 places, 50/92 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 726 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 6 factoid took 661 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-06-02 20:54:45] [INFO ] Invariant cache hit.
[2024-06-02 20:54:45] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 20:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:45] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-02 20:54:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:54:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 20:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:54:45] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:54:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 20:54:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-02 20:54:45] [INFO ] Computed and/alt/rep : 46/98/46 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-02 20:54:45] [INFO ] Added : 15 causal constraints over 3 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 34671 reset in 121 ms.
Product exploration explored 100000 steps with 34791 reset in 133 ms.
Built C files in :
/tmp/ltsmin3345862052698820977
[2024-06-02 20:54:46] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-06-02 20:54:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:46] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-06-02 20:54:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:46] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-06-02 20:54:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:54:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3345862052698820977
Running compilation step : cd /tmp/ltsmin3345862052698820977;'/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 209 ms.
Running link step : cd /tmp/ltsmin3345862052698820977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3345862052698820977;'/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/stateBased6985735773738004456.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA MedleyA-PT-04-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLFireability-15 finished in 6191 ms.
All properties solved by simple procedures.
Total runtime 81764 ms.

BK_STOP 1717361687783

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r597-smll-171734926300018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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