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.r373-tall-171683788600148.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 ShieldIIPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788600148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 20:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 67K 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 ShieldIIPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716950050336

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=ShieldIIPt-PT-004B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 02:34:12] [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-29 02:34:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:34:12] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-29 02:34:12] [INFO ] Transformed 283 places.
[2024-05-29 02:34:12] [INFO ] Transformed 263 transitions.
[2024-05-29 02:34:12] [INFO ] Found NUPN structural information;
[2024-05-29 02:34:12] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPt-PT-004B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 263/263 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 245 transition count 225
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 245 transition count 225
Applied a total of 76 rules in 61 ms. Remains 245 /283 variables (removed 38) and now considering 225/263 (removed 38) transitions.
// Phase 1: matrix 225 rows 245 cols
[2024-05-29 02:34:12] [INFO ] Computed 37 invariants in 15 ms
[2024-05-29 02:34:13] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-29 02:34:13] [INFO ] Invariant cache hit.
[2024-05-29 02:34:13] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-29 02:34:13] [INFO ] Invariant cache hit.
[2024-05-29 02:34:13] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/283 places, 225/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 245/283 places, 225/263 transitions.
Support contains 35 out of 245 places after structural reductions.
[2024-05-29 02:34:13] [INFO ] Flatten gal took : 46 ms
[2024-05-29 02:34:13] [INFO ] Flatten gal took : 18 ms
[2024-05-29 02:34:13] [INFO ] Input system was already deterministic with 225 transitions.
Support contains 31 out of 245 places (down from 35) after GAL structural reductions.
Finished random walk after 1291 steps, including 0 resets, run visited all 28 properties in 242 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 65 stabilizing places and 65 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' '!(G((G(p0) U X((p1||X(!p1))))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 238 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 237 transition count 217
Applied a total of 16 rules in 24 ms. Remains 237 /245 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-05-29 02:34:14] [INFO ] Computed 37 invariants in 4 ms
[2024-05-29 02:34:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 02:34:14] [INFO ] Invariant cache hit.
[2024-05-29 02:34:14] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-29 02:34:14] [INFO ] Invariant cache hit.
[2024-05-29 02:34:14] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/245 places, 217/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 237/245 places, 217/225 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 375 ms :[false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s135 1), p1:(EQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25001 reset in 254 ms.
Product exploration explored 100000 steps with 24976 reset in 197 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[false, false, false, p1, true, (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :5
Finished Best-First random walk after 9992 steps, including 2 resets, run visited all 1 properties in 27 ms. (steps per millisecond=370 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLFireability-01 finished in 1997 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 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 240 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 240 transition count 220
Applied a total of 10 rules in 20 ms. Remains 240 /245 variables (removed 5) and now considering 220/225 (removed 5) transitions.
// Phase 1: matrix 220 rows 240 cols
[2024-05-29 02:34:16] [INFO ] Computed 37 invariants in 3 ms
[2024-05-29 02:34:16] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 02:34:16] [INFO ] Invariant cache hit.
[2024-05-29 02:34:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-29 02:34:16] [INFO ] Invariant cache hit.
[2024-05-29 02:34:16] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 240/245 places, 220/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 240/245 places, 220/225 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s214 1), p0:(EQ s212 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-03 finished in 514 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((X(p1)&&G(p2)))&&p0))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 238 transition count 218
Applied a total of 14 rules in 35 ms. Remains 238 /245 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-29 02:34:16] [INFO ] Computed 37 invariants in 3 ms
[2024-05-29 02:34:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 02:34:17] [INFO ] Invariant cache hit.
[2024-05-29 02:34:17] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-29 02:34:17] [INFO ] Invariant cache hit.
[2024-05-29 02:34:17] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/245 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 238/245 places, 218/225 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s24 1)), p2:(EQ s108 1), p1:(EQ s195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 208 ms.
Stack based approach found an accepted trace after 2158 steps with 0 reset with depth 2159 and stack size 2159 in 6 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-04 finished in 1107 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((p0&&X((X(F(p1))||G(p0)))))||(p0&&X(((X(F(p1))||G(p0))&&F(p2))))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 238 transition count 218
Applied a total of 14 rules in 13 ms. Remains 238 /245 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-29 02:34:18] [INFO ] Computed 37 invariants in 1 ms
[2024-05-29 02:34:18] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-29 02:34:18] [INFO ] Invariant cache hit.
[2024-05-29 02:34:18] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-29 02:34:18] [INFO ] Invariant cache hit.
[2024-05-29 02:34:18] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/245 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 238/245 places, 218/225 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s117 1), p2:(EQ s36 1), p1:(NEQ s236 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 382 reset in 201 ms.
Stack based approach found an accepted trace after 1723 steps with 10 reset with depth 247 and stack size 247 in 12 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-05 finished in 994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 238 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 237 transition count 217
Applied a total of 16 rules in 11 ms. Remains 237 /245 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-05-29 02:34:19] [INFO ] Computed 37 invariants in 3 ms
[2024-05-29 02:34:19] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 02:34:19] [INFO ] Invariant cache hit.
[2024-05-29 02:34:19] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-29 02:34:19] [INFO ] Invariant cache hit.
[2024-05-29 02:34:19] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/245 places, 217/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 237/245 places, 217/225 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-06 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&G(p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(p1))))&&(G((p2||F(p3)))||(F(p2)&&(p2||F(p3))))))))'
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 244 transition count 173
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 104 place count 193 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 192 transition count 171
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 105 place count 192 transition count 142
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 163 place count 163 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 160 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 160 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 169 place count 160 transition count 138
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 171 place count 159 transition count 138
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 299 place count 95 transition count 74
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 319 place count 85 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 83 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 322 place count 82 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 322 place count 82 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 81 transition count 77
Applied a total of 324 rules in 41 ms. Remains 81 /245 variables (removed 164) and now considering 77/225 (removed 148) transitions.
// Phase 1: matrix 77 rows 81 cols
[2024-05-29 02:34:19] [INFO ] Computed 36 invariants in 1 ms
[2024-05-29 02:34:19] [INFO ] Implicit Places using invariants in 51 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/245 places, 77/225 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 76
Applied a total of 2 rules in 4 ms. Remains 79 /80 variables (removed 1) and now considering 76/77 (removed 1) transitions.
// Phase 1: matrix 76 rows 79 cols
[2024-05-29 02:34:19] [INFO ] Computed 35 invariants in 4 ms
[2024-05-29 02:34:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 02:34:19] [INFO ] Invariant cache hit.
[2024-05-29 02:34:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 02:34:19] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/245 places, 76/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 274 ms. Remains : 79/245 places, 76/225 transitions.
Stuttering acceptance computed with spot in 485 ms :[p0, true, (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(NOT p2), acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 1}, { cond=p1, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(OR (EQ s31 1) (EQ s14 1)), p2:(NEQ s31 1), p3:(NEQ s59 1), p1:(NEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 327 ms.
Product exploration explored 100000 steps with 1 reset in 420 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/79 stabilizing places and 4/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p3 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p3) p1)), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 27 factoid took 1652 ms. Reduced automaton from 13 states, 35 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:34:22] [INFO ] Invariant cache hit.
[2024-05-29 02:34:23] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2024-05-29 02:34:23] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:34:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-29 02:34:23] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 02:34:23] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:23] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 02:34:23] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 76/76 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 78 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 78 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 77 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 76 transition count 72
Applied a total of 6 rules in 9 ms. Remains 76 /79 variables (removed 3) and now considering 72/76 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 76/79 places, 72/76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1356273 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{}
Probabilistic random walk after 1356273 steps, saw 830213 distinct states, run finished after 3002 ms. (steps per millisecond=451 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 76 cols
[2024-05-29 02:34:26] [INFO ] Computed 35 invariants in 3 ms
[2024-05-29 02:34:26] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-29 02:34:26] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:34:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-29 02:34:26] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:34:26] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:26] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-29 02:34:26] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-29 02:34:26] [INFO ] Invariant cache hit.
[2024-05-29 02:34:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 02:34:26] [INFO ] Invariant cache hit.
[2024-05-29 02:34:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:34:26] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 02:34:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 02:34:26] [INFO ] Invariant cache hit.
[2024-05-29 02:34:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 76/76 places, 72/72 transitions.
Graph (complete) has 179 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 75 transition count 72
Applied a total of 11 rules in 5 ms. Remains 75 /76 variables (removed 1) and now considering 72/72 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 75 cols
[2024-05-29 02:34:26] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 02:34:26] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:34:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:26] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:34:26] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:26] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-29 02:34:26] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p2 p3 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p3) p1)), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X p3)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 27 factoid took 1939 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Support contains 3 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 79 cols
[2024-05-29 02:34:28] [INFO ] Computed 35 invariants in 2 ms
[2024-05-29 02:34:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 02:34:29] [INFO ] Invariant cache hit.
[2024-05-29 02:34:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 02:34:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-29 02:34:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 02:34:29] [INFO ] Invariant cache hit.
[2024-05-29 02:34:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 79/79 places, 76/76 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/79 stabilizing places and 4/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 604 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:34:30] [INFO ] Invariant cache hit.
[2024-05-29 02:34:30] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:30] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:34:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:30] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 02:34:30] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:30] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-29 02:34:30] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 76/76 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 78 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 78 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 77 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 76 transition count 72
Applied a total of 6 rules in 14 ms. Remains 76 /79 variables (removed 3) and now considering 72/76 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 76/79 places, 72/76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1417522 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :{}
Probabilistic random walk after 1417522 steps, saw 867209 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 76 cols
[2024-05-29 02:34:33] [INFO ] Computed 35 invariants in 1 ms
[2024-05-29 02:34:33] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-29 02:34:33] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:34:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:33] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:34:33] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:33] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-29 02:34:33] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-29 02:34:33] [INFO ] Invariant cache hit.
[2024-05-29 02:34:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 02:34:33] [INFO ] Invariant cache hit.
[2024-05-29 02:34:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:34:33] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-29 02:34:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 02:34:33] [INFO ] Invariant cache hit.
[2024-05-29 02:34:33] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 76/76 places, 72/72 transitions.
Graph (complete) has 179 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 75 transition count 72
Applied a total of 11 rules in 4 ms. Remains 75 /76 variables (removed 1) and now considering 72/72 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 75 cols
[2024-05-29 02:34:33] [INFO ] Computed 34 invariants in 21 ms
[2024-05-29 02:34:33] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:33] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:34:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:34:33] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:34:33] [INFO ] After 8ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:34:33] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-29 02:34:33] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND p1 (NOT p0)))), (F (AND p1 p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 9 factoid took 761 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 1 reset in 233 ms.
Product exploration explored 100000 steps with 3 reset in 253 ms.
Built C files in :
/tmp/ltsmin273802892306808085
[2024-05-29 02:34:35] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2024-05-29 02:34:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:34:35] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2024-05-29 02:34:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:34:35] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2024-05-29 02:34:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:34:35] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin273802892306808085
Running compilation step : cd /tmp/ltsmin273802892306808085;'/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 322 ms.
Running link step : cd /tmp/ltsmin273802892306808085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin273802892306808085;'/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/stateBased1683374037391379341.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 74
Applied a total of 1 rules in 13 ms. Remains 77 /79 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 77 cols
[2024-05-29 02:34:50] [INFO ] Computed 35 invariants in 1 ms
[2024-05-29 02:34:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 02:34:50] [INFO ] Invariant cache hit.
[2024-05-29 02:34:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 02:34:50] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-29 02:34:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 02:34:50] [INFO ] Invariant cache hit.
[2024-05-29 02:34:50] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/79 places, 74/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 77/79 places, 74/76 transitions.
Built C files in :
/tmp/ltsmin14849896766715740078
[2024-05-29 02:34:50] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2024-05-29 02:34:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:34:50] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2024-05-29 02:34:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:34:50] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2024-05-29 02:34:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:34:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14849896766715740078
Running compilation step : cd /tmp/ltsmin14849896766715740078;'/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 173 ms.
Running link step : cd /tmp/ltsmin14849896766715740078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14849896766715740078;'/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/stateBased10368976189036579672.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 02:35:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 02:35:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 02:35:06] [INFO ] Time to serialize gal into /tmp/LTL16509944430744508882.gal : 1 ms
[2024-05-29 02:35:06] [INFO ] Time to serialize properties into /tmp/LTL625508749262091841.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16509944430744508882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4966528600415858262.hoa' '-atoms' '/tmp/LTL625508749262091841.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL625508749262091841.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4966528600415858262.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t184, t1.t138, t2.t91, t41, t135, t176, t167.t220.t185.t163.t166, t122.t213.t139.t118.t121...471
Computing Next relation with stutter on 7622 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
700 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.03064,232828,1,0,350,867924,190,257,2665,1.97788e+06,683
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-004B-LTLFireability-07 finished in 55561 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((p0||X(F(p1)))) U X(p2)))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 238 transition count 218
Applied a total of 14 rules in 7 ms. Remains 238 /245 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-29 02:35:15] [INFO ] Computed 37 invariants in 3 ms
[2024-05-29 02:35:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 02:35:15] [INFO ] Invariant cache hit.
[2024-05-29 02:35:15] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-29 02:35:15] [INFO ] Invariant cache hit.
[2024-05-29 02:35:15] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/245 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 238/245 places, 218/225 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s128 1), p2:(EQ s31 1), p1:(NEQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Product exploration explored 100000 steps with 3 reset in 197 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/238 stabilizing places and 62/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X p0)), (X (X p1)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 203 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-29 02:35:16] [INFO ] Invariant cache hit.
[2024-05-29 02:35:16] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-29 02:35:17] [INFO ] After 60ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 515 ms
[2024-05-29 02:35:17] [INFO ] After 585ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:17] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2024-05-29 02:35:17] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 02:35:17] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 02:35:18] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 02:35:18] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 02:35:18] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-29 02:35:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 02:35:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 496 ms
[2024-05-29 02:35:18] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-29 02:35:18] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 218/218 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 238 transition count 172
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 192 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 191 transition count 171
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 94 place count 191 transition count 139
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 158 place count 159 transition count 139
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 288 place count 94 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 94 transition count 73
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 4 with 2 rules applied. Total rules applied 291 place count 93 transition count 72
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 313 place count 82 transition count 79
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 82 transition count 78
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 318 place count 82 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 81 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 321 place count 79 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 321 place count 79 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 323 place count 78 transition count 76
Applied a total of 323 rules in 25 ms. Remains 78 /238 variables (removed 160) and now considering 76/218 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 78/238 places, 76/218 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1451199 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :{}
Probabilistic random walk after 1451199 steps, saw 818098 distinct states, run finished after 3003 ms. (steps per millisecond=483 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 78 cols
[2024-05-29 02:35:21] [INFO ] Computed 35 invariants in 0 ms
[2024-05-29 02:35:21] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-29 02:35:21] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:21] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 02:35:21] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:21] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 02:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-29 02:35:21] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-29 02:35:21] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 78/78 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 78 /78 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-29 02:35:21] [INFO ] Invariant cache hit.
[2024-05-29 02:35:21] [INFO ] Implicit Places using invariants in 53 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 77/78 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 75
Applied a total of 2 rules in 4 ms. Remains 76 /77 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 76 cols
[2024-05-29 02:35:21] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 02:35:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 02:35:21] [INFO ] Invariant cache hit.
[2024-05-29 02:35:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:21] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 76/78 places, 75/76 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 211 ms. Remains : 76/78 places, 75/76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1323779 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :{}
Probabilistic random walk after 1323779 steps, saw 757145 distinct states, run finished after 3004 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 02:35:24] [INFO ] Invariant cache hit.
[2024-05-29 02:35:24] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:35:24] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:24] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:24] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:24] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 02:35:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-29 02:35:24] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 02:35:24] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-29 02:35:24] [INFO ] Invariant cache hit.
[2024-05-29 02:35:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 02:35:25] [INFO ] Invariant cache hit.
[2024-05-29 02:35:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:25] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 02:35:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 02:35:25] [INFO ] Invariant cache hit.
[2024-05-29 02:35:25] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 76/76 places, 75/75 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 76 transition count 75
Applied a total of 14 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 76 cols
[2024-05-29 02:35:25] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 02:35:25] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:35:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-29 02:35:25] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 02:35:25] [INFO ] After 6ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:25] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-29 02:35:25] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X p0)), (X (X p1)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 p0 p1)), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT p0)), (F (AND p2 (NOT p0) p1)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 533 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
// Phase 1: matrix 218 rows 238 cols
[2024-05-29 02:35:26] [INFO ] Computed 37 invariants in 3 ms
[2024-05-29 02:35:26] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-29 02:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:35:26] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-29 02:35:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 02:35:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-29 02:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 02:35:27] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-29 02:35:27] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 02:35:27] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 02:35:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 02:35:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 02:35:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 215 ms
[2024-05-29 02:35:27] [INFO ] Computed and/alt/rep : 217/327/217 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 02:35:28] [INFO ] Added : 208 causal constraints over 42 iterations in 782 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 218/218 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 237 transition count 171
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 191 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 190 transition count 170
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 94 place count 190 transition count 138
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 158 place count 158 transition count 138
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 284 place count 95 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 95 transition count 74
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 4 with 2 rules applied. Total rules applied 287 place count 94 transition count 73
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 309 place count 83 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 81 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 313 place count 79 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 313 place count 79 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 315 place count 78 transition count 77
Applied a total of 315 rules in 27 ms. Remains 78 /238 variables (removed 160) and now considering 77/218 (removed 141) transitions.
// Phase 1: matrix 77 rows 78 cols
[2024-05-29 02:35:28] [INFO ] Computed 35 invariants in 1 ms
[2024-05-29 02:35:28] [INFO ] Implicit Places using invariants in 60 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/238 places, 77/218 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 76
Applied a total of 2 rules in 2 ms. Remains 76 /77 variables (removed 1) and now considering 76/77 (removed 1) transitions.
// Phase 1: matrix 76 rows 76 cols
[2024-05-29 02:35:28] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 02:35:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 02:35:28] [INFO ] Invariant cache hit.
[2024-05-29 02:35:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:28] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/238 places, 76/218 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226 ms. Remains : 76/238 places, 76/218 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/76 stabilizing places and 4/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1))))]
Knowledge based reduction with 11 factoid took 1382 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-29 02:35:30] [INFO ] Invariant cache hit.
[2024-05-29 02:35:30] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:30] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:30] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:30] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:30] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-29 02:35:30] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 76/76 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 75
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 76 transition count 75
Applied a total of 3 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 75/76 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 75/76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1422807 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{}
Probabilistic random walk after 1422807 steps, saw 821133 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 76 cols
[2024-05-29 02:35:33] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 02:35:33] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:33] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 02:35:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:33] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:33] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:33] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:33] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:33] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 02:35:33] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-29 02:35:33] [INFO ] Invariant cache hit.
[2024-05-29 02:35:33] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 02:35:33] [INFO ] Invariant cache hit.
[2024-05-29 02:35:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:33] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-29 02:35:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 02:35:33] [INFO ] Invariant cache hit.
[2024-05-29 02:35:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 76/76 places, 75/75 transitions.
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 76 transition count 75
Applied a total of 14 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 76 cols
[2024-05-29 02:35:33] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 02:35:33] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-29 02:35:33] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 02:35:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:33] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 02:35:33] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 02:35:33] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-29 02:35:33] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F p2), (F (NOT p0)), (F (AND (NOT p0) p1 p2)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 1959 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
// Phase 1: matrix 76 rows 76 cols
[2024-05-29 02:35:36] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 02:35:36] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 02:35:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-29 02:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 02:35:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 02:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 02:35:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-29 02:35:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 02:35:36] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-29 02:35:36] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 02:35:36] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 02:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2024-05-29 02:35:36] [INFO ] Computed and/alt/rep : 70/162/70 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 02:35:36] [INFO ] Added : 50 causal constraints over 10 iterations in 87 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-08 finished in 22113 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||X(F(p1))))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 244 transition count 174
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 194 transition count 172
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 193 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 191 transition count 170
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 107 place count 191 transition count 141
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 165 place count 162 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 168 place count 159 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 171 place count 159 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 171 place count 159 transition count 137
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 158 transition count 137
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 309 place count 90 transition count 69
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 329 place count 80 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 78 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 333 place count 76 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 333 place count 76 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 335 place count 75 transition count 72
Applied a total of 335 rules in 21 ms. Remains 75 /245 variables (removed 170) and now considering 72/225 (removed 153) transitions.
// Phase 1: matrix 72 rows 75 cols
[2024-05-29 02:35:37] [INFO ] Computed 35 invariants in 0 ms
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants in 57 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/245 places, 72/225 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 71
Applied a total of 2 rules in 3 ms. Remains 73 /74 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 73 cols
[2024-05-29 02:35:37] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 02:35:37] [INFO ] Invariant cache hit.
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/245 places, 71/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 73/245 places, 71/225 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s54 1), p1:(OR (EQ s44 0) (EQ s46 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-09 finished in 317 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 1 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 244 transition count 171
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 191 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 190 transition count 169
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 109 place count 190 transition count 140
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 167 place count 161 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 158 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 158 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 173 place count 158 transition count 136
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 157 transition count 136
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 309 place count 90 transition count 69
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 331 place count 79 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 77 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 335 place count 75 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 335 place count 75 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 337 place count 74 transition count 73
Applied a total of 337 rules in 22 ms. Remains 74 /245 variables (removed 171) and now considering 73/225 (removed 152) transitions.
// Phase 1: matrix 73 rows 74 cols
[2024-05-29 02:35:37] [INFO ] Computed 35 invariants in 1 ms
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants in 59 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/245 places, 73/225 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 72
Applied a total of 2 rules in 3 ms. Remains 72 /73 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 72 cols
[2024-05-29 02:35:37] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 02:35:37] [INFO ] Invariant cache hit.
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/245 places, 72/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 72/245 places, 72/225 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-12 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&G(p1)))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 238 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 237 transition count 217
Applied a total of 16 rules in 10 ms. Remains 237 /245 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-05-29 02:35:37] [INFO ] Computed 37 invariants in 2 ms
[2024-05-29 02:35:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 02:35:37] [INFO ] Invariant cache hit.
[2024-05-29 02:35:38] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-29 02:35:38] [INFO ] Invariant cache hit.
[2024-05-29 02:35:38] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/245 places, 217/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 237/245 places, 217/225 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s186 0), p0:(OR (EQ s92 0) (EQ s141 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-13 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 244 transition count 171
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 191 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 190 transition count 169
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 109 place count 190 transition count 142
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 163 place count 163 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 160 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 160 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 169 place count 160 transition count 138
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 171 place count 159 transition count 138
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 303 place count 93 transition count 72
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 325 place count 82 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 80 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 79 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 328 place count 79 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 330 place count 78 transition count 76
Applied a total of 330 rules in 16 ms. Remains 78 /245 variables (removed 167) and now considering 76/225 (removed 149) transitions.
// Phase 1: matrix 76 rows 78 cols
[2024-05-29 02:35:38] [INFO ] Computed 36 invariants in 1 ms
[2024-05-29 02:35:38] [INFO ] Implicit Places using invariants in 60 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/245 places, 76/225 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 75
Applied a total of 2 rules in 2 ms. Remains 76 /77 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 76 cols
[2024-05-29 02:35:38] [INFO ] Computed 35 invariants in 0 ms
[2024-05-29 02:35:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 02:35:38] [INFO ] Invariant cache hit.
[2024-05-29 02:35:38] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/245 places, 75/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 76/245 places, 75/225 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s66 0), p1:(EQ s71 1)], nbAcceptance=2, 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 212 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-14 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1)&&X(p2))))'
Support contains 3 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 239 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 238 transition count 218
Applied a total of 14 rules in 12 ms. Remains 238 /245 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-29 02:35:38] [INFO ] Computed 37 invariants in 1 ms
[2024-05-29 02:35:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 02:35:38] [INFO ] Invariant cache hit.
[2024-05-29 02:35:39] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-05-29 02:35:39] [INFO ] Invariant cache hit.
[2024-05-29 02:35:39] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/245 places, 218/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 238/245 places, 218/225 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s50 0), p1:(EQ s1 1), p2:(EQ s10 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Product exploration explored 100000 steps with 33333 reset in 179 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/238 stabilizing places and 62/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X p1), (X (X p0)), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 13 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLFireability-15 finished in 1021 ms.
All properties solved by simple procedures.
Total runtime 87554 ms.

BK_STOP 1716950140922

--------------------
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="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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 r373-tall-171683788600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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