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.r265-smll-167863540200524.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 ltsminxred
Input is PermAdmissibility-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 255K Feb 26 01:19 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.6K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 01:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 206K Feb 26 01:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679061097301

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 13:51:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 13:51:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 13:51:40] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-17 13:51:40] [INFO ] Transformed 168 places.
[2023-03-17 13:51:40] [INFO ] Transformed 592 transitions.
[2023-03-17 13:51:40] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 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
Applied a total of 64 rules in 46 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2023-03-17 13:51:41] [INFO ] Computed 16 place invariants in 49 ms
[2023-03-17 13:51:41] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-17 13:51:41] [INFO ] Invariant cache hit.
[2023-03-17 13:51:41] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2023-03-17 13:51:41] [INFO ] Invariant cache hit.
[2023-03-17 13:51:42] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1263 ms. Remains : 104/168 places, 592/592 transitions.
Support contains 84 out of 104 places after structural reductions.
[2023-03-17 13:51:42] [INFO ] Flatten gal took : 151 ms
[2023-03-17 13:51:43] [INFO ] Flatten gal took : 133 ms
[2023-03-17 13:51:43] [INFO ] Input system was already deterministic with 592 transitions.
Finished random walk after 2444 steps, including 25 resets, run visited all 25 properties in 123 ms. (steps per millisecond=19 )
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
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' '!(X(X(((!p0||G(!p1)) U X(!p2)))))'
Support contains 51 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2023-03-17 13:51:44] [INFO ] Invariant cache hit.
[2023-03-17 13:51:44] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-17 13:51:44] [INFO ] Invariant cache hit.
[2023-03-17 13:51:44] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-17 13:51:44] [INFO ] Invariant cache hit.
[2023-03-17 13:51:45] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1013 ms. Remains : 104/104 places, 592/592 transitions.
Stuttering acceptance computed with spot in 528 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s47 1) (GEQ s85 1) (GEQ s94 1)) (AND (GEQ s50 1) (GEQ s86 1) (GEQ s94 1)) (AND (GEQ s50 1) (GEQ s67 1) (GEQ s94 1)) (AND (GEQ s50 1) (GEQ...], 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1150 ms.
Product exploration explored 100000 steps with 25000 reset in 1020 ms.
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 396 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p1 p2), true, p1]
Finished random walk after 4220 steps, including 43 resets, run visited all 8 properties in 67 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (F (AND p2 (NOT p1))), (F (AND p2 p1)), (F p0), (F (AND p0 p2 p1)), (F p2), (F p1)]
Knowledge based reduction with 7 factoid took 581 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p1 p2), true, p1]
Support contains 51 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2023-03-17 13:51:49] [INFO ] Invariant cache hit.
[2023-03-17 13:51:50] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-17 13:51:50] [INFO ] Invariant cache hit.
[2023-03-17 13:51:50] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-17 13:51:50] [INFO ] Invariant cache hit.
[2023-03-17 13:51:50] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 104/104 places, 592/592 transitions.
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 427 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Incomplete random walk after 10000 steps, including 103 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :6
Finished Best-First random walk after 679 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p2 p1)), (F (AND p2 (NOT p1) p0)), (F p1), (F (AND p2 (NOT p1))), (F p2), (F (OR (AND p2 (NOT p1)) (AND p2 (NOT p0)))), (F (AND p2 p1 p0))]
Knowledge based reduction with 5 factoid took 489 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 304 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Stuttering acceptance computed with spot in 302 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Product exploration explored 100000 steps with 25000 reset in 519 ms.
Product exploration explored 100000 steps with 25000 reset in 540 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 307 ms :[p2, p2, p2, p2, p2, (AND p1 p2), true, p1]
Support contains 51 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 59 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2023-03-17 13:51:54] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-17 13:51:55] [INFO ] Invariant cache hit.
[2023-03-17 13:51:55] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 104/104 places, 592/592 transitions.
Support contains 51 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2023-03-17 13:51:55] [INFO ] Invariant cache hit.
[2023-03-17 13:51:55] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-17 13:51:55] [INFO ] Invariant cache hit.
[2023-03-17 13:51:55] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-17 13:51:55] [INFO ] Invariant cache hit.
[2023-03-17 13:51:56] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 982 ms. Remains : 104/104 places, 592/592 transitions.
Treatment of property PermAdmissibility-PT-05-LTLFireability-00 finished in 12604 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(p1)||p0)))'
Support contains 34 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 19 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-17 13:51:56] [INFO ] Computed 16 place invariants in 12 ms
[2023-03-17 13:51:56] [INFO ] Implicit Places using invariants in 149 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 3 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 176 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-01 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 p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s15 1) (GEQ s21 1)) (AND (GEQ s10 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s20 1) (GEQ s21 1)) (AND (GEQ s12 1) (GEQ 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-01 finished in 319 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(G(p0)))'
Support contains 34 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2023-03-17 13:51:56] [INFO ] Computed 16 place invariants in 20 ms
[2023-03-17 13:51:56] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-17 13:51:56] [INFO ] Invariant cache hit.
[2023-03-17 13:51:57] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2023-03-17 13:51:57] [INFO ] Invariant cache hit.
[2023-03-17 13:51:57] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1038 ms. Remains : 104/104 places, 592/592 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s23 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s19 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s22 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s28 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-02 finished in 1143 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((G(p1)||p0)))'
Support contains 34 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 11 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-17 13:51:58] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-17 13:51:58] [INFO ] Implicit Places using invariants in 126 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 4 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 144 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s33 1) (GEQ s71 1) (GEQ s80 1)) (AND (GEQ s36 1) (GEQ s72 1) (GEQ s80 1)) (AND (GEQ s36 1) (GEQ s53 1) (GEQ s80 1)) (AND (GEQ s36 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-03 finished in 284 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 U (!p1&&G(p2))))))'
Support contains 51 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Applied a total of 1 rules in 22 ms. Remains 86 /104 variables (removed 18) and now considering 464/592 (removed 128) transitions.
// Phase 1: matrix 464 rows 86 cols
[2023-03-17 13:51:58] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-17 13:51:58] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-17 13:51:58] [INFO ] Invariant cache hit.
[2023-03-17 13:51:58] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-17 13:51:58] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-17 13:51:58] [INFO ] Invariant cache hit.
[2023-03-17 13:51:58] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/104 places, 464/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 714 ms. Remains : 86/104 places, 464/592 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p1 p0) (AND (NOT p2) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s36 1) (LT s62 1) (LT s77 1)) (OR (LT s39 1) (LT s73 1) (LT s77 1)) (OR (LT s37 1) (LT s59 1) (LT s77 1)) (OR (LT s40 1) (LT s60 1) (LT s7...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-04 finished in 929 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 17 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 27 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-17 13:51:59] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-17 13:51:59] [INFO ] Implicit Places using invariants in 137 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 18 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 185 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2239 reset in 1018 ms.
Product exploration explored 100000 steps with 2243 reset in 1102 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 245 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 34 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 168 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 468 rows 90 cols
[2023-03-17 13:52:02] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-17 13:52:03] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 31 ms returned sat
[2023-03-17 13:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:03] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2023-03-17 13:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 13:52:04] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 24 ms returned sat
[2023-03-17 13:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:04] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2023-03-17 13:52:04] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 94 ms.
[2023-03-17 13:52:04] [INFO ] Added : 18 causal constraints over 5 iterations in 379 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 17 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 16 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2023-03-17 13:52:04] [INFO ] Invariant cache hit.
[2023-03-17 13:52:05] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-17 13:52:05] [INFO ] Invariant cache hit.
[2023-03-17 13:52:05] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-17 13:52:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-17 13:52:05] [INFO ] Invariant cache hit.
[2023-03-17 13:52:05] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1129 ms. Remains : 90/90 places, 468/468 transitions.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 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 36 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 175 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-17 13:52:06] [INFO ] Invariant cache hit.
[2023-03-17 13:52:07] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 33 ms returned sat
[2023-03-17 13:52:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:07] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-17 13:52:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 13:52:08] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 27 ms returned sat
[2023-03-17 13:52:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:08] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-17 13:52:08] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 53 ms.
[2023-03-17 13:52:09] [INFO ] Added : 21 causal constraints over 5 iterations in 329 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2230 reset in 997 ms.
Product exploration explored 100000 steps with 2254 reset in 1013 ms.
Support contains 17 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2023-03-17 13:52:11] [INFO ] Invariant cache hit.
[2023-03-17 13:52:11] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-17 13:52:11] [INFO ] Invariant cache hit.
[2023-03-17 13:52:11] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-17 13:52:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 13:52:11] [INFO ] Invariant cache hit.
[2023-03-17 13:52:12] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 90/90 places, 468/468 transitions.
Treatment of property PermAdmissibility-PT-05-LTLFireability-05 finished in 12981 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 U X(((p1 U p2)&&(F(!p2)||p3)))))))'
Support contains 35 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 5 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2023-03-17 13:52:12] [INFO ] Computed 16 place invariants in 6 ms
[2023-03-17 13:52:12] [INFO ] Implicit Places using invariants in 132 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 2 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 151 ms. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p2), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (NOT p2), (AND p2 (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s15 1) (GEQ s21 1)) (AND (GEQ s10 1) (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s20 1) (GEQ s21 1)) (AND (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2692 reset in 3398 ms.
Product exploration explored 100000 steps with 2689 reset in 3396 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1440 ms. Reduced automaton from 8 states, 36 edges and 4 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 1895 steps, including 19 resets, run visited all 8 properties in 15 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p2)))), true, (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p0), (F (AND (NOT p2) p1 (NOT p0))), (F (AND (NOT p2) p1 p0)), (F (OR p2 p1 p0)), (F (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 26 factoid took 1474 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2)]
// Phase 1: matrix 468 rows 90 cols
[2023-03-17 13:52:23] [INFO ] Computed 15 place invariants in 4 ms
[2023-03-17 13:52:23] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 32 ms returned sat
[2023-03-17 13:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:24] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-17 13:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 13:52:24] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 21 ms returned sat
[2023-03-17 13:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:25] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-17 13:52:25] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 63 ms.
[2023-03-17 13:52:25] [INFO ] Added : 18 causal constraints over 4 iterations in 219 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 35 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 13 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 86 cols
[2023-03-17 13:52:25] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 13:52:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-17 13:52:25] [INFO ] Invariant cache hit.
[2023-03-17 13:52:25] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-17 13:52:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 13:52:25] [INFO ] Invariant cache hit.
[2023-03-17 13:52:26] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 741 ms. Remains : 86/90 places, 464/468 transitions.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
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 p2) (NOT p1) (NOT p0)), (X (NOT (OR p2 p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT p0)), (X (X (NOT (OR p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 867 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 494 steps, including 5 resets, run visited all 8 properties in 6 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR p2 p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT p0)), (X (X (NOT (OR p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F p0), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) p0 p1)), (F (OR p2 p0 p1)), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 20 factoid took 1137 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2023-03-17 13:52:28] [INFO ] Invariant cache hit.
[2023-03-17 13:52:29] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 28 ms returned sat
[2023-03-17 13:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:29] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-17 13:52:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 13:52:30] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 15 ms returned sat
[2023-03-17 13:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:30] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-17 13:52:30] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 55 ms.
[2023-03-17 13:52:30] [INFO ] Added : 20 causal constraints over 6 iterations in 242 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 73423 steps with 2149 reset in 2827 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-06 finished in 21611 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(!p0) U (p1||X(p0))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 59 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 59 transition count 128
Applied a total of 90 rules in 12 ms. Remains 59 /104 variables (removed 45) and now considering 128/592 (removed 464) transitions.
// Phase 1: matrix 128 rows 59 cols
[2023-03-17 13:52:33] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 13:52:33] [INFO ] Implicit Places using invariants in 100 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/104 places, 128/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 58/104 places, 128/592 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, p0]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s33 1) (GEQ s36 1) (GEQ s45 1)), p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 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]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-08 finished in 290 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)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 50 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.2 ms
Discarding 54 places :
Also discarding 384 output transitions
Drop transitions removed 384 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 38 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 38 transition count 88
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 32 transition count 48
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 32 transition count 48
Applied a total of 37 rules in 8 ms. Remains 32 /104 variables (removed 72) and now considering 48/592 (removed 544) transitions.
// Phase 1: matrix 48 rows 32 cols
[2023-03-17 13:52:34] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-17 13:52:34] [INFO ] Implicit Places using invariants in 61 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/104 places, 48/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 31/104 places, 48/592 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1) (GEQ s21 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 50 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-09 finished in 123 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)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 12 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.1 ms
Discarding 92 places :
Also discarding 576 output transitions
Drop transitions removed 576 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 10 transition count 10
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 9 transition count 10
Applied a total of 6 rules in 4 ms. Remains 9 /104 variables (removed 95) and now considering 10/592 (removed 582) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-17 13:52:34] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 13:52:34] [INFO ] Implicit Places using invariants in 24 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/104 places, 10/592 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 8
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 6 transition count 8
Applied a total of 2 rules in 6 ms. Remains 6 /8 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 6 cols
[2023-03-17 13:52:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 13:52:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 13:52:34] [INFO ] Invariant cache hit.
[2023-03-17 13:52:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/104 places, 8/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 6/104 places, 8/592 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9090 reset in 185 ms.
Product exploration explored 100000 steps with 9090 reset in 232 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 p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-10 finished in 720 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(X(X(F(((F(p2)&&p1)||p0))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 146
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 138
Applied a total of 86 rules in 8 ms. Remains 61 /104 variables (removed 43) and now considering 138/592 (removed 454) transitions.
// Phase 1: matrix 138 rows 61 cols
[2023-03-17 13:52:34] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 13:52:35] [INFO ] Implicit Places using invariants in 81 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 138/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 60/104 places, 138/592 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s21 1) (LT s45 1) (LT s50 1)), p1:(AND (GEQ s21 1) (GEQ s45 1) (GEQ s50 1)), p2:(AND (GEQ s5 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Product exploration explored 100000 steps with 25000 reset in 207 ms.
Computed a total of 60 stabilizing places and 138 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 138
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 (NOT p1) (NOT p2)), true, (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-11 finished in 883 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 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 154
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 146
Applied a total of 86 rules in 6 ms. Remains 61 /104 variables (removed 43) and now considering 146/592 (removed 446) transitions.
// Phase 1: matrix 146 rows 61 cols
[2023-03-17 13:52:35] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-17 13:52:35] [INFO ] Implicit Places using invariants in 94 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 60/104 places, 146/592 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 1) (LT s4 1)), p1:(OR (LT s32 1) (LT s39 1) (LT s51 1)), p2:(OR (LT s27 1) (LT s34 1) (LT s46 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]]
Entered a terminal (fully accepting) state of product in 467 steps with 17 reset in 2 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-12 finished in 308 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)||X(G(p2))))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 63 transition count 158
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 63 transition count 158
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 61 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 61 transition count 142
Applied a total of 86 rules in 20 ms. Remains 61 /104 variables (removed 43) and now considering 142/592 (removed 450) transitions.
// Phase 1: matrix 142 rows 61 cols
[2023-03-17 13:52:36] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-17 13:52:36] [INFO ] Implicit Places using invariants in 99 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/104 places, 142/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 60/104 places, 142/592 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=p0, acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0, 2} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p0, acceptance={1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={2} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={2} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s22 1) (LT s25 1) (LT s48 1)), p1:(AND (GEQ s21 1) (GEQ s45 1) (GEQ s50 1)), p2:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1234 reset in 347 ms.
Product exploration explored 100000 steps with 1234 reset in 368 ms.
Computed a total of 60 stabilizing places and 142 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 142
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 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1944 ms. Reduced automaton from 7 states, 35 edges and 3 AP (stutter insensitive) to 7 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10004 steps, including 103 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Finished Best-First random walk after 999 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=249 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p1)), (F (AND p0 p2 p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) p2)), (F (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p2 p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 34 factoid took 2696 ms. Reduced automaton from 7 states, 35 edges and 3 AP (stutter insensitive) to 7 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 142 rows 60 cols
[2023-03-17 13:52:43] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-17 13:52:43] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 13 ms returned sat
[2023-03-17 13:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:43] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-17 13:52:43] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 126 transitions) in 13 ms.
[2023-03-17 13:52:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 13:52:43] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-17 13:52:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-17 13:52:43] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 126 transitions) in 11 ms.
[2023-03-17 13:52:43] [INFO ] Added : 10 causal constraints over 2 iterations in 50 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 142/142 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-17 13:52:43] [INFO ] Invariant cache hit.
[2023-03-17 13:52:43] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-17 13:52:43] [INFO ] Invariant cache hit.
[2023-03-17 13:52:43] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-17 13:52:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:52:43] [INFO ] Invariant cache hit.
[2023-03-17 13:52:44] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 60/60 places, 142/142 transitions.
Computed a total of 60 stabilizing places and 142 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 142
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 (NOT p1) (NOT p2)), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1909 ms. Reduced automaton from 7 states, 35 edges and 3 AP (stutter insensitive) to 7 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 103 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Finished Best-First random walk after 768 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=384 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (X p0)), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) p1)), (F (AND p0 p2 p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) p2)), (F (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p2 p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 34 factoid took 2438 ms. Reduced automaton from 7 states, 35 edges and 3 AP (stutter insensitive) to 7 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
[2023-03-17 13:52:49] [INFO ] Invariant cache hit.
[2023-03-17 13:52:49] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2023-03-17 13:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:49] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-17 13:52:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 13:52:49] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2023-03-17 13:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 13:52:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-17 13:52:49] [INFO ] Computed and/alt/rep : 12/48/12 causal constraints (skipped 126 transitions) in 9 ms.
[2023-03-17 13:52:50] [INFO ] Added : 11 causal constraints over 3 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1234 reset in 342 ms.
Product exploration explored 100000 steps with 1234 reset in 372 ms.
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 142/142 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-17 13:52:51] [INFO ] Invariant cache hit.
[2023-03-17 13:52:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-17 13:52:51] [INFO ] Invariant cache hit.
[2023-03-17 13:52:51] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-17 13:52:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 13:52:51] [INFO ] Invariant cache hit.
[2023-03-17 13:52:51] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 60/60 places, 142/142 transitions.
Treatment of property PermAdmissibility-PT-05-LTLFireability-13 finished in 15371 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((p0||(F(p1)&&F(p2)))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions removed 256 transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 42 transition count 90
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 42 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 37 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 37 transition count 56
Applied a total of 63 rules in 9 ms. Remains 37 /104 variables (removed 67) and now considering 56/592 (removed 536) transitions.
// Phase 1: matrix 56 rows 37 cols
[2023-03-17 13:52:51] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-17 13:52:51] [INFO ] Implicit Places using invariants in 56 ms returned [11, 17, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/104 places, 56/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 33 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 32 transition count 54
Applied a total of 4 rules in 4 ms. Remains 32 /34 variables (removed 2) and now considering 54/56 (removed 2) transitions.
// Phase 1: matrix 54 rows 32 cols
[2023-03-17 13:52:51] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-17 13:52:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-17 13:52:51] [INFO ] Invariant cache hit.
[2023-03-17 13:52:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/104 places, 54/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 32/104 places, 54/592 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s21 1) (GEQ s26 1) (OR (LT s9 1) (LT s15 1) (LT s23 1))), p1:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s7 1)), p2:(AND (GEQ s18 1) (GEQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 89 steps with 2 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-15 finished in 322 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(X(((!p0||G(!p1)) U X(!p2)))))'
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))'
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)||X(G(p2))))))'
[2023-03-17 13:52:52] [INFO ] Flatten gal took : 84 ms
[2023-03-17 13:52:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 27 ms.
[2023-03-17 13:52:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 592 transitions and 2944 arcs took 20 ms.
Total runtime 72107 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2546/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2546/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2546/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PermAdmissibility-PT-05-LTLFireability-00
Could not compute solution for formula : PermAdmissibility-PT-05-LTLFireability-05
Could not compute solution for formula : PermAdmissibility-PT-05-LTLFireability-13

BK_STOP 1679061178269

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PermAdmissibility-PT-05-LTLFireability-00
ltl formula formula --ltl=/tmp/2546/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 592 transitions and 2944 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2546/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2546/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2546/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2546/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name PermAdmissibility-PT-05-LTLFireability-05
ltl formula formula --ltl=/tmp/2546/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 592 transitions and 2944 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2546/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2546/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2546/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2546/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name PermAdmissibility-PT-05-LTLFireability-13
ltl formula formula --ltl=/tmp/2546/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 592 transitions and 2944 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2546/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2546/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2546/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2546/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PermAdmissibility-PT-05, 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 r265-smll-167863540200524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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