About the Execution of 2023-gold for UtilityControlRoom-PT-Z4T4N08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1672.268 | 77483.00 | 149391.00 | 740.50 | TTFFFFTFTFFFTFFF | normal |
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.r461-smll-171701123000168.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 UtilityControlRoom-PT-Z4T4N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701123000168
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 52K Apr 13 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 13 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 13 05:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 279K Apr 13 05:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Apr 13 06:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 214K Apr 13 06:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 196K Apr 13 06:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 758K Apr 13 06:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:43 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 UtilityControlRoom-PT-Z4T4N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717193669394
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=UtilityControlRoom-PT-Z4T4N08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 22:14:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 22:14:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:14:32] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-31 22:14:32] [INFO ] Transformed 302 places.
[2024-05-31 22:14:32] [INFO ] Transformed 600 transitions.
[2024-05-31 22:14:32] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-31 22:14:32] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 22:14:32] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 22:14:32] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-31 22:14:32] [INFO ] Reduced 24 identical enabling conditions.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 241 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 33 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2024-05-31 22:14:32] [INFO ] Computed 19 invariants in 37 ms
[2024-05-31 22:14:32] [INFO ] Implicit Places using invariants in 365 ms returned [245]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 409 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/302 places, 472/472 transitions.
Applied a total of 0 rules in 8 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 451 ms. Remains : 301/302 places, 472/472 transitions.
Support contains 241 out of 301 places after structural reductions.
[2024-05-31 22:14:33] [INFO ] Flatten gal took : 95 ms
[2024-05-31 22:14:33] [INFO ] Flatten gal took : 50 ms
[2024-05-31 22:14:33] [INFO ] Input system was already deterministic with 472 transitions.
Finished random walk after 2139 steps, including 0 resets, run visited all 26 properties in 163 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 37 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 38 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 22:14:34] [INFO ] Computed 18 invariants in 6 ms
[2024-05-31 22:14:34] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-31 22:14:34] [INFO ] Invariant cache hit.
[2024-05-31 22:14:34] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-31 22:14:34] [INFO ] Invariant cache hit.
[2024-05-31 22:14:34] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 205/301 places, 376/472 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 269 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s12 1) (GEQ s148 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s148 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ ...], 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 23565 reset in 633 ms.
Product exploration explored 100000 steps with 23687 reset in 491 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 22:14:37] [INFO ] Invariant cache hit.
[2024-05-31 22:14:37] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2024-05-31 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 22:14:38] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-31 22:14:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:14:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2024-05-31 22:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 22:14:39] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-05-31 22:14:39] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-31 22:14:40] [INFO ] Added : 280 causal constraints over 56 iterations in 1749 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 37 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-31 22:14:40] [INFO ] Invariant cache hit.
[2024-05-31 22:14:40] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-31 22:14:40] [INFO ] Invariant cache hit.
[2024-05-31 22:14:41] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-31 22:14:41] [INFO ] Invariant cache hit.
[2024-05-31 22:14:41] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-31 22:14:42] [INFO ] Invariant cache hit.
[2024-05-31 22:14:42] [INFO ] [Real]Absence check using 18 positive place invariants in 18 ms returned sat
[2024-05-31 22:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 22:14:43] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-31 22:14:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:14:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-31 22:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 22:14:43] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2024-05-31 22:14:43] [INFO ] Computed and/alt/rep : 368/616/368 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-31 22:14:45] [INFO ] Added : 280 causal constraints over 56 iterations in 1570 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23588 reset in 345 ms.
Product exploration explored 100000 steps with 23582 reset in 359 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 37 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 205 transition count 408
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 96 place count 205 transition count 376
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 96 rules in 42 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-31 22:14:46] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 22:14:46] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 22:14:47] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/205 places, 376/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 205/205 places, 376/376 transitions.
Built C files in :
/tmp/ltsmin9943482717259491173
[2024-05-31 22:14:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9943482717259491173
Running compilation step : cd /tmp/ltsmin9943482717259491173;'/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 1032 ms.
Running link step : cd /tmp/ltsmin9943482717259491173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9943482717259491173;'/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/stateBased10509580069314084692.hoa' '--buchi-type=spotba'
LTSmin run took 8513 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-00 finished in 22567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U p2)))'
Support contains 205 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 293 transition count 464
Applied a total of 16 rules in 22 ms. Remains 293 /301 variables (removed 8) and now considering 464/472 (removed 8) transitions.
// Phase 1: matrix 464 rows 293 cols
[2024-05-31 22:14:56] [INFO ] Computed 18 invariants in 4 ms
[2024-05-31 22:14:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 22:14:56] [INFO ] Invariant cache hit.
[2024-05-31 22:14:57] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-31 22:14:57] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 22:14:57] [INFO ] Invariant cache hit.
[2024-05-31 22:14:57] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/301 places, 464/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 778 ms. Remains : 293/301 places, 464/472 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s4 1) (GEQ s236 1)) (AND (GEQ s2 1) (GEQ s18 1) (GEQ s236 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s236 1)) (AND (GEQ s3 1) (GEQ s...], nbAcceptance=0, 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 21317 reset in 1136 ms.
Product exploration explored 100000 steps with 21132 reset in 1127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 442 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 403 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p0)]
[2024-05-31 22:15:01] [INFO ] Invariant cache hit.
[2024-05-31 22:15:01] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2024-05-31 22:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 22:15:01] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2024-05-31 22:15:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2024-05-31 22:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 22:15:02] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-05-31 22:15:02] [INFO ] Computed and/alt/rep : 424/640/424 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-31 22:15:05] [INFO ] Added : 318 causal constraints over 65 iterations in 2207 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 205 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 464/464 transitions.
Applied a total of 0 rules in 12 ms. Remains 293 /293 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-31 22:15:05] [INFO ] Invariant cache hit.
[2024-05-31 22:15:05] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 22:15:05] [INFO ] Invariant cache hit.
[2024-05-31 22:15:05] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-31 22:15:05] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 22:15:05] [INFO ] Invariant cache hit.
[2024-05-31 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 293/293 places, 464/464 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 313 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 393 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p0)]
[2024-05-31 22:15:06] [INFO ] Invariant cache hit.
[2024-05-31 22:15:07] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2024-05-31 22:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 22:15:08] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2024-05-31 22:15:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:15:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2024-05-31 22:15:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 22:15:08] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-05-31 22:15:09] [INFO ] Computed and/alt/rep : 424/640/424 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-31 22:15:11] [INFO ] Added : 318 causal constraints over 65 iterations in 2254 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 21194 reset in 1040 ms.
Product exploration explored 100000 steps with 21230 reset in 1064 ms.
Built C files in :
/tmp/ltsmin9085732288750683548
[2024-05-31 22:15:13] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-31 22:15:13] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 22:15:13] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-31 22:15:13] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 22:15:13] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-31 22:15:13] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 22:15:13] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9085732288750683548
Running compilation step : cd /tmp/ltsmin9085732288750683548;'/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 1621 ms.
Running link step : cd /tmp/ltsmin9085732288750683548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9085732288750683548;'/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/stateBased908867337491127538.hoa' '--buchi-type=spotba'
LTSmin run took 3325 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-02 finished in 21991 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(((X(!p0)&&G((!p1&&X(!p1))))||G(!p0)))))'
Support contains 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Applied a total of 526 rules in 28 ms. Remains 66 /301 variables (removed 235) and now considering 64/472 (removed 408) transitions.
// Phase 1: matrix 64 rows 66 cols
[2024-05-31 22:15:18] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 22:15:18] [INFO ] Implicit Places using invariants in 50 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/301 places, 64/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 65/301 places, 64/472 transitions.
Stuttering acceptance computed with spot in 223 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s33 1) (GEQ s34 1) (GEQ s39 1) (GEQ s40 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s38 1)), p0:(OR (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 27183 reset in 253 ms.
Product exploration explored 100000 steps with 27324 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 5 states, 21 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Finished random walk after 34 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 389 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Stuttering acceptance computed with spot in 244 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Support contains 16 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 65 cols
[2024-05-31 22:15:20] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 22:15:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 22:15:20] [INFO ] Invariant cache hit.
[2024-05-31 22:15:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-31 22:15:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 22:15:21] [INFO ] Invariant cache hit.
[2024-05-31 22:15:21] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 65/65 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(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)))))]
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Finished random walk after 33 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(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))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 383 ms. Reduced automaton from 6 states, 26 edges and 2 AP (stutter insensitive) to 6 states, 26 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Stuttering acceptance computed with spot in 313 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Stuttering acceptance computed with spot in 243 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), false, false]
Product exploration explored 100000 steps with 20869 reset in 265 ms.
Product exploration explored 100000 steps with 20879 reset in 279 ms.
Built C files in :
/tmp/ltsmin3158496812146912509
[2024-05-31 22:15:23] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-31 22:15:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 22:15:23] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-31 22:15:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 22:15:23] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-31 22:15:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 22:15:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3158496812146912509
Running compilation step : cd /tmp/ltsmin3158496812146912509;'/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 205 ms.
Running link step : cd /tmp/ltsmin3158496812146912509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3158496812146912509;'/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/stateBased8320703248438501912.hoa' '--buchi-type=spotba'
LTSmin run took 223 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-03 finished in 5144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 138 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 138 transition count 184
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 382 place count 114 transition count 160
Iterating global reduction 2 with 24 rules applied. Total rules applied 406 place count 114 transition count 160
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 430 place count 90 transition count 112
Iterating global reduction 2 with 24 rules applied. Total rules applied 454 place count 90 transition count 112
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 478 place count 66 transition count 88
Iterating global reduction 2 with 24 rules applied. Total rules applied 502 place count 66 transition count 88
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 526 place count 66 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 559 place count 49 transition count 48
Applied a total of 559 rules in 32 ms. Remains 49 /301 variables (removed 252) and now considering 48/472 (removed 424) transitions.
// Phase 1: matrix 48 rows 49 cols
[2024-05-31 22:15:23] [INFO ] Computed 17 invariants in 0 ms
[2024-05-31 22:15:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 22:15:23] [INFO ] Invariant cache hit.
[2024-05-31 22:15:23] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-31 22:15:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 22:15:23] [INFO ] Invariant cache hit.
[2024-05-31 22:15:24] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/301 places, 48/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 49/301 places, 48/472 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s39 1) (LT s40 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s38 1) (LT s33 1) (LT s34 1) (OR (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Stack based approach found an accepted trace after 848 steps with 0 reset with depth 849 and stack size 849 in 2 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-04 finished in 458 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((F(p0)||X(G(p1))))&&F(G(p2)))))'
Support contains 173 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 301 /301 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 301 cols
[2024-05-31 22:15:24] [INFO ] Computed 18 invariants in 5 ms
[2024-05-31 22:15:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-31 22:15:24] [INFO ] Invariant cache hit.
[2024-05-31 22:15:24] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-31 22:15:24] [INFO ] Invariant cache hit.
[2024-05-31 22:15:25] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 871 ms. Remains : 301/301 places, 472/472 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (GEQ s131 1) (GEQ s192 1) (GEQ s135 1) (GEQ s196 1) (GEQ s139 1) (GEQ s200 1) (GEQ s143 1) (GEQ s78 1) (GEQ s147 1) (GEQ s82 1) (GEQ s151 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 903 ms.
Stack based approach found an accepted trace after 66470 steps with 0 reset with depth 66471 and stack size 2265 in 636 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-05 finished in 2696 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((G(p1)||G(!p1)||p0))))'
Support contains 16 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 8 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 22:15:27] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 22:15:27] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 22:15:27] [INFO ] Invariant cache hit.
[2024-05-31 22:15:27] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-31 22:15:27] [INFO ] Invariant cache hit.
[2024-05-31 22:15:27] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 720 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 172 ms :[false, false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1)), p0:(OR (GEQ s144 1) (GEQ s145 1) (GEQ s146 1) (GEQ s147 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-06 finished in 1513 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 85 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 12 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 22:15:28] [INFO ] Invariant cache hit.
[2024-05-31 22:15:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:15:28] [INFO ] Invariant cache hit.
[2024-05-31 22:15:28] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-31 22:15:28] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s12 1) (GEQ s148 1)) (AND (GEQ s2 1) (GEQ s26 1) (GEQ s148 1)) (AND (GEQ s1 1) (GEQ s33 1) (GEQ s148 1)) (AND (GEQ s3 1) (GEQ ...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-07 finished in 703 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(!p1) U (X(G(!p1))||(X(!p1)&&(G(p2)||(p2&&F(p3))))))))'
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 8 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={0, 1} source=2 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(GEQ s69 1), p1:(AND (GEQ s3 1) (GEQ s41 1) (GEQ s148 1)), p2:(LT s75 1), p3:(LT s63 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 21 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-08 finished in 1615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 301 transition count 344
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 288 place count 173 transition count 312
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 288 place count 173 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 352 place count 141 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 354 place count 139 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 139 transition count 216
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 372 place count 123 transition count 200
Iterating global reduction 2 with 16 rules applied. Total rules applied 388 place count 123 transition count 200
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 404 place count 107 transition count 168
Iterating global reduction 2 with 16 rules applied. Total rules applied 420 place count 107 transition count 168
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 435 place count 92 transition count 138
Iterating global reduction 2 with 15 rules applied. Total rules applied 450 place count 92 transition count 138
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 465 place count 92 transition count 123
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 495 place count 77 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 497 place count 76 transition count 107
Applied a total of 497 rules in 36 ms. Remains 76 /301 variables (removed 225) and now considering 107/472 (removed 365) transitions.
// Phase 1: matrix 107 rows 76 cols
[2024-05-31 22:15:30] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 22:15:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 22:15:30] [INFO ] Invariant cache hit.
[2024-05-31 22:15:31] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-31 22:15:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 22:15:31] [INFO ] Invariant cache hit.
[2024-05-31 22:15:31] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/301 places, 107/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 76/301 places, 107/472 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s24 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 265 ms.
Stack based approach found an accepted trace after 5542 steps with 0 reset with depth 5543 and stack size 5543 in 20 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-09 finished in 623 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(p1)&&p0) U p2)))'
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 206 transition count 377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 206 transition count 377
Applied a total of 190 rules in 5 ms. Remains 206 /301 variables (removed 95) and now considering 377/472 (removed 95) transitions.
// Phase 1: matrix 377 rows 206 cols
[2024-05-31 22:15:31] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 22:15:31] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 22:15:31] [INFO ] Invariant cache hit.
[2024-05-31 22:15:31] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-31 22:15:31] [INFO ] Invariant cache hit.
[2024-05-31 22:15:32] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/301 places, 377/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 206/301 places, 377/472 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s13 1) (GEQ s149 1)), p0:(AND (GEQ s2 1) (GEQ s23 1) (GEQ s149 1)), p1:(GEQ s78 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-10 finished in 807 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)))))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 22:15:32] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:15:32] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-31 22:15:32] [INFO ] Invariant cache hit.
[2024-05-31 22:15:32] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-31 22:15:32] [INFO ] Invariant cache hit.
[2024-05-31 22:15:32] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 757 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s38 1) (GEQ s148 1)), p0:(AND (GEQ s2 1) (GEQ s29 1) (GEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-11 finished in 966 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(X(G(p0)))))'
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 206 transition count 377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 206 transition count 377
Applied a total of 190 rules in 5 ms. Remains 206 /301 variables (removed 95) and now considering 377/472 (removed 95) transitions.
// Phase 1: matrix 377 rows 206 cols
[2024-05-31 22:15:33] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:15:33] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 22:15:33] [INFO ] Invariant cache hit.
[2024-05-31 22:15:33] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2024-05-31 22:15:33] [INFO ] Invariant cache hit.
[2024-05-31 22:15:33] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/301 places, 377/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 206/301 places, 377/472 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LT s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 898 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-13 finished in 913 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(p0))&&G((F(p1)||X(p2)))))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 205 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 205 transition count 376
Applied a total of 192 rules in 5 ms. Remains 205 /301 variables (removed 96) and now considering 376/472 (removed 96) transitions.
// Phase 1: matrix 376 rows 205 cols
[2024-05-31 22:15:34] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:15:34] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 22:15:34] [INFO ] Invariant cache hit.
[2024-05-31 22:15:34] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-31 22:15:34] [INFO ] Invariant cache hit.
[2024-05-31 22:15:34] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/301 places, 376/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 205/301 places, 376/472 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s4 1), p2:(GEQ s8 1), p0:(OR (LT s56 1) (LT s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3838 reset in 250 ms.
Product exploration explored 100000 steps with 3804 reset in 286 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 292 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 2 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-31 22:15:36] [INFO ] Invariant cache hit.
[2024-05-31 22:15:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 22:15:36] [INFO ] Invariant cache hit.
[2024-05-31 22:15:37] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-31 22:15:37] [INFO ] Invariant cache hit.
[2024-05-31 22:15:37] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 205/205 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 352 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 2015 reset in 257 ms.
Product exploration explored 100000 steps with 1981 reset in 266 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 376/376 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 205 transition count 408
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 205 transition count 408
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 0 with 78 rules applied. Total rules applied 110 place count 205 transition count 432
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 142 place count 205 transition count 400
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 145 place count 202 transition count 304
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 202 transition count 304
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 220 place count 130 transition count 184
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 292 place count 130 transition count 184
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 340 place count 82 transition count 136
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 388 place count 82 transition count 136
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 436 place count 82 transition count 88
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 436 rules in 35 ms. Remains 82 /205 variables (removed 123) and now considering 88/376 (removed 288) transitions.
[2024-05-31 22:15:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2024-05-31 22:15:39] [INFO ] Computed 18 invariants in 0 ms
[2024-05-31 22:15:39] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/205 places, 88/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 82/205 places, 88/376 transitions.
Built C files in :
/tmp/ltsmin13752649136873933165
[2024-05-31 22:15:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13752649136873933165
Running compilation step : cd /tmp/ltsmin13752649136873933165;'/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 920 ms.
Running link step : cd /tmp/ltsmin13752649136873933165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13752649136873933165;'/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/stateBased11766238000528018831.hoa' '--buchi-type=spotba'
LTSmin run took 4182 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-14 finished in 10765 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(((p1&&X(p2))||p0)))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 472/472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 207 transition count 378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 207 transition count 378
Applied a total of 188 rules in 7 ms. Remains 207 /301 variables (removed 94) and now considering 378/472 (removed 94) transitions.
// Phase 1: matrix 378 rows 207 cols
[2024-05-31 22:15:44] [INFO ] Computed 18 invariants in 3 ms
[2024-05-31 22:15:45] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-31 22:15:45] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-31 22:15:45] [INFO ] Invariant cache hit.
[2024-05-31 22:15:45] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/301 places, 378/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 767 ms. Remains : 207/301 places, 378/472 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s108 1) (GEQ s160 1)), p1:(GEQ s109 1), p2:(LT s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 939 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T4N08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N08-LTLFireability-15 finished in 888 ms.
All properties solved by simple procedures.
Total runtime 73992 ms.
BK_STOP 1717193746877
--------------------
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="UtilityControlRoom-PT-Z4T4N08"
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 UtilityControlRoom-PT-Z4T4N08, 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 r461-smll-171701123000168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T4N08.tgz
mv UtilityControlRoom-PT-Z4T4N08 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 '
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 ;