Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536500516.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PermAdmissibility-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536500516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 227K Feb 26 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 56K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 275K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 336K Mar 5 18:23 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 PermAdmissibility-PT-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678965061778

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 11:11:04] [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]
[2023-03-16 11:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 11:11:04] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-16 11:11:04] [INFO ] Transformed 168 places.
[2023-03-16 11:11:04] [INFO ] Transformed 592 transitions.
[2023-03-16 11:11:04] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-PT-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 75 place count 93 transition count 476
Iterating global reduction 1 with 11 rules applied. Total rules applied 86 place count 93 transition count 476
Applied a total of 86 rules in 45 ms. Remains 93 /168 variables (removed 75) and now considering 476/592 (removed 116) transitions.
// Phase 1: matrix 476 rows 93 cols
[2023-03-16 11:11:05] [INFO ] Computed 16 place invariants in 51 ms
[2023-03-16 11:11:05] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-16 11:11:05] [INFO ] Invariant cache hit.
[2023-03-16 11:11:06] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2023-03-16 11:11:06] [INFO ] Invariant cache hit.
[2023-03-16 11:11:06] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/168 places, 476/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1273 ms. Remains : 93/168 places, 476/592 transitions.
Support contains 70 out of 93 places after structural reductions.
[2023-03-16 11:11:06] [INFO ] Flatten gal took : 108 ms
[2023-03-16 11:11:07] [INFO ] Flatten gal took : 77 ms
[2023-03-16 11:11:07] [INFO ] Input system was already deterministic with 476 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 24) seen :21
Finished Best-First random walk after 7508 steps, including 37 resets, run visited all 3 properties in 62 ms. (steps per millisecond=121 )
Computed a total of 93 stabilizing places and 476 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 476
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(((G(p1)||X(X(p2)))&&p0))))))'
Support contains 18 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 468
Applied a total of 4 rules in 17 ms. Remains 91 /93 variables (removed 2) and now considering 468/476 (removed 8) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-16 11:11:08] [INFO ] Computed 16 place invariants in 12 ms
[2023-03-16 11:11:08] [INFO ] Implicit Places using invariants in 150 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/93 places, 468/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 90/93 places, 468/476 transitions.
Stuttering acceptance computed with spot in 667 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s12 1) (LT s17 1)) (OR (LT s1 1) (LT s8 1) (LT s17 1)) (OR (LT s6 1) (LT s13 1) (LT s17 1)) (OR (LT s7 1) (LT s11 1) (LT s17 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9623 steps with 377 reset in 345 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-00 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Graph (complete) has 766 edges and 93 vertex of which 6 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.4 ms
Discarding 87 places :
Also discarding 468 output transitions
Drop transitions removed 468 transitions
Applied a total of 1 rules in 10 ms. Remains 6 /93 variables (removed 87) and now considering 8/476 (removed 468) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-03-16 11:11:09] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 11:11:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 11:11:09] [INFO ] Invariant cache hit.
[2023-03-16 11:11:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-16 11:11:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 11:11:09] [INFO ] Invariant cache hit.
[2023-03-16 11:11:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/93 places, 8/476 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 6/93 places, 8/476 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s3 1) (LT s5 1)) (OR (LT s1 1) (LT s3 1) (LT s4 1)) (OR (LT s0 1) (LT s3 1) (LT s4 1)) (OR (LT s0 1) (LT s3 1) (LT s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22173 reset in 228 ms.
Product exploration explored 100000 steps with 22165 reset in 281 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-01 finished in 988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1))))||G(p0)))'
Support contains 34 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 468
Applied a total of 4 rules in 41 ms. Remains 91 /93 variables (removed 2) and now considering 468/476 (removed 8) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-16 11:11:10] [INFO ] Computed 16 place invariants in 28 ms
[2023-03-16 11:11:10] [INFO ] Implicit Places using invariants in 151 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/93 places, 468/476 transitions.
Applied a total of 0 rules in 27 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 90/93 places, 468/476 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s38 1) (GEQ s41 1) (GEQ s63 1)) (AND (GEQ s38 1) (GEQ s56 1) (GEQ s66 1)) (AND (GEQ s38 1) (GEQ s42 1) (GEQ s77 1)) (AND (GEQ s38 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 55 steps with 2 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-04 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(p1))&&p0))))'
Support contains 14 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 78 transition count 344
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 54 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 78 place count 54 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 53 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 53 transition count 100
Applied a total of 80 rules in 13 ms. Remains 53 /93 variables (removed 40) and now considering 100/476 (removed 376) transitions.
// Phase 1: matrix 100 rows 53 cols
[2023-03-16 11:11:11] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-16 11:11:11] [INFO ] Implicit Places using invariants in 69 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/93 places, 100/476 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 49/93 places, 100/476 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-05 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=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ 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 p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s22 1) (LT s25 1) (LT s28 1)) (OR (LT s22 1) (LT s25 1) (LT s29 1)) (OR (LT s20 1) (LT s22 1) (LT s27 1)) (OR (LT s20 1) (LT s22 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24800 reset in 488 ms.
Product exploration explored 100000 steps with 24876 reset in 424 ms.
Computed a total of 49 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-05 finished in 1594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||(!p1&&X((F(!p2)||G(!p1)))))))))'
Support contains 15 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 78 transition count 344
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 54 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 78 place count 54 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 53 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 53 transition count 100
Applied a total of 80 rules in 8 ms. Remains 53 /93 variables (removed 40) and now considering 100/476 (removed 376) transitions.
[2023-03-16 11:11:12] [INFO ] Invariant cache hit.
[2023-03-16 11:11:12] [INFO ] Implicit Places using invariants in 74 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 75 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/93 places, 100/476 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 49/93 places, 100/476 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s35 1) (GEQ s43 1)) (AND (GEQ s32 1) (GEQ s34 1) (GEQ s43 1)) (AND (GEQ s33 1) (GEQ s35 1) (GEQ s43 1)) (AND (GEQ s33 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28541 reset in 249 ms.
Product exploration explored 100000 steps with 28601 reset in 261 ms.
Computed a total of 49 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 431 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 433 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 100 rows 49 cols
[2023-03-16 11:11:14] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-16 11:11:14] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-16 11:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:11:14] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-16 11:11:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:11:14] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-16 11:11:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:11:14] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-16 11:11:14] [INFO ] Computed and/alt/rep : 35/222/35 causal constraints (skipped 61 transitions) in 19 ms.
[2023-03-16 11:11:14] [INFO ] Added : 10 causal constraints over 3 iterations in 101 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 49 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 : 49/49 places, 100/100 transitions.
Graph (complete) has 214 edges and 49 vertex of which 22 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 52 output transitions
Drop transitions removed 52 transitions
Applied a total of 1 rules in 10 ms. Remains 22 /49 variables (removed 27) and now considering 48/100 (removed 52) transitions.
// Phase 1: matrix 48 rows 22 cols
[2023-03-16 11:11:14] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 11:11:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-16 11:11:14] [INFO ] Invariant cache hit.
[2023-03-16 11:11:15] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-16 11:11:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 11:11:15] [INFO ] Invariant cache hit.
[2023-03-16 11:11:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/49 places, 48/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 22/49 places, 48/100 transitions.
Computed a total of 22 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-16 11:11:15] [INFO ] Invariant cache hit.
[2023-03-16 11:11:15] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 11:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 11:11:15] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-16 11:11:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 11:11:16] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 11:11:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 11:11:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-16 11:11:16] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 16 transitions) in 11 ms.
[2023-03-16 11:11:16] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 28581 reset in 324 ms.
Product exploration explored 100000 steps with 28529 reset in 369 ms.
Built C files in :
/tmp/ltsmin12590190372880997898
[2023-03-16 11:11:16] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2023-03-16 11:11:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:11:16] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2023-03-16 11:11:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:11:16] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2023-03-16 11:11:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 11:11:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12590190372880997898
Running compilation step : cd /tmp/ltsmin12590190372880997898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 406 ms.
Running link step : cd /tmp/ltsmin12590190372880997898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin12590190372880997898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11404369105418943344.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-02-LTLFireability-06 finished in 4954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||F(p2))))'
Support contains 35 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 468
Applied a total of 4 rules in 9 ms. Remains 91 /93 variables (removed 2) and now considering 468/476 (removed 8) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-16 11:11:17] [INFO ] Computed 16 place invariants in 9 ms
[2023-03-16 11:11:17] [INFO ] Implicit Places using invariants in 177 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/93 places, 468/476 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 90/93 places, 468/476 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s13 1) (GEQ s15 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s15 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s15 1)) (AND (GEQ s7 1) (GEQ s8 ...], 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]]
Entered a terminal (fully accepting) state of product in 11 steps with 1 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-07 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(G(p1))))&&p0)))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 79 transition count 348
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 79 transition count 348
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 50 place count 57 transition count 118
Iterating global reduction 0 with 22 rules applied. Total rules applied 72 place count 57 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 56 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 56 transition count 110
Applied a total of 74 rules in 14 ms. Remains 56 /93 variables (removed 37) and now considering 110/476 (removed 366) transitions.
// Phase 1: matrix 110 rows 56 cols
[2023-03-16 11:11:18] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-16 11:11:18] [INFO ] Implicit Places using invariants in 130 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/93 places, 110/476 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 55/93 places, 110/476 transitions.
Stuttering acceptance computed with spot in 577 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s25 1) (GEQ s31 1) (GEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-08 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 79 transition count 348
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 79 transition count 348
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 48 place count 59 transition count 128
Iterating global reduction 0 with 20 rules applied. Total rules applied 68 place count 59 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 56 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 56 transition count 104
Applied a total of 74 rules in 45 ms. Remains 56 /93 variables (removed 37) and now considering 104/476 (removed 372) transitions.
// Phase 1: matrix 104 rows 56 cols
[2023-03-16 11:11:18] [INFO ] Computed 16 place invariants in 4 ms
[2023-03-16 11:11:19] [INFO ] Implicit Places using invariants in 143 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/93 places, 104/476 transitions.
Applied a total of 0 rules in 6 ms. Remains 55 /55 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 55/93 places, 104/476 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-09 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:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s20 1) (GEQ s30 1) (GEQ s45 1))], nbAcceptance=2, 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 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-09 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((p1&&F(p2)))))'
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 82 transition count 360
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 82 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 38 place count 66 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 54 place count 66 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 65 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 65 transition count 164
Applied a total of 56 rules in 12 ms. Remains 65 /93 variables (removed 28) and now considering 164/476 (removed 312) transitions.
// Phase 1: matrix 164 rows 65 cols
[2023-03-16 11:11:19] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-16 11:11:19] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-16 11:11:19] [INFO ] Invariant cache hit.
[2023-03-16 11:11:19] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2023-03-16 11:11:19] [INFO ] Invariant cache hit.
[2023-03-16 11:11:19] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/93 places, 164/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 864 ms. Remains : 65/93 places, 164/476 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s10 1) (LT s13 1)), p2:(OR (LT s16 1) (LT s20 1) (LT s22 1) (LT s1 1) (LT s3 1) (LT s4 1)), p0:(AND (GEQ s16 1) (GEQ s20 1) (GEQ s22 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 118 steps with 3 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-10 finished in 1059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((p1&&(X(p3)||p2))))||p0)))'
Support contains 8 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 80 transition count 352
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 80 transition count 352
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 43 place count 63 transition count 152
Iterating global reduction 0 with 17 rules applied. Total rules applied 60 place count 63 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 62 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 62 transition count 144
Applied a total of 62 rules in 10 ms. Remains 62 /93 variables (removed 31) and now considering 144/476 (removed 332) transitions.
// Phase 1: matrix 144 rows 62 cols
[2023-03-16 11:11:20] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-16 11:11:20] [INFO ] Implicit Places using invariants in 145 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/93 places, 144/476 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 61/93 places, 144/476 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s3 1) (LT s4 1)), p1:(OR (LT s22 1) (LT s46 1) (LT s51 1)), p2:(OR (LT s1 1) (LT s3 1) (LT s4 1)), p3:(OR (LT s20 1) (LT s32 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3030 reset in 312 ms.
Product exploration explored 100000 steps with 3030 reset in 351 ms.
Computed a total of 61 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p1 p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p3))))), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2)), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 850 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 212 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 7) seen :4
Finished Best-First random walk after 887 steps, including 5 resets, run visited all 3 properties in 8 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p1 p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p3))))), (X (X p0)), (F (G p0)), (F (G p1)), (F (G p2)), (F (G p3))]
False Knowledge obtained : [(F (OR (NOT p3) (NOT p1))), (F (AND p1 (NOT p2))), (F (AND p3 p1 (NOT p2))), (F (NOT (AND p3 p1 p2))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 883 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 144/144 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 61 cols
[2023-03-16 11:11:23] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-16 11:11:23] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-16 11:11:23] [INFO ] Invariant cache hit.
[2023-03-16 11:11:24] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-16 11:11:24] [INFO ] Invariant cache hit.
[2023-03-16 11:11:24] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 61/61 places, 144/144 transitions.
Computed a total of 61 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p1 p2)), (X p0), (X (X (NOT (OR (NOT p3) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X p1)), (X (X (AND p1 p2))), (X (X (AND p3 p1 p2))), (X (X p0)), (X (X (NOT (AND p3 p1 (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2)), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 793 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Incomplete random walk after 10001 steps, including 212 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 7) seen :4
Finished Best-First random walk after 1423 steps, including 8 resets, run visited all 3 properties in 12 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (AND p1 p2)), (X p0), (X (X (NOT (OR (NOT p3) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X p1)), (X (X (AND p1 p2))), (X (X (AND p3 p1 p2))), (X (X p0)), (X (X (NOT (AND p3 p1 (NOT p2))))), (F (G p0)), (F (G p1)), (F (G p2)), (F (G p3))]
False Knowledge obtained : [(F (OR (NOT p3) (NOT p1))), (F (AND p1 (NOT p2))), (F (AND p3 p1 (NOT p2))), (F (NOT (AND p3 p1 p2))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 1026 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 168 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3))]
Entered a terminal (fully accepting) state of product in 69755 steps with 2113 reset in 181 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-12 finished in 7114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 80 transition count 352
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 46 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 66 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 59 transition count 128
Applied a total of 68 rules in 19 ms. Remains 59 /93 variables (removed 34) and now considering 128/476 (removed 348) transitions.
// Phase 1: matrix 128 rows 59 cols
[2023-03-16 11:11:27] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-16 11:11:27] [INFO ] Implicit Places using invariants in 128 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/93 places, 128/476 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 58/93 places, 128/476 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-13 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 476/476 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 80 transition count 352
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 46 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 66 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 58 transition count 120
Applied a total of 70 rules in 16 ms. Remains 58 /93 variables (removed 35) and now considering 120/476 (removed 356) transitions.
// Phase 1: matrix 120 rows 58 cols
[2023-03-16 11:11:27] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-16 11:11:27] [INFO ] Implicit Places using invariants in 115 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/93 places, 120/476 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 57/93 places, 120/476 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-14 finished in 207 ms.
All properties solved by simple procedures.
Total runtime 23172 ms.

BK_STOP 1678965089056

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="PermAdmissibility-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-02, 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 r261-smll-167863536500516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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